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 AirplaneLD-PT-0200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r206su-blw3-146445817100126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464481620408

bkconf 3600
===========================================================================================
===========================================================================================
AirplaneLD-PT-0200: translating Petri net model.pnml into LoLA format
AirplaneLD-PT-0200: 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 3538
ReachabilityFireability @ AirplaneLD-PT-0200
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-0200-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3027/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 1419 places, 1608 transitions, 814 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1215 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0200-ReachabilityFireability.task
lola: read: EF ((((FIREABLE(SampleLW_on) OR FIREABLE(SampleLW_off)) AND ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(t3_1_1) OR FIREABLE(t3_1_2)) OR FIREABLE(t3_1_3)) OR FIREABLE(t3_1_4)) OR FIREABLE(t3_1_5)) OR FIREABLE(t3_1_6)) OR FIREABLE(t3_1_7))... (shortened)
lola: formula length: 143518
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SampleLW_on) OR FIREABLE(SampleLW_off)) AND ((FIREABLE(t3_1_1) OR (FIREABLE(t3_1_2) OR (FIREABLE(t3_1_3) OR (FIREABLE(t3_1_4) OR (FIREABLE(t3_1_5) OR (FIREABLE(t3_1_6) OR (FIREABLE(t3_1_7) OR (FIREABLE(t3_1_8) OR (FIREABLE(t3_1_9) OR (FIREABLE(t3_1_10) OR (FIREABLE(t3_1_11) OR (FIREABLE(t3_1_12) OR (FIREABLE(t3_1_13) OR (FIREABLE(t3_1_14) OR (FIREABLE(t3_1_15) OR (FIREABLE(t3_1_16) ... (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 3256 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 3184 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t4_1_101) OR (FIREABLE(t4_1_102) OR (FIREABLE(t4_1_103) OR (FIREABLE(t4_1_104) OR (FIREABLE(t4_1_105) OR (FIREABLE(t4_1_106) OR (FIREABLE(t4_1_107) OR (FIREABLE(t4_1_108) OR (FIREABLE(t4_1_109) OR (FIREABLE(t4_1_110) OR (FIREABLE(t4_1_111) OR (FIREABLE(t4_1_112) OR (FIREABLE(t4_1_113) OR (FIREABLE(t4_1_114) OR (FIREABLE(t4_1_115) OR (FIREABLE(t4_1_116) OR (FIREABLE(t4_1_117) OR (FIRE... (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 3256 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 198 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SpeedLW_1) OR (FIREABLE(SpeedLW_2) OR (FIREABLE(SpeedLW_3) OR (FIREABLE(SpeedLW_4) OR (FIREABLE(SpeedLW_5) OR (FIREABLE(SpeedLW_6) OR (FIREABLE(SpeedLW_7) OR (FIREABLE(SpeedLW_8) OR (FIREABLE(SpeedLW_9) OR (FIREABLE(SpeedLW_10) OR (FIREABLE(SpeedLW_11) OR (FIREABLE(SpeedLW_12) OR (FIREABLE(SpeedLW_13) OR (FIREABLE(SpeedLW_14) OR (FIREABLE(SpeedLW_15) OR (FIREABLE(SpeedLW_16) OR (FIR... (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 3256 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 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t3_2_200) OR (FIREABLE(t3_2_201) OR (FIREABLE(t3_2_202) OR (FIREABLE(t3_2_203) OR (FIREABLE(t3_2_204) OR (FIREABLE(t3_2_205) OR (FIREABLE(t3_2_206) OR (FIREABLE(t3_2_207) OR (FIREABLE(t3_2_208) OR (FIREABLE(t3_2_209) OR (FIREABLE(t3_2_210) OR (FIREABLE(t3_2_211) OR (FIREABLE(t3_2_212) OR (FIREABLE(t3_2_213) OR (FIREABLE(t3_2_214) OR (FIREABLE(t3_2_215) OR (FIREABLE(t3_2_216) OR (FIRE... (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 3256 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t3_1_1) OR (FIREABLE(t3_1_2) OR (FIREABLE(t3_1_3) OR (FIREABLE(t3_1_4) OR (FIREABLE(t3_1_5) OR (FIREABLE(t3_1_6) OR (FIREABLE(t3_1_7) OR (FIREABLE(t3_1_8) OR (FIREABLE(t3_1_9) OR (FIREABLE(t3_1_10) OR (FIREABLE(t3_1_11) OR (FIREABLE(t3_1_12) OR (FIREABLE(t3_1_13) OR (FIREABLE(t3_1_14) OR (FIREABLE(t3_1_15) OR (FIREABLE(t3_1_16) OR (FIREABLE(t3_1_17) OR (FIREABLE(t3_1_18) OR (FIREABL... (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 3256 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t2_1_on))
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 3256 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 2 literals
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(t3_1_1) OR (FIREABLE(t3_1_2) OR (FIREABLE(t3_1_3) OR (FIREABLE(t3_1_4) OR (FIREABLE(t3_1_5) OR (FIREABLE(t3_1_6) OR (FIREABLE(t3_1_7) OR (FIREABLE(t3_1_8) OR (FIREABLE(t3_1_9) OR (FIREABLE(t3_1_10) OR (FIREABLE(t3_1_11) OR (FIREABLE(t3_1_12) OR (FIREABLE(t3_1_13) OR (FIREABLE(t3_1_14) OR (FIREABLE(t3_1_15) OR (FIREABLE(t3_1_16) OR (FIREABLE(t3_1_17) OR (FIREABLE(t3_1_18) OR (FIREAB... (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 3256 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 7192 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t5_1_101) OR (FIREABLE(t5_1_102) OR (FIREABLE(t5_1_103) OR (FIREABLE(t5_1_104) OR (FIREABLE(t5_1_105) OR (FIREABLE(t5_1_106) OR (FIREABLE(t5_1_107) OR (FIREABLE(t5_1_108) OR (FIREABLE(t5_1_109) OR (FIREABLE(t5_1_110) OR (FIREABLE(t5_1_111) OR (FIREABLE(t5_1_112) OR (FIREABLE(t5_1_113) OR (FIREABLE(t5_1_114) OR (FIREABLE(t5_1_115) OR (FIREABLE(t5_1_116) OR (FIREABLE(t5_1_117) OR (FIRE... (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 3256 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 1584 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t1_2_off) OR ((FIREABLE(SpeedLW_1) OR (FIREABLE(SpeedLW_2) OR (FIREABLE(SpeedLW_3) OR (FIREABLE(SpeedLW_4) OR (FIREABLE(SpeedLW_5) OR (FIREABLE(SpeedLW_6) OR (FIREABLE(SpeedLW_7) OR (FIREABLE(SpeedLW_8) OR (FIREABLE(SpeedLW_9) OR (FIREABLE(SpeedLW_10) OR (FIREABLE(SpeedLW_11) OR (FIREABLE(SpeedLW_12) OR (FIREABLE(SpeedLW_13) OR (FIREABLE(SpeedLW_14) OR (FIREABLE(SpeedLW_15) 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 3256 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 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t2_1_on))
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 3256 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 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t5_1_101) OR (FIREABLE(t5_1_102) OR (FIREABLE(t5_1_103) OR (FIREABLE(t5_1_104) OR (FIREABLE(t5_1_105) OR (FIREABLE(t5_1_106) OR (FIREABLE(t5_1_107) OR (FIREABLE(t5_1_108) OR (FIREABLE(t5_1_109) OR (FIREABLE(t5_1_110) OR (FIREABLE(t5_1_111) OR (FIREABLE(t5_1_112) OR (FIREABLE(t5_1_113) OR (FIREABLE(t5_1_114) OR (FIREABLE(t5_1_115) OR (FIREABLE(t5_1_116) OR (FIREABLE(t5_1_117) OR (FIRE... (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 3256 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 198 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t3_2_200) OR (FIREABLE(t3_2_201) OR (FIREABLE(t3_2_202) OR (FIREABLE(t3_2_203) OR (FIREABLE(t3_2_204) OR (FIREABLE(t3_2_205) OR (FIREABLE(t3_2_206) OR (FIREABLE(t3_2_207) OR (FIREABLE(t3_2_208) OR (FIREABLE(t3_2_209) OR (FIREABLE(t3_2_210) OR (FIREABLE(t3_2_211) OR (FIREABLE(t3_2_212) OR (FIREABLE(t3_2_213) OR (FIREABLE(t3_2_214) OR (FIREABLE(t3_2_215) OR (FIREABLE(t3_2_216) OR (FIRE... (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 3256 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 21711556974954727421826968398201323839364166306108111295880183869793765205917600764446058130379398886713073869946860924305408 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SpeedRW_1) OR (FIREABLE(SpeedRW_2) OR (FIREABLE(SpeedRW_3) OR (FIREABLE(SpeedRW_4) OR (FIREABLE(SpeedRW_5) OR (FIREABLE(SpeedRW_6) OR (FIREABLE(SpeedRW_7) OR (FIREABLE(SpeedRW_8) OR (FIREABLE(SpeedRW_9) OR (FIREABLE(SpeedRW_10) OR (FIREABLE(SpeedRW_11) OR (FIREABLE(SpeedRW_12) OR (FIREABLE(SpeedRW_13) OR (FIREABLE(SpeedRW_14) OR (FIREABLE(SpeedRW_15) OR (FIREABLE(SpeedRW_16) OR (FIR... (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 3256 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 80117200 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 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t2_2_off) AND ((FIREABLE(SpeedLW_1) OR (FIREABLE(SpeedLW_2) OR (FIREABLE(SpeedLW_3) OR (FIREABLE(SpeedLW_4) OR (FIREABLE(SpeedLW_5) OR (FIREABLE(SpeedLW_6) OR (FIREABLE(SpeedLW_7) OR (FIREABLE(SpeedLW_8) OR (FIREABLE(SpeedLW_9) OR (FIREABLE(SpeedLW_10) OR (FIREABLE(SpeedLW_11) OR (FIREABLE(SpeedLW_12) OR (FIREABLE(SpeedLW_13) OR (FIREABLE(SpeedLW_14) OR (FIREABLE(SpeedLW_15) OR (FIRE... (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 3256 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 205547090295717886159929841710108098964955032479813753610399702247517619395885014577175368287363875963113918332731451961769984 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 1650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(SpeedRW_1) AND (! FIREABLE(SpeedRW_2) AND (! FIREABLE(SpeedRW_3) AND (! FIREABLE(SpeedRW_4) AND (! FIREABLE(SpeedRW_5) AND (! FIREABLE(SpeedRW_6) AND (! FIREABLE(SpeedRW_7) AND (! FIREABLE(SpeedRW_8) AND (! FIREABLE(SpeedRW_9) AND (! FIREABLE(SpeedRW_10) AND (! FIREABLE(SpeedRW_11) AND (! FIREABLE(SpeedRW_12) AND (! FIREABLE(SpeedRW_13) AND (! FIREABLE(SpeedRW_14) AND (! 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 3256 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 15 will run for 3301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(t2_1_on) AND (FIREABLE(t1_1_on) AND (FIREABLE(t4_1_101) OR (FIREABLE(t4_1_102) OR (FIREABLE(t4_1_103) OR (FIREABLE(t4_1_104) OR (FIREABLE(t4_1_105) OR (FIREABLE(t4_1_106) OR (FIREABLE(t4_1_107) OR (FIREABLE(t4_1_108) OR (FIREABLE(t4_1_109) OR (FIREABLE(t4_1_110) OR (FIREABLE(t4_1_111) OR (FIREABLE(t4_1_112) OR (FIREABLE(t4_1_113) OR (FIREABLE(t4_1_114) OR (FIREABLE(t4_1_115) OR (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 3256 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 990 literals
lola: write sara problem file to AirplaneLD-COL-0200-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-0200-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes yes yes yes no yes no no yes yes no no no no

BK_STOP 1464481905407

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

parsing of model.pnml complete

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="AirplaneLD-PT-0200"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/AirplaneLD-PT-0200.tgz
mv AirplaneLD-PT-0200 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 AirplaneLD-PT-0200, 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 r206su-blw3-146445817100126"
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 ;