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 |
| 314.730 | 215592.00 | 428945.00 | 442.50 | FTTFTTTFTTTTFTTT | 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-3254
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 r048-smll-149440869600126
=====================================================================
--------------------
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 1494531622157
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ PhaseVariation-PT-D20CS010 @ 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-D20CS010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(division2_replicate_16_8_B_15_9) OR NOT FIREABLE(division2_mutate_16_10_A_17_10) OR (FIREABLE(division2_mutate_12_12_A_11_11) AND FIREABLE(division2_replicate_17_18_A_18_17)) OR NOT FIREABLE(division2_mutate_8_12_A_7_12) OR (FIREABLE(division2_replicate_16_11_B_17_11) AND (NOT FIREABLE(division1_mutate_2_19_B) OR (FIREABLE(division1_mutate_1_9_A) AND FIREABLE(division2_mutate_5_8_B_5_9))))))) : E (F (FIREABLE(division2_mutate_6_19_A_5_20))) : E (F (FIREABLE(division2_mutate_6_8_B_5_9))) : E (F (FIREABLE(division2_replicate_1_16_A_1_17))) : E (F (FIREABLE(division2_mutate_6_3_B_6_4))) : E (F ((FIREABLE(division2_mutate_20_20_B_19_19) OR FIREABLE(division1_replicate_8_11_A) OR (FIREABLE(division2_mutate_5_2_B_5_1) AND FIREABLE(division2_mutate_13_13_A_13_12))))) : A (G (NOT FIREABLE(division2_replicate_17_16_B_18_16))) : E (F ((((NOT FIREABLE(division2_mutate_19_7_B_18_7) AND FIREABLE(division2_replicate_8_6_B_9_7)) OR (NOT FIREABLE(division2_replicate_14_7_A_15_6) AND NOT FIREABLE(division2_mutate_12_13_B_13_13))) AND (FIREABLE(division2_mutate_20_15_A_19_15) OR FIREABLE(division2_replicate_6_18_B_7_17) OR (FIREABLE(division2_mutate_11_9_A_12_10) AND FIREABLE(division2_replicate_13_13_B_14_13)) OR FIREABLE(division2_replicate_13_2_A_14_1))))) : E (F (((FIREABLE(division2_mutate_9_20_B_8_20) OR FIREABLE(division2_mutate_6_5_A_7_6)) AND (NOT FIREABLE(division2_replicate_11_7_A_10_7) OR NOT FIREABLE(division2_replicate_10_2_B_11_3) OR NOT FIREABLE(division2_mutate_12_9_B_11_9) OR NOT FIREABLE(division2_mutate_10_19_B_11_20))))) : E (F (FIREABLE(division2_replicate_9_17_B_9_16))) : A (G ((NOT FIREABLE(division2_mutate_7_13_B_8_13) OR NOT FIREABLE(division1_mutate_17_17_A) OR FIREABLE(division2_mutate_18_18_B_19_18) OR FIREABLE(division2_replicate_5_8_A_4_8)))) : E (F (FIREABLE(division1_replicate_16_15_B))) : E (F (FIREABLE(division2_replicate_1_8_B_2_7))) : E (F (((FIREABLE(division1_mutate_9_18_B) AND (NOT FIREABLE(division2_replicate_19_14_B_19_13) OR NOT FIREABLE(division2_replicate_12_14_A_12_15))) OR FIREABLE(division2_replicate_18_8_A_17_7)))) : A (G ((NOT FIREABLE(division2_replicate_7_12_A_6_12) OR NOT FIREABLE(division2_mutate_15_5_B_14_6) OR NOT FIREABLE(division2_replicate_3_8_B_2_7) OR NOT FIREABLE(division2_mutate_16_4_B_15_5)))) : E (F (FIREABLE(division1_replicate_15_4_B)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_16_8_B_15_9) OR NOT FIREABLE(division2_mutate_16_10_A_17_10) OR (FIREABLE(division2_mutate_12_12_A_11_11) AND FIREABLE(division2_replicate_17_18_A_18_17)) OR NOT FIREABLE(division2_mutate_8_12_A_7_12) OR (FIREABLE(division2_replicate_16_11_B_17_11) AND (NOT FIREABLE(division1_mutate_2_19_B) OR (FIREABLE(division1_mutate_1_9_A) AND FIREABLE(division2_mut... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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 312 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_6_19_A_5_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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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_mutate_6_8_B_5_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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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: E (F (FIREABLE(division2_replicate_1_16_A_1_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-D20CS010-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_6_3_B_6_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 (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-D20CS010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_20_20_B_19_19) OR FIREABLE(division1_replicate_8_11_A) OR (FIREABLE(division2_mutate_5_2_B_5_1) AND FIREABLE(division2_mutate_13_13_A_13_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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_replicate_17_16_B_18_16)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(division2_mutate_19_7_B_18_7) AND FIREABLE(division2_replicate_8_6_B_9_7)) OR (NOT FIREABLE(division2_replicate_14_7_A_15_6) AND NOT FIREABLE(division2_mutate_12_13_B_13_13))) AND (FIREABLE(division2_mutate_20_15_A_19_15) OR FIREABLE(division2_replicate_6_18_B_7_17) OR (FIREABLE(division2_mutate_11_9_A_12_10) AND FIREABLE(division2_replicate_13_13_B_14_13)) OR FIREABLE(di... (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 154 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_mutate_9_20_B_8_20) OR FIREABLE(division2_mutate_6_5_A_7_6)) AND (NOT FIREABLE(division2_replicate_11_7_A_10_7) OR NOT FIREABLE(division2_replicate_10_2_B_11_3) OR NOT FIREABLE(division2_mutate_12_9_B_11_9) OR NOT FIREABLE(division2_mutate_10_19_B_11_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 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_9_17_B_9_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 (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-D20CS010-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_7_13_B_8_13) OR NOT FIREABLE(division1_mutate_17_17_A) OR FIREABLE(division2_mutate_18_18_B_19_18) OR FIREABLE(division2_replicate_5_8_A_4_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 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 1806 markings, 7705 edges, 361 markings/sec, 0 secs
lola: sara is running 5 secs || 7681 markings, 70796 edges, 1175 markings/sec, 5 secs
lola: sara is running 10 secs || 13541 markings, 135681 edges, 1172 markings/sec, 10 secs
lola: sara is running 15 secs || 19281 markings, 205185 edges, 1148 markings/sec, 15 secs
lola: sara is running 20 secs || 24735 markings, 286128 edges, 1091 markings/sec, 20 secs
lola: sara is running 25 secs || 30396 markings, 359033 edges, 1132 markings/sec, 25 secs
lola: sara is running 30 secs || 36188 markings, 428006 edges, 1158 markings/sec, 30 secs
lola: sara is running 35 secs || 41729 markings, 506517 edges, 1108 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 47292 markings, 581869 edges, 1113 markings/sec, 40 secs
lola: sara is running 45 secs || 53123 markings, 648912 edges, 1166 markings/sec, 45 secs
lola: sara is running 50 secs || 58639 markings, 727673 edges, 1103 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_replicate_16_15_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-D20CS010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 2573 markings, 16393 edges, 515 markings/sec, 0 secs
lola: sara is running 5 secs || 8811 markings, 83775 edges, 1248 markings/sec, 5 secs
lola: sara is running 10 secs || 15098 markings, 149135 edges, 1257 markings/sec, 10 secs
lola: sara is running 15 secs || 21070 markings, 225890 edges, 1194 markings/sec, 15 secs
lola: sara is running 20 secs || 26762 markings, 312266 edges, 1138 markings/sec, 20 secs
lola: sara is running 25 secs || 33031 markings, 378623 edges, 1254 markings/sec, 25 secs
lola: sara is running 30 secs || 39054 markings, 453716 edges, 1205 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 44832 markings, 536951 edges, 1156 markings/sec, 35 secs
lola: sara is running 40 secs || 51146 markings, 601293 edges, 1263 markings/sec, 40 secs
lola: sara is running 45 secs || 57062 markings, 679586 edges, 1183 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 12 will run for 857 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_1_8_B_2_7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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-D20CS010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 1143 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division1_mutate_9_18_B) AND (NOT FIREABLE(division2_replicate_19_14_B_19_13) OR NOT FIREABLE(division2_replicate_12_14_A_12_15))) OR FIREABLE(division2_replicate_18_8_A_17_7))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 1715 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_7_12_A_6_12) OR NOT FIREABLE(division2_mutate_15_5_B_14_6) OR NOT FIREABLE(division2_replicate_3_8_B_2_7) OR NOT FIREABLE(division2_mutate_16_4_B_15_5))))
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 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 2631 markings, 12140 edges, 526 markings/sec, 0 secs
lola: sara is running 5 secs || 9071 markings, 66301 edges, 1288 markings/sec, 5 secs
lola: sara is running 10 secs || 15420 markings, 120884 edges, 1270 markings/sec, 10 secs
lola: sara is running 15 secs || 21692 markings, 178829 edges, 1254 markings/sec, 15 secs
lola: sara is running 20 secs || 28040 markings, 234493 edges, 1270 markings/sec, 20 secs
lola: sara is running 25 secs || 34439 markings, 288986 edges, 1280 markings/sec, 25 secs
lola: sara is running 30 secs || 40760 markings, 345626 edges, 1264 markings/sec, 30 secs
lola: sara is running 35 secs || 46961 markings, 406401 edges, 1240 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 53120 markings, 468319 edges, 1232 markings/sec, 40 secs
lola: sara is running 45 secs || 59260 markings, 531374 edges, 1228 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_replicate_15_4_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-D20CS010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 2719 markings, 19771 edges, 544 markings/sec, 0 secs
lola: sara is running 5 secs || 8929 markings, 89905 edges, 1242 markings/sec, 5 secs
lola: sara is running 10 secs || 15204 markings, 157207 edges, 1255 markings/sec, 10 secs
lola: sara is running 15 secs || 21146 markings, 236379 edges, 1188 markings/sec, 15 secs
lola: sara is running 20 secs || 26816 markings, 324859 edges, 1134 markings/sec, 20 secs
lola: sara is running 25 secs || 33094 markings, 392490 edges, 1256 markings/sec, 25 secs
lola: sara is running 30 secs || 39039 markings, 471609 edges, 1189 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 44695 markings, 560872 edges, 1131 markings/sec, 35 secs
lola: sara is running 40 secs || 50995 markings, 626843 edges, 1260 markings/sec, 40 secs
lola: sara is running 45 secs || 56891 markings, 707056 edges, 1179 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: RESULT
lola:
SUMMARY: no yes yes yes yes yes no yes yes yes yes no yes yes yes no
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494531837749
--------------------
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-D20CS010"
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-D20CS010.tgz
mv PhaseVariation-PT-D20CS010 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-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 r048-smll-149440869600126"
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 ;