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

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

=== Now, execution of the tool begins

BK_START 1463701218993

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PhaseVariation-PT-D20CS100
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D20CS100-ReachabilityFireability.task
lola: read: AG (!((FIREABLE(division2_replicate_1_9_A_1_10) OR FIREABLE(division2_replicate_19_1_B_20_2)))) : AG ((!(((FIREABLE(division1_mutate_4_2_A) OR FIREABLE(division2_mutate_18_8_B_18_9)) AND FIREABLE(division1_replicate_17_18_B))) AND (FIREABLE(division2_mutate_2_11_A_1_10) OR ((FIREABLE(division1_replicate_11_11_B) OR FIREABLE(division2_mutate_3_11_A_4_12)) OR !(FIREABLE(division1_replicate_12_19_A))... (shortened)
lola: formula length: 3138
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division2_replicate_1_9_A_1_10) AND ! FIREABLE(division2_replicate_19_1_B_20_2)))
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 3204 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 6 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(division1_mutate_4_2_A) AND ! FIREABLE(division2_mutate_18_8_B_18_9)) OR ! FIREABLE(division1_replicate_17_18_B)) AND (FIREABLE(division2_mutate_2_11_A_1_10) OR (FIREABLE(division1_replicate_11_11_B) OR (FIREABLE(division2_mutate_3_11_A_4_12) OR ! FIREABLE(division1_replicate_12_19_A))))))
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 3204 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 162 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_mutate_20_9_A_20_8) AND ((! FIREABLE(division1_mutate_3_14_B) OR ! FIREABLE(division1_mutate_12_20_A)) AND (! FIREABLE(division2_replicate_2_20_B_3_19) OR ! FIREABLE(division2_replicate_2_9_A_1_8)))))
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 3204 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 105 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_mutate_6_14_A_7_15))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_mutate_12_18_A_13_18) OR (((FIREABLE(division2_replicate_16_6_A_15_7) OR FIREABLE(division2_mutate_9_15_B_10_14)) AND (FIREABLE(division2_replicate_17_16_B_16_15) OR FIREABLE(division2_mutate_14_13_A_13_13))) OR FIREABLE(division2_mutate_2_15_B_3_14))))
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 3204 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 30 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(division2_mutate_5_5_B_5_4) AND FIREABLE(division1_mutate_5_2_B)) OR FIREABLE(division2_mutate_12_20_A_12_19)) AND ((FIREABLE(division2_replicate_4_1_B_3_1) AND FIREABLE(division1_replicate_2_9_B)) OR FIREABLE(division2_replicate_20_4_B_20_3))) OR (((FIREABLE(division2_replicate_8_12_B_8_11) OR FIREABLE(division2_mutate_3_8_B_4_9)) AND (FIREABLE(division2_replicate_12_16_A_13_15) ... (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 3204 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 63 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_mutate_2_12_B_1_12))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(division2_mutate_6_13_B_7_14))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_replicate_3_18_B_3_19))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_replicate_5_13_A_6_13) AND (FIREABLE(division2_mutate_4_10_B_5_9) AND FIREABLE(division2_replicate_10_17_B_9_17))))
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 3204 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 9 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_mutate_6_7_A_5_7))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_mutate_18_11_A_19_10) AND ((! FIREABLE(division2_mutate_1_11_A_2_12) AND ! FIREABLE(division2_replicate_17_3_B_16_2)) OR FIREABLE(division1_mutate_11_18_B))))
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 3204 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 39 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(division2_mutate_13_10_A_14_9) OR ((FIREABLE(division2_replicate_4_11_B_4_10) AND FIREABLE(division2_mutate_2_7_B_3_6)) OR ! FIREABLE(division2_replicate_19_19_B_20_19))) AND (FIREABLE(division2_replicate_20_4_B_19_3) OR (FIREABLE(division2_mutate_9_12_A_8_13) OR (! FIREABLE(division2_mutate_17_2_B_16_1) OR ((FIREABLE(division2_replicate_2_1_A_3_1) OR FIREABLE(division2_mutate_3_1_B... (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 3204 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 741 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(division2_mutate_19_6_B_18_6) OR (FIREABLE(division2_replicate_15_8_B_15_9) OR (FIREABLE(division2_mutate_2_19_A_1_18) OR FIREABLE(division2_mutate_7_10_A_6_11)))) AND FIREABLE(division2_mutate_16_9_A_17_9)) OR ((FIREABLE(division2_mutate_16_12_B_16_11) OR FIREABLE(division2_mutate_6_15_A_7_14)) AND (FIREABLE(division2_mutate_12_16_B_13_16) AND FIREABLE(division2_replicate_6_8_B_7_... (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 3204 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 42 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(division2_replicate_14_8_A_15_8) AND FIREABLE(division1_replicate_5_1_B)))
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 3204 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 12 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-14.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: subprocess 15 will run for 3384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_replicate_2_11_A_3_10))
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 3204 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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: no yes yes yes yes yes yes no yes yes yes yes no yes no yes
lola: ========================================

BK_STOP 1463701375859

--------------------
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="PhaseVariation-PT-D20CS100"
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/PhaseVariation-PT-D20CS100.tgz
mv PhaseVariation-PT-D20CS100 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 PhaseVariation-PT-D20CS100, 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-146369088200180"
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 ;