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

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

=== Now, execution of the tool begins

BK_START 1463696374768

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PhaseVariation-PT-D02CS100
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D02CS100-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: 79/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 65 transitions, 9 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-D02CS100-ReachabilityFireability.task
lola: read: AG ((FIREABLE(division2_replicate_2_1_B_1_1) OR !(((FIREABLE(division2_mutate_2_2_B_1_1) OR FIREABLE(stop_constant)) AND FIREABLE(division2_replicate_2_1_B_2_2))))) : AG (((!((FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_mutate_1_2_B_2_2))) OR ((FIREABLE(division1_mutate_1_1_A) OR FIREABLE(division2_mutate_2_2_A_2_1)) OR (FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_mut... (shortened)
lola: formula length: 4175
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_2_1_B_1_1) OR ((! FIREABLE(division2_mutate_2_2_B_1_1) AND ! FIREABLE(stop_constant)) OR ! FIREABLE(division2_replicate_2_1_B_2_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 36 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-D02CS100-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division1_mutate_1_1_A) OR (! FIREABLE(division2_mutate_1_2_B_2_2) OR (FIREABLE(division1_mutate_1_1_A) OR (FIREABLE(division2_mutate_2_2_A_2_1) OR (FIREABLE(division2_replicate_2_2_B_2_1) OR (FIREABLE(division2_mutate_1_2_B_2_2) OR ! FIREABLE(division2_mutate_1_1_A_2_1))))))))
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 36 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 525 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division1_mutate_1_1_A) OR (! FIREABLE(division2_replicate_2_1_A_2_2) OR (FIREABLE(division2_replicate_1_2_A_2_2) OR FIREABLE(division2_mutate_2_1_B_1_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 36 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 48 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-2.sara.
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: EF ((! FIREABLE(division1_replicate_2_1_A) AND (FIREABLE(division1_mutate_1_2_B) AND (FIREABLE(division2_mutate_1_1_B_2_1) AND (! FIREABLE(division2_mutate_2_1_A_2_2) AND (! FIREABLE(division2_mutate_1_1_A_1_2) AND FIREABLE(division2_replicate_2_2_A_1_2)))))))
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 36 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 240 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-3.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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(division2_mutate_1_2_B_2_2) OR ((FIREABLE(division2_replicate_2_1_A_1_1) AND (FIREABLE(division2_mutate_2_1_B_2_2) OR FIREABLE(division1_mutate_1_1_A))) OR (FIREABLE(division1_mutate_2_1_A) AND (FIREABLE(division1_mutate_2_2_B) AND FIREABLE(division1_replicate_2_1_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 36 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 831 literals
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: AG (((! FIREABLE(division2_replicate_1_1_B_2_1) AND ! FIREABLE(division1_replicate_2_1_A)) OR (FIREABLE(division2_replicate_1_2_A_1_1) OR ! FIREABLE(division1_replicate_1_1_B))))
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 36 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-D02CS100-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(division1_replicate_2_2_A) AND ((FIREABLE(division2_replicate_2_2_A_2_1) AND FIREABLE(division1_replicate_2_1_B)) OR ! FIREABLE(division2_replicate_2_1_A_1_2))) OR (FIREABLE(division2_replicate_2_2_B_1_2) OR (FIREABLE(division2_mutate_2_2_A_1_2) OR (! FIREABLE(division2_mutate_2_2_B_1_2) OR FIREABLE(division2_mutate_2_2_B_1_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 36 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 1539 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-6.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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(division2_replicate_2_1_A_2_2) AND ((FIREABLE(division2_replicate_1_2_A_2_1) OR FIREABLE(division2_mutate_1_1_B_2_2)) AND (! FIREABLE(division2_replicate_1_1_B_2_2) AND ! FIREABLE(division2_mutate_2_2_A_1_1)))) OR ((! FIREABLE(division1_replicate_1_1_A) OR ! FIREABLE(division2_mutate_1_2_A_1_1)) AND ((FIREABLE(division2_mutate_1_2_B_2_2) AND FIREABLE(division2_mutate_1_1_B_1_2)) 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 36 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 150 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division2_replicate_1_2_A_2_1) OR (! FIREABLE(division2_mutate_1_1_A_2_1) OR (! FIREABLE(stop_constant) OR (! FIREABLE(division2_replicate_2_1_B_1_1) OR (! FIREABLE(division1_mutate_1_1_A) OR (! FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_replicate_2_2_A_1_1))))))))
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 36 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 54 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-8.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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(division2_replicate_2_1_A_2_2) OR (! FIREABLE(division2_mutate_1_1_A_2_2) OR (! FIREABLE(division1_mutate_1_2_A) OR ((FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_replicate_1_1_A_2_1)) OR (FIREABLE(division2_replicate_1_2_A_2_2) OR (FIREABLE(division2_replicate_2_1_B_1_1) OR (! FIREABLE(division2_mutate_2_2_A_1_2) OR (FIREABLE(division2_mutate_2_2_A_1_2) OR FIREABLE(divisi... (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 36 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 6990 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-9.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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (FIREABLE(division2_mutate_1_2_A_1_1))
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 36 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-D02CS100-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(division2_replicate_2_1_B_1_1) OR (FIREABLE(division2_mutate_1_2_A_2_1) OR (! FIREABLE(division2_mutate_1_1_A_1_2) OR ((FIREABLE(division2_mutate_1_1_B_2_2) AND FIREABLE(division2_mutate_2_2_A_2_1)) OR (FIREABLE(division1_mutate_2_2_B) OR FIREABLE(division2_mutate_2_1_A_1_1)))))))
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 36 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 1638 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(division2_replicate_2_1_A_2_2) AND ! FIREABLE(division2_replicate_2_1_B_1_2)) OR (! FIREABLE(division2_replicate_2_1_A_2_2) OR ! FIREABLE(division1_mutate_2_1_B))) AND (FIREABLE(division2_mutate_1_2_A_2_1) AND ! FIREABLE(division2_mutate_2_2_A_2_1))))
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 36 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 204 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(division2_mutate_1_2_A_2_1) OR ((! FIREABLE(division1_replicate_2_2_B) AND ! FIREABLE(division1_mutate_2_1_A)) OR (FIREABLE(division2_replicate_2_2_A_1_1) OR (! FIREABLE(division2_mutate_2_2_A_1_2) OR ! FIREABLE(division2_replicate_2_1_A_1_1))))))
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 36 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 192 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-13.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 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(division1_replicate_1_2_B) OR ! FIREABLE(division2_replicate_2_1_A_1_1)) AND (! FIREABLE(division2_replicate_2_2_A_1_1) AND ! FIREABLE(division2_mutate_2_2_B_1_1))))
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 36 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 138 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division2_replicate_2_2_B_1_1) OR (FIREABLE(division2_mutate_2_2_A_1_1) OR (FIREABLE(division2_mutate_1_1_A_2_2) AND FIREABLE(division2_mutate_1_2_A_2_1)))))
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 36 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 60 literals
lola: write sara problem file to PhaseVariation-PT-D02CS100-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS100-ReachabilityFireability-15.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: RESULT
lola: summary: no yes no no no no yes yes yes yes no no yes yes yes yes

BK_STOP 1463696379264

--------------------
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-D02CS100"
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-D02CS100.tgz
mv PhaseVariation-PT-D02CS100 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-D02CS100, 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-146369088200126"
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 ;