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 Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088400319
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463703529855

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ Philosophers-PT-000005
FORMULA Philosophers-COL-000005-CTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-000005-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-CTLFireability-15 FALSE 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-CTLFireability.task
lola: read: AF (((((FIREABLE(End_4) OR FIREABLE(End_3)) OR FIREABLE(End_2)) OR FIREABLE(End_1)) OR FIREABLE(End_5))) : AF (((((FIREABLE(End_4) OR FIREABLE(End_3)) OR FIREABLE(End_2)) OR FIREABLE(End_1)) OR FIREABLE(End_5))) : AX (((AF (((((FIREABLE(End_4) OR FIREABLE(End_3)) OR FIREABLE(End_2)) OR FIREABLE(End_1)) OR FIREABLE(End_5))) OR AF (((((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2)) OR FIREABLE(FF2a_5)) OR FI... (shortened)
lola: formula length: 8000
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))))
lola: processed formula length: 109
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))))
lola: processed formula length: 109
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: AX ((AF ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))) OR (AF ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))) OR EG ((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND ! FIREABLE(FF1b_5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((A(TRUE U (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))) OR (A(TRUE U (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))) OR !(A(TRUE U !((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND ! FIREABLE(FF1b_5)))))))))))
lola: processed formula length: 373
lola: 914 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((A((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))) U (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))) AND EF (((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(En... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))) U (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))) AND E(TRUE U ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (F... (shortened)
lola: processed formula length: 441
lola: 913 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((! FIREABLE(FF2b_1) AND (! FIREABLE(FF2b_4) AND (! FIREABLE(FF2b_5) AND (! FIREABLE(FF2b_2) AND (! FIREABLE(FF2b_3) AND ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))))))) OR (A((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF2b_1) AND (! FIREABLE(FF2b_4) AND (! FIREABLE(FF2b_5) AND (! FIREABLE(FF2b_2) AND (! FIREABLE(FF2b_3) AND ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))))))))
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 17 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 unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND ! FIREABLE(FF1b_5))))) U ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND ! FIREABLE(FF1b_5))))) U ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))))
lola: processed formula length: 334
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))
lola: processed formula length: 108
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (E((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) R (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4)))))) OR (AF ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (... (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: FIREABLE(FF2a_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-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 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) R (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4)))))) U !((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))))))
lola: processed formula length: 251
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) U EG ((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) U !(A(TRUE U !((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))))
lola: processed formula length: 225
lola: 912 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) U ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))) OR (AG ((FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) U ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) U ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))))
lola: processed formula length: 339
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((! FIREABLE(End_4) AND (! FIREABLE(End_3) AND (! FIREABLE(End_2) AND (! FIREABLE(End_1) AND ! FIREABLE(End_5)))))) OR ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND (! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND ! FIREABLE(FF1b_5)))))))
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: EG ((! FIREABLE(End_4) AND (! FIREABLE(End_3) AND (! FIREABLE(End_2) AND (! FIREABLE(End_1) AND ! FIREABLE(End_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((! FIREABLE(End_4) AND (! FIREABLE(End_3) AND (! FIREABLE(End_2) AND (! FIREABLE(End_1) AND ! FIREABLE(End_5))))))))
lola: processed formula length: 129
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))) AND (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND (! FIREABLE(FF2a_4) AND (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_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 4 bytes per marking, with 17 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))) AND ((FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5))))) AND (AF ((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))) AND (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-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 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(End_4) AND (! FIREABLE(End_3) AND (! FIREABLE(End_2) AND (! FIREABLE(End_1) AND ! FIREABLE(End_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (AG ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))))) OR EF (EX ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))) AND ((EX ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))))))
lola: processed formula length: 136
lola: 912 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))
lola: processed formula length: 118
lola: 912 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(End_2) OR (FIREABLE(End_1) OR FIREABLE(End_5)))))))))))
lola: processed formula length: 213
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR (FIREABLE(FF2a_4) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))))))))))
lola: processed formula length: 218
lola: 911 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 20 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 21 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (AG ((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))))) AND AF ((FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_2) OR (FIREABLE(FF2b_3) OR ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR (FIREABLE(FF1b_5) OR (FIREABLE(End_4) OR (FIREABLE(End_3) OR (FIREABLE(E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG ((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4)))))))))
lola: processed formula length: 138
lola: 912 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))) AND AF (((! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_3) AND ! FIREABLE(FF2a_4))))) OR (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_4) OR (FIREABLE(F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF2a_1) OR (FIREABLE(FF2a_2) OR (FIREABLE(FF2a_5) OR (FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000005-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: RESULT
lola: summary: no no no no yes yes no yes yes no no yes unknown no yes no

BK_STOP 1463703531059

--------------------
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="Philosophers-PT-000005"
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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 Philosophers-PT-000005, 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-146369088400319"
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 ;