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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088600477
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463714755676

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PhilosophersDyn-PT-10
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityFireability-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: 2480/65536 symbol table entries, 65 collisions
lola: preprocessing...
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-ReachabilityFireability.task
lola: read: AG (!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Eat_10_5) OR FIREABLE(Eat_4_7)) OR FIREABLE(Eat_4_1)) OR FIREABLE(Eat_3_1)) OR FIREABLE(Eat_2_3)) OR FIREABLE(Eat_2_9)) OR FIREABLE(Eat_5_9)) OR FIREABLE(Eat_1_5)) OR FIREABLE(Eat_5_8)) OR FIREABLE(Eat_2_4)) OR FIREABLE(Eat_1_3)) OR FIREABLE(Eat_4_10)) OR FIREABLE(Eat_5_4)) OR FIREABLE... (shortened)
lola: formula length: 542572
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(Eat_10_5) AND (! FIREABLE(Eat_4_7) AND (! FIREABLE(Eat_4_1) AND (! FIREABLE(Eat_3_1) AND (! FIREABLE(Eat_2_3) AND (! FIREABLE(Eat_2_9) AND (! FIREABLE(Eat_5_9) AND (! FIREABLE(Eat_1_5) AND (! FIREABLE(Eat_5_8) AND (! FIREABLE(Eat_2_4) AND (! FIREABLE(Eat_1_3) AND (! FIREABLE(Eat_4_10) AND (! FIREABLE(Eat_5_4) AND (! FIREABLE(Eat_7_7) AND (! FIREABLE(Eat_2_8) AND (! FIREABLE(Eat_2_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 300 literals
lola: ========================================
lola: subprocess 1 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Join_3_10_4) OR (FIREABLE(Join_6_1_10) OR (FIREABLE(Join_1_5_1) OR (FIREABLE(Join_4_2_10) OR (FIREABLE(Join_9_9_7) OR (FIREABLE(Join_5_7_8) OR (FIREABLE(Join_8_5_10) OR (FIREABLE(Join_8_6_4) OR (FIREABLE(Join_4_9_4) OR (FIREABLE(Join_3_1_6) OR (FIREABLE(Join_6_10_5) OR (FIREABLE(Join_1_7_7) OR (FIREABLE(Join_5_8_5) OR (FIREABLE(Join_10_10_4) OR (FIREABLE(Join_7_8_5) OR (FIREABLE(Joi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Initialize_5_1) AND (! FIREABLE(Initialize_10_3) AND (! FIREABLE(Initialize_9_7) AND (! FIREABLE(Initialize_8_4) AND (! FIREABLE(Initialize_7_1) AND (! FIREABLE(Initialize_5_2) AND (! FIREABLE(Initialize_6_5) AND (! FIREABLE(Initialize_1_7) AND (! FIREABLE(Initialize_2_3) AND (! FIREABLE(Initialize_7_10) AND (! FIREABLE(Initialize_4_10) AND (! FIREABLE(Initialize_2_10) AND (! FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 206262174964444602233745641117351329687130602518436357107950913358014870101671104492105025306994147328 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(TakeLeft_2) OR (FIREABLE(TakeLeft_7) OR (FIREABLE(TakeLeft_5) OR (FIREABLE(TakeLeft_4) OR (FIREABLE(TakeLeft_10) OR (FIREABLE(TakeLeft_9) OR (FIREABLE(TakeLeft_1) OR (FIREABLE(TakeLeft_6) OR (FIREABLE(TakeLeft_8) OR (FIREABLE(TakeLeft_3) OR (((FIREABLE(TakeRight_8_5) OR (FIREABLE(TakeRight_7_5) OR (FIREABLE(TakeRight_4_9) OR (FIREABLE(TakeRight_3_1) OR (FIREABLE(TakeRight_6_8) OR (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Initialize_5_1) OR (FIREABLE(Initialize_10_3) OR (FIREABLE(Initialize_9_7) OR (FIREABLE(Initialize_8_4) OR (FIREABLE(Initialize_7_1) OR (FIREABLE(Initialize_5_2) OR (FIREABLE(Initialize_6_5) OR (FIREABLE(Initialize_1_7) OR (FIREABLE(Initialize_2_3) OR (FIREABLE(Initialize_7_10) OR (FIREABLE(Initialize_4_10) OR (FIREABLE(Initialize_2_10) OR (FIREABLE(Initialize_6_8) OR (FIREABLE(Init... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 21933100 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Leave_6_10_2) AND (! FIREABLE(Leave_6_7_5) AND (! FIREABLE(Leave_1_3_5) AND (! FIREABLE(Leave_3_5_4) AND (! FIREABLE(Leave_8_1_9) AND (! FIREABLE(Leave_1_6_8) AND (! FIREABLE(Leave_7_2_9) AND (! FIREABLE(Leave_9_9_6) AND (! FIREABLE(Leave_1_10_10) AND (! FIREABLE(Leave_1_10_2) AND (! FIREABLE(Leave_5_1_3) AND (! FIREABLE(Leave_2_9_2) AND (! FIREABLE(Leave_4_1_4) AND (! FIREABLE(Lea... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Leave_6_10_2) OR (FIREABLE(Leave_6_7_5) OR (FIREABLE(Leave_1_3_5) OR (FIREABLE(Leave_3_5_4) OR (FIREABLE(Leave_8_1_9) OR (FIREABLE(Leave_1_6_8) OR (FIREABLE(Leave_7_2_9) OR (FIREABLE(Leave_9_9_6) OR (FIREABLE(Leave_1_10_10) OR (FIREABLE(Leave_1_10_2) OR (FIREABLE(Leave_5_1_3) OR (FIREABLE(Leave_2_9_2) OR (FIREABLE(Leave_4_1_4) OR (FIREABLE(Leave_5_2_4) OR (FIREABLE(Leave_3_4_6) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Eat_10_5) OR (FIREABLE(Eat_4_7) OR (FIREABLE(Eat_4_1) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_2_9) OR (FIREABLE(Eat_5_9) OR (FIREABLE(Eat_1_5) OR (FIREABLE(Eat_5_8) OR (FIREABLE(Eat_2_4) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_4_10) OR (FIREABLE(Eat_5_4) OR (FIREABLE(Eat_7_7) OR (FIREABLE(Eat_2_8) OR (FIREABLE(Eat_2_5) OR (FIREABLE(Eat_7_1) OR (FIREABLE(Eat_4_2) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 300 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Eat_10_5) OR (FIREABLE(Eat_4_7) OR (FIREABLE(Eat_4_1) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_2_9) OR (FIREABLE(Eat_5_9) OR (FIREABLE(Eat_1_5) OR (FIREABLE(Eat_5_8) OR (FIREABLE(Eat_2_4) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_4_10) OR (FIREABLE(Eat_5_4) OR (FIREABLE(Eat_7_7) OR (FIREABLE(Eat_2_8) OR (FIREABLE(Eat_2_5) OR (FIREABLE(Eat_7_1) OR (FIREABLE(Eat_4_2) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 300 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Eat_10_5) AND (! FIREABLE(Eat_4_7) AND (! FIREABLE(Eat_4_1) AND (! FIREABLE(Eat_3_1) AND (! FIREABLE(Eat_2_3) AND (! FIREABLE(Eat_2_9) AND (! FIREABLE(Eat_5_9) AND (! FIREABLE(Eat_1_5) AND (! FIREABLE(Eat_5_8) AND (! FIREABLE(Eat_2_4) AND (! FIREABLE(Eat_1_3) AND (! FIREABLE(Eat_4_10) AND (! FIREABLE(Eat_5_4) AND (! FIREABLE(Eat_7_7) AND (! FIREABLE(Eat_2_8) AND (! FIREABLE(Eat_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Initialize_5_1) OR (FIREABLE(Initialize_10_3) OR (FIREABLE(Initialize_9_7) OR (FIREABLE(Initialize_8_4) OR (FIREABLE(Initialize_7_1) OR (FIREABLE(Initialize_5_2) OR (FIREABLE(Initialize_6_5) OR (FIREABLE(Initialize_1_7) OR (FIREABLE(Initialize_2_3) OR (FIREABLE(Initialize_7_10) OR (FIREABLE(Initialize_4_10) OR (FIREABLE(Initialize_2_10) OR (FIREABLE(Initialize_6_8) OR (FIREABLE(Initi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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 11 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(TakeLeft_2) OR (FIREABLE(TakeLeft_7) OR (FIREABLE(TakeLeft_5) OR (FIREABLE(TakeLeft_4) OR (FIREABLE(TakeLeft_10) OR (FIREABLE(TakeLeft_9) OR (FIREABLE(TakeLeft_1) OR (FIREABLE(TakeLeft_6) OR (FIREABLE(TakeLeft_8) OR (FIREABLE(TakeLeft_3) OR (FIREABLE(SearchForks_3) OR (FIREABLE(SearchForks_4) OR (FIREABLE(SearchForks_10) OR (FIREABLE(SearchForks_8) OR (FIREABLE(SearchForks_1) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 17950599047095940757195049149319795636540605535879168 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SearchForks_3) OR (FIREABLE(SearchForks_4) OR (FIREABLE(SearchForks_10) OR (FIREABLE(SearchForks_8) OR (FIREABLE(SearchForks_1) OR (FIREABLE(SearchForks_9) OR (FIREABLE(SearchForks_7) OR (FIREABLE(SearchForks_6) OR (FIREABLE(SearchForks_2) OR FIREABLE(SearchForks_5)))))))))) AND ((FIREABLE(SearchForks_3) OR (FIREABLE(SearchForks_4) OR (FIREABLE(SearchForks_10) OR (FIREABLE(SearchFor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 70219980 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Join_3_10_4) OR (FIREABLE(Join_6_1_10) OR (FIREABLE(Join_1_5_1) OR (FIREABLE(Join_4_2_10) OR (FIREABLE(Join_9_9_7) OR (FIREABLE(Join_5_7_8) OR (FIREABLE(Join_8_5_10) OR (FIREABLE(Join_8_6_4) OR (FIREABLE(Join_4_9_4) OR (FIREABLE(Join_3_1_6) OR (FIREABLE(Join_6_10_5) OR (FIREABLE(Join_1_7_7) OR (FIREABLE(Join_5_8_5) OR (FIREABLE(Join_10_10_4) OR (FIREABLE(Join_7_8_5) OR (FIREABLE(Joi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Eat_10_5) OR (FIREABLE(Eat_4_7) OR (FIREABLE(Eat_4_1) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_2_9) OR (FIREABLE(Eat_5_9) OR (FIREABLE(Eat_1_5) OR (FIREABLE(Eat_5_8) OR (FIREABLE(Eat_2_4) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_4_10) OR (FIREABLE(Eat_5_4) OR (FIREABLE(Eat_7_7) OR (FIREABLE(Eat_2_8) OR (FIREABLE(Eat_2_5) OR (FIREABLE(Eat_7_1) OR (FIREABLE(Eat_4_2) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 300 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Eat_10_5) OR (FIREABLE(Eat_4_7) OR (FIREABLE(Eat_4_1) OR (FIREABLE(Eat_3_1) OR (FIREABLE(Eat_2_3) OR (FIREABLE(Eat_2_9) OR (FIREABLE(Eat_5_9) OR (FIREABLE(Eat_1_5) OR (FIREABLE(Eat_5_8) OR (FIREABLE(Eat_2_4) OR (FIREABLE(Eat_1_3) OR (FIREABLE(Eat_4_10) OR (FIREABLE(Eat_5_4) OR (FIREABLE(Eat_7_7) OR (FIREABLE(Eat_2_8) OR (FIREABLE(Eat_2_5) OR (FIREABLE(Eat_7_1) OR (FIREABLE(Eat_4_2) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: Transformation into DNF: expect 1398000 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no no no yes no no no yes yes no no no no no yes no

BK_STOP 1463716066633

--------------------
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-10"
export BK_EXAMINATION="ReachabilityFireability"
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-10.tgz
mv PhilosophersDyn-PT-10 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-10, examination is ReachabilityFireability"
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-146369088600477"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;