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-2979
Executing tool lola
Input is PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088600463
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463714114140

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ PhilosophersDyn-PT-03
FORMULA PhilosophersDyn-COL-03-CTLFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-CTLFireability.task
lola: read: EG (E((((((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1)) OR FIREABLE(Initialize_3_2)) OR FIREABLE(Initialize_1_2)) OR FIREABLE(Initialize_1_3)) OR FIREABLE(Initialize_2_3)) U !(((((((((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3)) OR FIREABLE(TakeRight_2_1)) OR FIREABLE(TakeRight_3_1)) OR FIREABLE(TakeRight_1_3)) OR FIREABLE(TakeRight_3_2)) OR FIREABLE(TakeRight_1_2)) OR FIREABLE(Tak... (shortened)
lola: formula length: 20358
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (E((FIREABLE(Initialize_3_1) OR (FIREABLE(Initialize_2_1) OR (FIREABLE(Initialize_3_2) OR (FIREABLE(Initialize_1_2) OR (FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))) U (! FIREABLE(TakeRight_1_1) AND (! FIREABLE(TakeRight_2_3) AND (! FIREABLE(TakeRight_2_1) AND (! FIREABLE(TakeRight_3_1) AND (! FIREABLE(TakeRight_1_3) AND (! FIREABLE(TakeRight_3_2) AND (! FIREABLE(TakeRight_1_2) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E((FIREABLE(Initialize_3_1) OR (FIREABLE(Initialize_2_1) OR (FIREABLE(Initialize_3_2) OR (FIREABLE(Initialize_1_2) OR (FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))) U (! FIREABLE(TakeRight_1_1) AND (! FIREABLE(TakeRight_2_3) AND (! FIREABLE(TakeRight_2_1) AND (! FIREABLE(TakeRight_3_1) AND (! FIREABLE(TakeRight_1_3) AND (! FIREABLE(TakeRight_3_2) AND (! FIREABLE(TakeRight_... (shortened)
lola: processed formula length: 477
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AF ((FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR (FIREABLE(Eat_3_3) OR ((FIREABLE(TakeRight_1_1) OR (FIREABLE(TakeRight_2_3) OR (FIREABLE(TakeRight_2_1) OR (FIREABLE(TakeRight_3_1) OR (FIREABLE(TakeRight_1_3) OR (FIREABLE(TakeRight_3_2) OR (FIREABLE(TakeRight_1_2) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR (FIREABLE(Eat_3_3) OR ((FIREABLE(TakeRight_1_1) OR (FIREABLE(TakeRight_2_3) OR (FIREABLE(TakeRight_2_1) OR (FIREABLE(TakeRight_3_1) OR (FIREABLE(TakeRight_1_3) OR (FIREABLE(TakeRight_3_2) OR (FIREABLE(TakeRight_1... (shortened)
lola: processed formula length: 738
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (EG ((! FIREABLE(TakeLeft_3) AND (! FIREABLE(TakeLeft_1) AND ! FIREABLE(TakeLeft_2))))) OR ((FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR (FIREABLE(Eat_3_3) OR (! FIREABLE(TakeRight_1_1) AND (! FIREABLE(TakeRight_2_3) AND (! FIREABLE(TakeRight_2_1) AND (! FIREABLE(T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((! FIREABLE(TakeLeft_3) AND (! FIREABLE(TakeLeft_1) AND ! FIREABLE(TakeLeft_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((! FIREABLE(TakeLeft_3) AND (! FIREABLE(TakeLeft_1) AND ! FIREABLE(TakeLeft_2)))))))
lola: processed formula length: 106
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((((! FIREABLE(Initialize_3_1) AND (! FIREABLE(Initialize_2_1) AND (! FIREABLE(Initialize_3_2) AND (! FIREABLE(Initialize_1_2) AND (! FIREABLE(Initialize_1_3) AND ! FIREABLE(Initialize_2_3)))))) OR ((! FIREABLE(Initialize_3_1) AND (! FIREABLE(Initialize_2_1) AND (! FIREABLE(Initialize_3_2) AND (! FIREABLE(Initialize_1_2) AND (! FIREABLE(Initialize_1_3) AND ! FIREABLE(Initialize_2_3)))))) OR (! ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((((! FIREABLE(Initialize_3_1) AND (! FIREABLE(Initialize_2_1) AND (! FIREABLE(Initialize_3_2) AND (! FIREABLE(Initialize_1_2) AND (! FIREABLE(Initialize_1_3) AND ! FIREABLE(Initialize_2_3)))))) OR ((! FIREABLE(Initialize_3_1) AND (! FIREABLE(Initialize_2_1) AND (! FIREABLE(Initialize_3_2) AND (! FIREABLE(Initialize_1_2) AND (! FIREABLE(Initialize_1_3) AND ! FIREABLE(Initialize_2_3))))... (shortened)
lola: processed formula length: 958
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF ((FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U (FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))))))))))
lola: processed formula length: 227
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AX ((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (!... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (! F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (! FI... (shortened)
lola: processed formula length: 780
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (! FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (! FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! FIREABLE(Join_3_2_2) AND (! FIREABLE(Join_1_3_1) AND (! FIREABLE(Join_1_3_3) AND (!... (shortened)
lola: processed formula length: 1567
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))))))))
lola: processed formula length: 211
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG ((FIREABLE(TakeRight_1_1) OR (FIREABLE(TakeRight_2_3) OR (FIREABLE(TakeRight_2_1) OR (FIREABLE(TakeRight_3_1) OR (FIREABLE(TakeRight_1_3) OR (FIREABLE(TakeRight_3_2) OR (FIREABLE(TakeRight_1_2) OR (FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))))))) AND A(((FIREABLE(Eat_3_2) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_1_2) OR (FIREABLE(Eat_2_2) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_1) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(TakeRight_1_1) OR (FIREABLE(TakeRight_2_3) OR (FIREABLE(TakeRight_2_1) OR (FIREABLE(TakeRight_3_1) OR (FIREABLE(TakeRight_1_3) OR (FIREABLE(TakeRight_3_2) OR (FIREABLE(TakeRight_1_2) OR (FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))))))))
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 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF ((FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR... (shortened)
lola: processed formula length: 940
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((FIREABLE(SearchForks_1) OR (FIREABLE(SearchForks_3) OR (FIREABLE(SearchForks_2) OR (! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AND (! ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(SearchForks_1) OR (FIREABLE(SearchForks_3) OR (FIREABLE(SearchForks_2) OR (! FIREABLE(Join_2_1_2) AND (! FIREABLE(Join_2_1_1) AND (! FIREABLE(Join_2_3_2) AND (! FIREABLE(Join_1_1_2) AND (! FIREABLE(Join_3_1_1) AND (! FIREABLE(Join_3_2_3) AND (! FIREABLE(Join_1_2_1) AND (! FIREABLE(Join_3_3_2) AND (! FIREABLE(Join_3_3_1) AND (! FIREABLE(Join_2_2_3) AND (! FIREABLE(Join_2_3_1) AN... (shortened)
lola: processed formula length: 1123
lola: 7674 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) AND ((FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Initialize_3_1) OR (FIREABLE(Initialize_2_1) OR (FIREABLE(Initialize_3_2) OR (FIREABLE(Initialize_1_2) OR (FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF ((! FIREABLE(TakeLeft_3) AND (! FIREABLE(TakeLeft_1) AND ! FIREABLE(TakeLeft_2)))) U A((FIREABLE(SearchForks_1) OR (FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))) U (FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (! FIREABLE(TakeLeft_3) AND (! FIREABLE(TakeLeft_1) AND ! FIREABLE(TakeLeft_2)))) U A((FIREABLE(SearchForks_1) OR (FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))) U (FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))))
lola: processed formula length: 255
lola: 7675 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((! FIREABLE(Leave_2_1_1) AND (! FIREABLE(Leave_3_2_3) AND (! FIREABLE(Leave_1_1_2) AND (! FIREABLE(Leave_3_1_1) AND (! FIREABLE(Leave_3_3_2) AND (! FIREABLE(Leave_1_2_1) AND (! FIREABLE(Leave_1_1_3) AND (! FIREABLE(Leave_2_2_3) AND (! FIREABLE(Leave_3_3_1) AND (! FIREABLE(Leave_2_3_3) AND (! FIREABLE(Leave_2_2_1) AND (! FIREABLE(Leave_1_3_2) AND (! FIREABLE(Leave_2_3_1) AND (! FIREABLE(Leave_1_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(Leave_2_1_1) AND (! FIREABLE(Leave_3_2_3) AND (! FIREABLE(Leave_1_1_2) AND (! FIREABLE(Leave_3_1_1) AND (! FIREABLE(Leave_3_3_2) AND (! FIREABLE(Leave_1_2_1) AND (! FIREABLE(Leave_1_1_3) AND (! FIREABLE(Leave_2_2_3) AND (! FIREABLE(Leave_3_3_1) AND (! FIREABLE(Leave_2_3_3) AND (! FIREABLE(Leave_2_2_1) AND (! FIREABLE(Leave_1_3_2) AND (! FIREABLE(Leave_2_3_1) AND (! FIREABLE(Leave_1_3_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(((FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) AND (FIREABLE(Join_2_1_2) OR (FIREABLE(Join_2_1_1) OR (FIREABLE(Join_2_3_2) OR (FIREABLE(Join_1_1_2) OR (FIREABLE(Join_3_1_1) OR (FIREABLE(Join_3_2_3) OR (FIREABLE(Join_1_2_1) OR (FIREABLE(Join_3_3_2) OR (FIREABLE(Join_3_3_1) OR (FIREABLE(Join_2_2_3) OR (FIREABLE(Join_2_3_1) OR (FIREABLE(Join_3_2_2) OR (FIREABLE(Join_1_3_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) AND (FIREABLE(Join_2_1_2) OR (FIREABLE(Join_2_1_1) OR (FIREABLE(Join_2_3_2) OR (FIREABLE(Join_1_1_2) OR (FIREABLE(Join_3_1_1) OR (FIREABLE(Join_3_2_3) OR (FIREABLE(Join_1_2_1) OR (FIREABLE(Join_3_3_2) OR (FIREABLE(Join_3_3_1) OR (FIREABLE(Join_2_2_3) OR (FIREABLE(Join_2_3_1) OR (FIREABLE(Join_3_2_2) OR (FIREABLE(Join_1_3_1... (shortened)
lola: processed formula length: 1190
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (EF ((FIREABLE(Initialize_3_1) OR (FIREABLE(Initialize_2_1) OR (FIREABLE(Initialize_3_2) OR (FIREABLE(Initialize_1_2) OR (FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(E(TRUE U (FIREABLE(Initialize_3_1) OR (FIREABLE(Initialize_2_1) OR (FIREABLE(Initialize_3_2) OR (FIREABLE(Initialize_1_2) OR (FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))))))))
lola: processed formula length: 210
lola: 7675 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (... (shortened)
lola: processed formula length: 733
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(Leave_2_1_1) OR (FIREABLE(Leave_3_2_3) OR (FIREABLE(Leave_1_1_2) OR (FIREABLE(Leave_3_1_1) OR (FIREABLE(Leave_3_3_2) OR (FIREABLE(Leave_1_2_1) OR (FIREABLE(Leave_1_1_3) OR (FIREABLE(Leave_2_2_3) OR (FIREABLE(Leave_3_3_1) OR (FIREABLE(Leave_2_3_3) OR (FIREABLE(Leave_2_2_1) OR (FIREABLE(Leave_1_3_2) OR (FIREABLE(Leave_2_3_1) OR (FIREABLE(Leave_1_3_3) OR (FIREABLE(Leave_2_3_2) OR (... (shortened)
lola: processed formula length: 2190
lola: 7673 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (AG ((FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(!(E(TRUE U !((FIREABLE(TakeLeft_3) OR (FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))))))
lola: processed formula length: 102
lola: 7675 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: RESULT
lola: summary: yes no yes yes no no no yes no no yes no no no yes yes

BK_STOP 1463714114568

--------------------
content from 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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-PT-03, 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 r086kn-ebro-146369088600463"
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 ;