About the Execution of LoLa for PhaseVariation-PT-D20CS010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
325.470 | 128732.00 | 256307.00 | 85.20 | FTTTFTTFFTTTFFTF | normal |
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-D20CS010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088200171
=====================================================================
--------------------
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-D20CS010-ReachabilityFireability-0
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-1
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-10
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-11
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-12
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-13
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-14
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-15
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-2
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-3
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-4
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-5
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-6
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-7
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-8
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1463700612485
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PhaseVariation-PT-D20CS010
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-D20CS010-ReachabilityFireability.task
lola: read: AG (!((FIREABLE(division2_replicate_18_6_A_19_7) AND (!(FIREABLE(division2_replicate_5_13_B_5_12)) OR (FIREABLE(division2_replicate_9_7_B_8_8) AND FIREABLE(division2_replicate_5_7_A_5_8)))))) : EF ((FIREABLE(division2_mutate_8_15_A_8_16) AND FIREABLE(division2_replicate_16_1_A_16_2))) : AG (((FIREABLE(division2_mutate_19_10_B_18_9) OR !((FIREABLE(division2_mutate_16_19_B_17_18) AND FIREABLE(divisi... (shortened)
lola: formula length: 2544
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_18_6_A_19_7) OR (FIREABLE(division2_replicate_5_13_B_5_12) AND (! FIREABLE(division2_replicate_9_7_B_8_8) OR ! FIREABLE(division2_replicate_5_7_A_5_8)))))
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 21 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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: EF ((FIREABLE(division2_mutate_8_15_A_8_16) AND FIREABLE(division2_replicate_16_1_A_16_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 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-D20CS010-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability.sara.
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: AG (((FIREABLE(division2_mutate_19_10_B_18_9) OR (! FIREABLE(division2_mutate_16_19_B_17_18) OR ! FIREABLE(division2_replicate_12_2_B_13_1))) AND ((! FIREABLE(division2_mutate_2_6_A_1_6) AND ! FIREABLE(division2_mutate_19_14_B_19_13)) OR (! FIREABLE(division2_mutate_6_4_A_5_3) OR ! FIREABLE(division2_mutate_9_3_A_10_4)))))
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 39 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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(division2_mutate_4_14_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 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-3.sara.
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(division2_mutate_9_4_B_8_3) OR (FIREABLE(division2_replicate_20_15_A_20_16) OR FIREABLE(division1_mutate_16_8_A))))
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-D20CS010-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-4.sara.
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(division2_replicate_18_16_B_17_16))
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-D20CS010-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-5.sara.
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(division1_mutate_10_8_A) AND (FIREABLE(division2_replicate_5_6_B_5_7) AND ((FIREABLE(division2_replicate_14_6_A_15_6) OR FIREABLE(division1_mutate_10_8_A)) AND FIREABLE(division2_replicate_15_18_B_16_18)))))
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 24 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-6.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 7 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division1_replicate_19_7_A))
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-D20CS010-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-7.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 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division1_replicate_12_10_B) OR (FIREABLE(division2_replicate_4_7_A_4_6) OR (FIREABLE(division2_mutate_15_5_B_16_5) AND (FIREABLE(division2_mutate_6_10_A_7_10) AND ! FIREABLE(division2_replicate_15_10_A_16_9))))))
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 27 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division2_replicate_2_5_B_2_6) OR (FIREABLE(division2_mutate_10_14_B_9_15) OR (FIREABLE(division2_replicate_7_11_B_7_12) OR ! FIREABLE(division2_replicate_13_18_A_12_18)))))
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 60 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_replicate_16_9_A_16_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-D20CS010-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(division2_mutate_12_5_A_13_4) AND FIREABLE(division2_replicate_20_19_B_20_20)) OR (FIREABLE(division2_replicate_1_1_B_2_1) AND FIREABLE(division2_replicate_4_3_A_3_4))))
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-D20CS010-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(division1_replicate_5_3_B) AND (! FIREABLE(division1_mutate_9_15_B) AND (! FIREABLE(division2_mutate_11_18_A_11_19) AND ! FIREABLE(division2_replicate_13_20_A_12_20)))) OR (! FIREABLE(division1_replicate_14_10_A) AND (! FIREABLE(division1_mutate_20_2_B) AND FIREABLE(division2_mutate_17_19_B_16_18)))))
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 96 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_mutate_18_4_B_17_4))
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-D20CS010-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(division2_mutate_15_5_A_15_4) OR ! FIREABLE(division2_replicate_3_5_A_2_6)) AND (FIREABLE(division2_replicate_7_14_A_7_15) OR FIREABLE(division2_mutate_4_10_B_3_9))))
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 36 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(division2_replicate_12_4_A_11_5) AND ! FIREABLE(division2_replicate_17_11_B_17_10)) OR (FIREABLE(division2_mutate_7_17_B_8_17) OR ! FIREABLE(division2_mutate_20_19_B_19_19))))
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 42 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes no yes yes yes no no yes no yes yes no yes yes no
BK_STOP 1463700741217
--------------------
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-D20CS010"
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-D20CS010.tgz
mv PhaseVariation-PT-D20CS010 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-D20CS010, 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-146369088200171"
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 '
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 ;