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 S_Philosophers-PT-000100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433134200900
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464488015872

bkconf 3600
===========================================================================================
===========================================================================================
S_Philosophers-PT-000100: translating Petri net model.pnml into LoLA format
S_Philosophers-PT-000100: translating formula ReachabilityFireability into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityFireability.xml
touch formulae;


in benchkit_head lolaszeit 3539
ReachabilityFireability @ S_Philosophers-PT-000100
Makefile:76: recipe for target 'verify' failed
FORMULA Philosophers-COL-000100-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA Philosophers-COL-000100-ReachabilityFireability-15 CANNOT_COMPUTE
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 500 places, 500 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000100-ReachabilityFireability.task
lola: read: EF (!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(FF1a_6) OR FIREABLE(FF1a_7)) OR FIREABLE(FF1a_8)) OR FIREABLE(FF1a_9)) OR FIREABLE(FF1a_2)) OR FIREABLE(FF1a_3)) OR FIREABLE(FF1a_4)) OR FIREABLE(FF1a_5)) OR FIREABLE(FF1a_1)) OR FIREABLE(FF1a_48)) OR FIREABLE(FF1a_49)) OR FIREABLE(FF1a_46)) OR FIREABLE(FF1a_47)) OR FIREABLE(FF1a_44)) ... (shortened)
lola: formula length: 95759
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_2) AND (! FIREABLE(FF1a_3) AND (! FIREABLE(FF1a_4) AND (! FIREABLE(FF1a_5) AND (! FIREABLE(FF1a_1) AND (! FIREABLE(FF1a_48) AND (! FIREABLE(FF1a_49) AND (! FIREABLE(FF1a_46) AND (! FIREABLE(FF1a_47) AND (! FIREABLE(FF1a_44) AND (! FIREABLE(FF1a_45) AND (! FIREABLE(FF1a_42) AND (! FI... (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 1200 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 5070602400912917043036859400192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_8) OR (FIREABLE(FF1b_9) OR (FIREABLE(FF1b_6) OR (FIREABLE(FF1b_7) OR (FIREABLE(FF1b_12) OR (FIREABLE(FF1b_13) OR (FIREABLE(FF1b_10) OR (FIREABLE(FF1b_11) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_19) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIR... (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 1200 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_8) OR (FIREABLE(FF1b_9) OR (FIREABLE(FF1b_6) OR (FIREABLE(FF1b_7) OR (FIREABLE(FF1b_12) OR (FIREABLE(FF1b_13) OR (FIREABLE(FF1b_10) OR (FIREABLE(FF1b_11) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_19) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIR... (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 1200 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_45) OR (FIREABLE(FF2a_44) OR (FIREABLE(FF2a_43) OR (FIREABLE(FF2a_42) OR (FIREABLE(FF2a_49) OR (FIREABLE(FF2a_48) OR (FIREABLE(FF2a_47) OR (FIREABLE(FF2a_46) OR (FIREABLE(FF2a_37) OR (FIREABLE(FF2a_36) OR (FIREABLE(FF2a_35) OR (FIREABLE(FF2a_34) OR (FIREABLE(FF2a_41) OR (FIREABLE(FF2a_40) OR (FIREABLE(FF2a_39) OR (FIREABLE(FF2a_38) OR (FIREABLE(FF2a_60) 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 1200 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_3) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_5) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_48) OR (FIREABLE(FF1a_49) OR (FIREABLE(FF1a_46) OR (FIREABLE(FF1a_47) OR (FIREABLE(FF1a_44) OR (FIREABLE(FF1a_45) OR (FIREABLE(FF1a_42) OR (FIREABLE(FF1a_43) OR (FIREABLE(FF1a_56) OR (FIREABLE... (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 1200 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_45) OR (FIREABLE(FF2a_44) OR (FIREABLE(FF2a_43) OR (FIREABLE(FF2a_42) OR (FIREABLE(FF2a_49) OR (FIREABLE(FF2a_48) OR (FIREABLE(FF2a_47) OR (FIREABLE(FF2a_46) OR (FIREABLE(FF2a_37) OR (FIREABLE(FF2a_36) OR (FIREABLE(FF2a_35) OR (FIREABLE(FF2a_34) OR (FIREABLE(FF2a_41) OR (FIREABLE(FF2a_40) OR (FIREABLE(FF2a_39) OR (FIREABLE(FF2a_38) OR (FIREABLE(FF2a_60) 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 1200 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_2) AND (! FIREABLE(FF1a_3) AND (! FIREABLE(FF1a_4) AND (! FIREABLE(FF1a_5) AND (! FIREABLE(FF1a_1) AND (! FIREABLE(FF1a_48) AND (! FIREABLE(FF1a_49) AND (! FIREABLE(FF1a_46) AND (! FIREABLE(FF1a_47) AND (! FIREABLE(FF1a_44) AND (! FIREABLE(FF1a_45) AND (! FIREABLE(FF1a_42) AND (! F... (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 1200 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(FF2b_19) AND (! FIREABLE(FF2b_18) AND (! FIREABLE(FF2b_21) AND (! FIREABLE(FF2b_20) AND (! FIREABLE(FF2b_15) AND (! FIREABLE(FF2b_14) AND (! FIREABLE(FF2b_17) AND (! FIREABLE(FF2b_16) AND (! FIREABLE(FF2b_27) AND (! FIREABLE(FF2b_26) AND (! FIREABLE(FF2b_29) AND (! FIREABLE(FF2b_28) AND (! FIREABLE(FF2b_23) AND (! FIREABLE(FF2b_22) AND (! FIREABLE(FF2b_25) AND (! FIREABLE(FF2b_24)... (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 1200 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 451228202827924375836078166351611693752405306812094970172943630336 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_8) OR (FIREABLE(FF1b_9) OR (FIREABLE(FF1b_6) OR (FIREABLE(FF1b_7) OR (FIREABLE(FF1b_12) OR (FIREABLE(FF1b_13) OR (FIREABLE(FF1b_10) OR (FIREABLE(FF1b_11) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_19) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIR... (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 1200 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 5070602400912917043036859400192 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(FF2b_19) AND (! FIREABLE(FF2b_18) AND (! FIREABLE(FF2b_21) AND (! FIREABLE(FF2b_20) AND (! FIREABLE(FF2b_15) AND (! FIREABLE(FF2b_14) AND (! FIREABLE(FF2b_17) AND (! FIREABLE(FF2b_16) AND (! FIREABLE(FF2b_27) AND (! FIREABLE(FF2b_26) AND (! FIREABLE(FF2b_29) AND (! FIREABLE(FF2b_28) AND (! FIREABLE(FF2b_23) AND (! FIREABLE(FF2b_22) AND (! FIREABLE(FF2b_25) AND (! FIREABLE(FF2b_24)... (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 1200 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 6427752177035959605590171742520062169515543273657359213530579992576 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1b_8) AND (! FIREABLE(FF1b_9) AND (! FIREABLE(FF1b_6) AND (! FIREABLE(FF1b_7) AND (! FIREABLE(FF1b_12) AND (! FIREABLE(FF1b_13) AND (! FIREABLE(FF1b_10) AND (! FIREABLE(FF1b_11) AND (! FIREABLE(FF1b_16) AND (! FIREABLE(FF1b_17) AND (! FIREABLE(FF1b_14) AND (! FIREABLE(FF1b_15) AND (! FIREABLE(FF1b_20) AND (! FIREABLE(FF1b_21) AND (! FIREABLE(FF1b_18) AND (! FIREABLE(FF1b_19) AND ... (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 1200 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 5070602400912917043036859400192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_3) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_5) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_48) OR (FIREABLE(FF1a_49) OR (FIREABLE(FF1a_46) OR (FIREABLE(FF1a_47) OR (FIREABLE(FF1a_44) OR (FIREABLE(FF1a_45) OR (FIREABLE(FF1a_42) OR (FIREABLE(FF1a_43) OR (FIREABLE(FF1a_56) OR (FIREABLE... (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 1200 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 5070602400912917043036859400192 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 12 will run for 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_3) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_5) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_48) OR (FIREABLE(FF1a_49) OR (FIREABLE(FF1a_46) OR (FIREABLE(FF1a_47) OR (FIREABLE(FF1a_44) OR (FIREABLE(FF1a_45) OR (FIREABLE(FF1a_42) OR (FIREABLE(FF1a_43) OR (FIREABLE(FF1a_56) OR (FIREABLE... (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 1200 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 5070602400912917043036859400192 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 13 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(End_54) AND (! FIREABLE(End_55) AND (! FIREABLE(End_56) AND (! FIREABLE(End_57) AND (! FIREABLE(End_50) AND (! FIREABLE(End_51) AND (! FIREABLE(End_52) AND (! FIREABLE(End_53) AND (! FIREABLE(End_46) AND (! FIREABLE(End_47) AND (! FIREABLE(End_48) AND (! FIREABLE(End_49) AND (! FIREABLE(End_42) AND (! FIREABLE(End_43) AND (! FIREABLE(End_44) AND (! FIREABLE(End_45) AND (! FIREAB... (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 1200 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 14 will run for 1525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF2a_1) OR (FIREABLE(FF2a_45) OR (FIREABLE(FF2a_44) OR (FIREABLE(FF2a_43) OR (FIREABLE(FF2a_42) OR (FIREABLE(FF2a_49) OR (FIREABLE(FF2a_48) OR (FIREABLE(FF2a_47) OR (FIREABLE(FF2a_46) OR (FIREABLE(FF2a_37) OR (FIREABLE(FF2a_36) OR (FIREABLE(FF2a_35) OR (FIREABLE(FF2a_34) OR (FIREABLE(FF2a_41) OR (FIREABLE(FF2a_40) OR (FIREABLE(FF2a_39) OR (FIREABLE(FF2a_38) OR (FIREABLE(FF2a_60) 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 1200 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 1629628781067588637430578076095111681699204697556933293968943028202376960895501349120458620928 literals
lola: DNF formula is too big, sara cannot be used
Killed

BK_STOP 1464489028006

--------------------
content from stderr:

parsing of model.pnml complete
make: [verify] Error 137 (ignored)

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="S_Philosophers-PT-000100"
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/S_Philosophers-PT-000100.tgz
mv S_Philosophers-PT-000100 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 S_Philosophers-PT-000100, 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 r170kn-ebro-146433134200900"
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 ;