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-3254
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 r048-smll-149440869600135
=====================================================================

--------------------
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 1494536433773


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ PhaseVariation-PT-D20CS100 @ 3540 seconds
----- Start make result stdout -----
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: E (F (FIREABLE(division2_replicate_6_13_B_6_12))) : E (F ((FIREABLE(division2_mutate_18_13_A_19_13) OR FIREABLE(division1_replicate_17_15_B) OR (FIREABLE(division2_mutate_8_13_B_7_14) AND FIREABLE(division1_mutate_5_3_B) AND FIREABLE(division2_mutate_11_13_A_12_13)) OR FIREABLE(division2_mutate_13_6_B_12_5)))) : E (F (((FIREABLE(division2_replicate_15_17_A_15_18) AND (NOT FIREABLE(division2_mutate_16_7_A_17_7) OR FIREABLE(division2_replicate_12_3_A_11_3))) OR FIREABLE(division2_mutate_6_3_B_7_3)))) : A (G ((NOT FIREABLE(division2_replicate_10_19_A_10_20) OR FIREABLE(division1_replicate_19_9_A) OR NOT FIREABLE(division2_mutate_1_8_B_2_8)))) : E (F (FIREABLE(division1_mutate_4_20_B))) : E (F ((FIREABLE(division2_replicate_16_4_B_16_3) AND FIREABLE(division2_mutate_17_14_A_18_14) AND NOT FIREABLE(division2_replicate_14_18_A_13_19) AND FIREABLE(division2_replicate_19_7_A_19_6) AND (FIREABLE(division1_mutate_16_10_A) OR (FIREABLE(division2_mutate_8_3_A_9_4) AND FIREABLE(division2_mutate_6_16_A_6_15)) OR (FIREABLE(division2_mutate_15_6_A_14_7) AND FIREABLE(division2_mutate_7_14_A_6_13) AND FIREABLE(division2_replicate_10_19_B_11_19)))))) : E (F (((FIREABLE(division2_replicate_17_11_B_18_10) OR FIREABLE(division2_mutate_10_16_B_9_17)) AND NOT FIREABLE(division2_mutate_10_11_B_10_12) AND FIREABLE(division2_mutate_12_3_B_11_2) AND FIREABLE(division2_replicate_12_10_A_13_10)))) : E (F (FIREABLE(division1_replicate_7_11_A))) : E (F (((FIREABLE(division2_replicate_17_19_A_16_18) AND FIREABLE(division1_mutate_14_10_B)) OR FIREABLE(division1_mutate_15_11_B)))) : E (F ((FIREABLE(division2_mutate_12_9_B_12_8) AND FIREABLE(division2_mutate_13_8_B_14_8) AND ((FIREABLE(division2_mutate_12_4_A_12_3) AND FIREABLE(division2_mutate_1_2_B_1_3)) OR (FIREABLE(division2_mutate_3_9_A_2_10) AND FIREABLE(division2_replicate_2_8_A_2_9)) OR NOT FIREABLE(division2_mutate_6_8_A_7_8) OR (FIREABLE(division2_mutate_4_19_B_5_20) AND FIREABLE(division2_mutate_3_3_A_4_3)))))) : E (F (FIREABLE(division2_mutate_10_18_B_9_17))) : E (F ((FIREABLE(division2_mutate_6_14_A_7_14) OR (FIREABLE(division2_mutate_8_8_A_8_7) AND FIREABLE(division2_mutate_3_19_A_4_20))))) : E (F ((NOT FIREABLE(division2_replicate_6_19_B_6_20) AND NOT FIREABLE(division1_mutate_11_12_A) AND NOT FIREABLE(division2_mutate_1_2_B_2_3) AND NOT FIREABLE(division2_replicate_10_11_B_9_10) AND NOT FIREABLE(division2_replicate_4_13_A_4_12) AND FIREABLE(division2_replicate_3_9_A_4_9)))) : E (F (((FIREABLE(division2_mutate_8_14_B_7_13) OR FIREABLE(division2_replicate_1_6_A_2_5)) AND FIREABLE(division2_mutate_10_16_A_9_16) AND FIREABLE(division2_replicate_16_13_A_15_12) AND FIREABLE(division2_replicate_2_19_B_3_18) AND FIREABLE(division2_replicate_19_12_B_19_11) AND FIREABLE(division2_mutate_10_8_B_11_9) AND (FIREABLE(division2_mutate_14_2_A_15_3) OR FIREABLE(division2_mutate_7_14_A_7_15)) AND NOT FIREABLE(division2_mutate_4_15_B_3_14)))) : E (F ((FIREABLE(division2_mutate_8_2_B_9_1) AND (FIREABLE(division2_replicate_4_5_B_3_6) OR FIREABLE(division2_replicate_10_9_A_10_10))))) : E (F ((FIREABLE(division2_mutate_5_2_B_6_1) AND FIREABLE(division2_replicate_20_19_A_19_19))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_6_13_B_6_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_18_13_A_19_13) OR FIREABLE(division1_replicate_17_15_B) OR (FIREABLE(division2_mutate_8_13_B_7_14) AND FIREABLE(division1_mutate_5_3_B) AND FIREABLE(division2_mutate_11_13_A_12_13)) OR FIREABLE(division2_mutate_13_6_B_12_5))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_replicate_15_17_A_15_18) AND (NOT FIREABLE(division2_mutate_16_7_A_17_7) OR FIREABLE(division2_replicate_12_3_A_11_3))) OR FIREABLE(division2_mutate_6_3_B_7_3))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 17 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_10_19_A_10_20) OR FIREABLE(division1_replicate_19_9_A) OR NOT FIREABLE(division2_mutate_1_8_B_2_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_mutate_4_20_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 2638 markings, 14764 edges, 528 markings/sec, 0 secs
lola: sara is running 5 secs || 9011 markings, 76708 edges, 1275 markings/sec, 5 secs
lola: sara is running 10 secs || 15333 markings, 135140 edges, 1264 markings/sec, 10 secs
lola: sara is running 15 secs || 21411 markings, 207191 edges, 1216 markings/sec, 15 secs
lola: sara is running 20 secs || 27193 markings, 289967 edges, 1156 markings/sec, 20 secs
lola: sara is running 25 secs || 33693 markings, 348045 edges, 1300 markings/sec, 25 secs
lola: sara is running 30 secs || 39766 markings, 421057 edges, 1215 markings/sec, 30 secs
lola: sara is running 35 secs || 45642 markings, 500300 edges, 1175 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 52063 markings, 560208 edges, 1284 markings/sec, 40 secs
lola: sara is running 45 secs || 58051 markings, 635546 edges, 1198 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_16_4_B_16_3) AND FIREABLE(division2_mutate_17_14_A_18_14) AND NOT FIREABLE(division2_replicate_14_18_A_13_19) AND FIREABLE(division2_replicate_19_7_A_19_6) AND (FIREABLE(division1_mutate_16_10_A) OR (FIREABLE(division2_mutate_8_3_A_9_4) AND FIREABLE(division2_mutate_6_16_A_6_15)) OR (FIREABLE(division2_mutate_15_6_A_14_7) AND FIREABLE(division2_mutate_7_14_A_6... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 96 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_replicate_17_11_B_18_10) OR FIREABLE(division2_mutate_10_16_B_9_17)) AND NOT FIREABLE(division2_mutate_10_11_B_10_12) AND FIREABLE(division2_mutate_12_3_B_11_2) AND FIREABLE(division2_replicate_12_10_A_13_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_replicate_7_11_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 2637 markings, 17954 edges, 527 markings/sec, 0 secs
lola: sara is running 5 secs || 8828 markings, 86263 edges, 1238 markings/sec, 5 secs
lola: sara is running 10 secs || 15038 markings, 153414 edges, 1242 markings/sec, 10 secs
lola: sara is running 15 secs || 20967 markings, 230367 edges, 1186 markings/sec, 15 secs
lola: sara is running 20 secs || 26621 markings, 317419 edges, 1131 markings/sec, 20 secs
lola: sara is running 25 secs || 32809 markings, 386625 edges, 1238 markings/sec, 25 secs
lola: sara is running 30 secs || 38730 markings, 464594 edges, 1184 markings/sec, 30 secs
lola: sara is running 35 secs || 44373 markings, 552098 edges, 1129 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 50562 markings, 619770 edges, 1238 markings/sec, 40 secs
lola: sara is running 45 secs || 56446 markings, 698434 edges, 1177 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_replicate_17_19_A_16_18) AND FIREABLE(division1_mutate_14_10_B)) OR FIREABLE(division1_mutate_15_11_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 2029 markings, 9712 edges, 406 markings/sec, 0 secs
lola: sara is running 5 secs || 8504 markings, 64894 edges, 1295 markings/sec, 5 secs
lola: sara is running 10 secs || 14775 markings, 130987 edges, 1254 markings/sec, 10 secs
lola: sara is running 15 secs || 21225 markings, 191010 edges, 1290 markings/sec, 15 secs
lola: sara is running 20 secs || 27592 markings, 253447 edges, 1273 markings/sec, 20 secs
lola: sara is running 25 secs || 33884 markings, 318506 edges, 1258 markings/sec, 25 secs
lola: sara is running 30 secs || 39882 markings, 393331 edges, 1200 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 46335 markings, 453690 edges, 1291 markings/sec, 35 secs

lola: sara is running 40 secs || 52517 markings, 512558 edges, 1236 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_12_9_B_12_8) AND FIREABLE(division2_mutate_13_8_B_14_8) AND ((FIREABLE(division2_mutate_12_4_A_12_3) AND FIREABLE(division2_mutate_1_2_B_1_3)) OR (FIREABLE(division2_mutate_3_9_A_2_10) AND FIREABLE(division2_replicate_2_8_A_2_9)) OR NOT FIREABLE(division2_mutate_6_8_A_7_8) OR (FIREABLE(division2_mutate_4_19_B_5_20) AND FIREABLE(division2_mutate_3_3_A_4_3))))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 50 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_10_18_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_6_14_A_7_14) OR (FIREABLE(division2_mutate_8_8_A_8_7) AND FIREABLE(division2_mutate_3_19_A_4_20)))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division2_replicate_6_19_B_6_20) AND NOT FIREABLE(division1_mutate_11_12_A) AND NOT FIREABLE(division2_mutate_1_2_B_2_3) AND NOT FIREABLE(division2_replicate_10_11_B_9_10) AND NOT FIREABLE(division2_replicate_4_13_A_4_12) AND FIREABLE(division2_replicate_3_9_A_4_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 256 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1128 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_mutate_8_14_B_7_13) OR FIREABLE(division2_replicate_1_6_A_2_5)) AND FIREABLE(division2_mutate_10_16_A_9_16) AND FIREABLE(division2_replicate_16_13_A_15_12) AND FIREABLE(division2_replicate_2_19_B_3_18) AND FIREABLE(division2_replicate_19_12_B_19_11) AND FIREABLE(division2_mutate_10_8_B_11_9) AND (FIREABLE(division2_mutate_14_2_A_15_3) OR FIREABLE(division2_mutate_7_14_... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 176 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1692 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_8_2_B_9_1) AND (FIREABLE(division2_replicate_4_5_B_3_6) OR FIREABLE(division2_replicate_10_9_A_10_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_5_2_B_6_1) AND FIREABLE(division2_replicate_20_19_A_19_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes no no yes yes yes yes yes yes yes
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494536590615

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="/tmp/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-3254"
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 r048-smll-149440869600135"
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 ;