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-3253
Executing tool lola
Input is DLCshifumi-PT-6b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309400531
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494649296742


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DLCshifumi-PT-6b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 110854/65536 symbol table entries, 76305 collisions
lola: preprocessing...
lola: finding significant places
lola: 44243 places, 66611 transitions, 41828 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 93553 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6b-ReachabilityFireability.task
lola: E (F ((((NOT FIREABLE(t55348) OR NOT FIREABLE(t14612)) AND FIREABLE(t58781)) OR (FIREABLE(t33431) AND FIREABLE(t54503))))) : E (F ((FIREABLE(t21712) AND ((FIREABLE(t14200) AND FIREABLE(t7629) AND NOT FIREABLE(t27207)) OR FIREABLE(t56067))))) : A (G (((NOT FIREABLE(t49211) OR NOT FIREABLE(t53092)) AND (NOT FIREABLE(t15351) OR NOT FIREABLE(t56753)) AND (NOT FIREABLE(t12093) OR (NOT FIREABLE(t18014) AND NOT FIREABLE(t66383)))))) : E (F ((FIREABLE(t9227) OR (FIREABLE(t44347) AND FIREABLE(t39247) AND NOT FIREABLE(t53488)) OR ((FIREABLE(t65322) OR FIREABLE(t19241) OR FIREABLE(t63185) OR FIREABLE(t57725)) AND ((FIREABLE(t38201) AND FIREABLE(t2932)) OR (FIREABLE(t58765) AND FIREABLE(t54304))))))) : A (G ((FIREABLE(t10863) OR FIREABLE(t29978) OR NOT FIREABLE(t23841) OR (NOT FIREABLE(t50230) AND NOT FIREABLE(t64585))))) : A (G ((FIREABLE(t33974) OR FIREABLE(t358) OR (FIREABLE(t20793) AND FIREABLE(t54273)) OR FIREABLE(t4713) OR NOT FIREABLE(t65495)))) : E (F (FIREABLE(t3531))) : E (F ((FIREABLE(t35440) OR FIREABLE(t27009) OR FIREABLE(t36704)))) : E (F (FIREABLE(t56274))) : E (F (((NOT FIREABLE(t65682) AND FIREABLE(t28874)) OR FIREABLE(t44654)))) : A (G ((NOT FIREABLE(t43987) OR NOT FIREABLE(t44584) OR FIREABLE(t60710) OR ((FIREABLE(t25728) OR FIREABLE(t7283)) AND (FIREABLE(t65877) OR FIREABLE(t28926)) AND FIREABLE(t30888))))) : E (F ((FIREABLE(t17281) AND FIREABLE(t10400) AND NOT FIREABLE(t1913) AND NOT FIREABLE(t9971) AND NOT FIREABLE(t64621) AND FIREABLE(t2046)))) : E (F (FIREABLE(t13708))) : E (F (FIREABLE(t27530))) : E (F (FIREABLE(t7917))) : A (G ((NOT FIREABLE(t29302) OR (FIREABLE(t34997) AND FIREABLE(t39392)) OR NOT FIREABLE(t17971) OR FIREABLE(t44077))))
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 ((((NOT FIREABLE(t55348) OR NOT FIREABLE(t14612)) AND FIREABLE(t58781)) OR (FIREABLE(t33431) AND FIREABLE(t54503)))))
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 5232 bytes per marking, with 28 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 722 markings, 768 edges, 144 markings/sec, 0 secs
lola: sara is running 5 secs || 1323 markings, 1414 edges, 120 markings/sec, 5 secs
lola: sara is running 10 secs || 1980 markings, 2122 edges, 131 markings/sec, 10 secs
lola: sara is running 15 secs || 2670 markings, 2970 edges, 138 markings/sec, 15 secs
lola: sara is running 20 secs || 3357 markings, 3793 edges, 137 markings/sec, 20 secs
lola: sara is running 25 secs || 4027 markings, 4534 edges, 134 markings/sec, 25 secs
lola: sara is running 30 secs || 4699 markings, 5363 edges, 134 markings/sec, 30 secs
lola: sara is running 35 secs || 5377 markings, 6289 edges, 136 markings/sec, 35 secs
lola: sara is running 40 secs || 6047 markings, 7079 edges, 134 markings/sec, 40 secs
lola: sara is running 45 secs || 6721 markings, 7874 edges, 135 markings/sec, 45 secs
lola: sara is running 50 secs || 7277 markings, 8527 edges, 111 markings/sec, 50 secs
lola: sara is running 55 secs || 7753 markings, 9082 edges, 95 markings/sec, 55 secs
lola: sara is running 60 secs || 8229 markings, 9655 edges, 95 markings/sec, 60 secs
lola: sara is running 65 secs || 8705 markings, 10219 edges, 95 markings/sec, 65 secs
lola: sara is running 70 secs || 9182 markings, 10787 edges, 95 markings/sec, 70 secs
lola: sara is running 75 secs || 9653 markings, 11376 edges, 94 markings/sec, 75 secs
lola: sara is running 80 secs || 10118 markings, 11914 edges, 93 markings/sec, 80 secs
lola: sara is running 85 secs || 10533 markings, 12464 edges, 83 markings/sec, 85 secs
lola: sara is running 90 secs || 10950 markings, 13061 edges, 83 markings/sec, 90 secs
lola: sara is running 95 secs || 11366 markings, 13562 edges, 83 markings/sec, 95 secs
lola: sara is running 100 secs || 11783 markings, 14092 edges, 83 markings/sec, 100 secs
lola: sara is running 105 secs || 12196 markings, 14570 edges, 83 markings/sec, 105 secs
lola: sara is running 110 secs || 12610 markings, 15103 edges, 83 markings/sec, 110 secs
lola: sara is running 115 secs || 13028 markings, 15675 edges, 84 markings/sec, 115 secs
lola: sara is running 120 secs || 13446 markings, 16222 edges, 84 markings/sec, 120 secs
lola: sara is running 125 secs || 13863 markings, 16744 edges, 83 markings/sec, 125 secs
lola: sara is running 130 secs || 14276 markings, 17227 edges, 83 markings/sec, 130 secs
lola: sara is running 135 secs || 14680 markings, 17743 edges, 81 markings/sec, 135 secs
lola: sara is running 140 secs || 15076 markings, 18273 edges, 79 markings/sec, 140 secs
lola: sara is running 145 secs || 15480 markings, 18822 edges, 81 markings/sec, 145 secs
lola: sara is running 150 secs || 15880 markings, 19304 edges, 80 markings/sec, 150 secs
lola: sara is running 155 secs || 16284 markings, 19801 edges, 81 markings/sec, 155 secs
lola: sara is running 160 secs || 16687 markings, 20287 edges, 81 markings/sec, 160 secs
lola: sara is running 165 secs || 17090 markings, 20781 edges, 81 markings/sec, 165 secs
lola: sara is running 170 secs || 17495 markings, 21276 edges, 81 markings/sec, 170 secs
lola: sara is running 175 secs || 17903 markings, 21763 edges, 82 markings/sec, 175 secs
lola: sara is running 180 secs || 18327 markings, 22278 edges, 85 markings/sec, 180 secs
lola: sara is running 185 secs || 18747 markings, 22770 edges, 84 markings/sec, 185 secs
lola: sara is running 190 secs || 19171 markings, 23282 edges, 85 markings/sec, 190 secs
lola: sara is running 195 secs || 19593 markings, 23780 edges, 84 markings/sec, 195 secs
lola: sara is running 200 secs || 20015 markings, 24283 edges, 84 markings/sec, 200 secs
lola: sara is running 205 secs || 20437 markings, 24792 edges, 84 markings/sec, 205 secs
lola: sara is running 210 secs || 20861 markings, 25304 edges, 85 markings/sec, 210 secs
lola: sara is running 215 secs || 21282 markings, 25796 edges, 84 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t21712) AND ((FIREABLE(t14200) AND FIREABLE(t7629) AND NOT FIREABLE(t27207)) OR FIREABLE(t56067)))))
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 5232 bytes per marking, with 28 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t49211) OR NOT FIREABLE(t53092)) AND (NOT FIREABLE(t15351) OR NOT FIREABLE(t56753)) AND (NOT FIREABLE(t12093) OR (NOT FIREABLE(t18014) AND NOT FIREABLE(t66383))))))
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 5232 bytes per marking, with 28 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 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t9227) OR (FIREABLE(t44347) AND FIREABLE(t39247) AND NOT FIREABLE(t53488)) OR ((FIREABLE(t65322) OR FIREABLE(t19241) OR FIREABLE(t63185) OR FIREABLE(t57725)) AND ((FIREABLE(t38201) AND FIREABLE(t2932)) OR (FIREABLE(t58765) AND FIREABLE(t54304)))))))
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 5232 bytes per marking, with 28 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 47 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 1873 markings, 2030 edges, 375 markings/sec, 0 secs
lola: sara is running 5 secs || 3624 markings, 3933 edges, 350 markings/sec, 5 secs
lola: sara is running 10 secs || 5454 markings, 5923 edges, 366 markings/sec, 10 secs
lola: sara is running 15 secs || 7320 markings, 7954 edges, 373 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t10863) OR FIREABLE(t29978) OR NOT FIREABLE(t23841) OR (NOT FIREABLE(t50230) AND NOT FIREABLE(t64585)))))
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 5232 bytes per marking, with 28 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t33974) OR FIREABLE(t358) OR (FIREABLE(t20793) AND FIREABLE(t54273)) OR FIREABLE(t4713) OR NOT FIREABLE(t65495))))
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 5232 bytes per marking, with 28 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3531)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5232 bytes per marking, with 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-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 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t35440) OR FIREABLE(t27009) OR FIREABLE(t36704))))
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 5232 bytes per marking, with 28 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 569 markings, 617 edges, 114 markings/sec, 0 secs
lola: sara is running 5 secs || 1103 markings, 1242 edges, 107 markings/sec, 5 secs
lola: sara is running 10 secs || 1680 markings, 1931 edges, 115 markings/sec, 10 secs
lola: sara is running 15 secs || 2203 markings, 2539 edges, 105 markings/sec, 15 secs
lola: sara is running 20 secs || 2780 markings, 3231 edges, 115 markings/sec, 20 secs
lola: sara is running 25 secs || 3381 markings, 3955 edges, 120 markings/sec, 25 secs
lola: sara is running 30 secs || 3968 markings, 4665 edges, 117 markings/sec, 30 secs
lola: sara is running 35 secs || 4575 markings, 5399 edges, 121 markings/sec, 35 secs
lola: sara is running 40 secs || 5168 markings, 6118 edges, 119 markings/sec, 40 secs
lola: sara is running 45 secs || 5778 markings, 6864 edges, 122 markings/sec, 45 secs
lola: sara is running 50 secs || 6391 markings, 7606 edges, 123 markings/sec, 50 secs
lola: sara is running 55 secs || 6988 markings, 8332 edges, 119 markings/sec, 55 secs
lola: sara is running 60 secs || 7595 markings, 9063 edges, 121 markings/sec, 60 secs
lola: sara is running 65 secs || 8210 markings, 9821 edges, 123 markings/sec, 65 secs
lola: sara is running 70 secs || 8828 markings, 10568 edges, 124 markings/sec, 70 secs
lola: sara is running 75 secs || 9420 markings, 11284 edges, 118 markings/sec, 75 secs
lola: sara is running 80 secs || 10031 markings, 12023 edges, 122 markings/sec, 80 secs
lola: sara is running 85 secs || 10626 markings, 12747 edges, 119 markings/sec, 85 secs
lola: sara is running 90 secs || 11138 markings, 13341 edges, 102 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 399 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t56274)))
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 5232 bytes per marking, with 28 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-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 456 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t65682) AND FIREABLE(t28874)) OR FIREABLE(t44654))))
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 5232 bytes per marking, with 28 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-9.sara.
lola: sara is running 0 secs || 1521 markings, 1709 edges, 304 markings/sec, 0 secs
lola: sara is running 5 secs || 2966 markings, 3350 edges, 289 markings/sec, 5 secs
lola: sara is running 10 secs || 4497 markings, 5097 edges, 306 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t43987) OR NOT FIREABLE(t44584) OR FIREABLE(t60710) OR ((FIREABLE(t25728) OR FIREABLE(t7283)) AND (FIREABLE(t65877) OR FIREABLE(t28926)) AND FIREABLE(t30888)))))
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 5232 bytes per marking, with 28 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 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 635 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t17281) AND FIREABLE(t10400) AND NOT FIREABLE(t1913) AND NOT FIREABLE(t9971) AND NOT FIREABLE(t64621) AND FIREABLE(t2046))))
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 5232 bytes per marking, with 28 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 DLCshifumi-PT-6b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-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 794 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t13708)))
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 5232 bytes per marking, with 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-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 1059 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t27530)))
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 5232 bytes per marking, with 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-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 1588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7917)))
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 5232 bytes per marking, with 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 3156 markings, 3488 edges, 631 markings/sec, 0 secs
lola: sara is running 5 secs || 9921 markings, 11005 edges, 1353 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3166 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t29302) OR (FIREABLE(t34997) AND FIREABLE(t39392)) OR NOT FIREABLE(t17971) OR FIREABLE(t44077))))
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 5232 bytes per marking, with 28 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: unknown yes no yes no no yes yes yes yes no yes yes yes yes no
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494649671089

--------------------
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="DLCshifumi-PT-6b"
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/DLCshifumi-PT-6b.tgz
mv DLCshifumi-PT-6b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DLCshifumi-PT-6b, 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 r018-ebro-149436309400531"
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 ;