About the Execution of LoLA for DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2583.750 | 418340.00 | 947260.00 | 72.70 | FTTTTTTFTTFTFTTT | 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-3253
Executing tool lola
Input is DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200315
=====================================================================
--------------------
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 DES-PT-40b-ReachabilityFireability-0
FORMULA_NAME DES-PT-40b-ReachabilityFireability-1
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2
FORMULA_NAME DES-PT-40b-ReachabilityFireability-3
FORMULA_NAME DES-PT-40b-ReachabilityFireability-4
FORMULA_NAME DES-PT-40b-ReachabilityFireability-5
FORMULA_NAME DES-PT-40b-ReachabilityFireability-6
FORMULA_NAME DES-PT-40b-ReachabilityFireability-7
FORMULA_NAME DES-PT-40b-ReachabilityFireability-8
FORMULA_NAME DES-PT-40b-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1494631230997
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DES-PT-40b @ 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: 829/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 439 places, 390 transitions, 374 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 487 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-40b-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t189) AND FIREABLE(t243) AND FIREABLE(t208) AND FIREABLE(t270) AND FIREABLE(t123) AND (FIREABLE(t33) OR (NOT FIREABLE(t37) AND NOT FIREABLE(t228)))))) : E (F ((NOT FIREABLE(t208) AND NOT FIREABLE(t159) AND NOT FIREABLE(t56) AND FIREABLE(t99) AND (FIREABLE(t305) OR FIREABLE(t285))))) : E (F (FIREABLE(t59))) : E (F (((FIREABLE(t144) OR FIREABLE(t62) OR (FIREABLE(t376) AND FIREABLE(t25))) AND FIREABLE(t156) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t223) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t339)))))) : A (G (NOT FIREABLE(t332))) : E (F (FIREABLE(t136))) : E (F ((FIREABLE(t189) AND FIREABLE(t39) AND FIREABLE(t81) AND FIREABLE(t36) AND (NOT FIREABLE(t387) OR NOT FIREABLE(t244)) AND FIREABLE(t64)))) : E (F (FIREABLE(t376))) : E (F (FIREABLE(t205))) : E (F ((FIREABLE(t274) AND (FIREABLE(t37) OR FIREABLE(t201) OR (FIREABLE(t8) AND FIREABLE(t231))) AND NOT FIREABLE(t124)))) : E (F ((FIREABLE(t160) OR FIREABLE(t9)))) : E (F (((FIREABLE(t212) AND FIREABLE(t164)) OR (FIREABLE(t234) AND FIREABLE(t94) AND FIREABLE(t75) AND FIREABLE(t366))))) : E (F ((FIREABLE(t27) AND (((FIREABLE(t166) OR FIREABLE(t303)) AND (FIREABLE(t299) OR FIREABLE(t75))) OR (NOT FIREABLE(t181) AND NOT FIREABLE(t218)))))) : E (F (((((FIREABLE(t348) OR FIREABLE(t48)) AND (FIREABLE(t137) OR FIREABLE(t283))) OR FIREABLE(t232)) AND ((NOT FIREABLE(t279) AND NOT FIREABLE(t26)) OR (FIREABLE(t156) AND FIREABLE(t177) AND NOT FIREABLE(t343)))))) : E (F (FIREABLE(t378))) : A (G (NOT FIREABLE(t258)))
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(t189) AND FIREABLE(t243) AND FIREABLE(t208) AND FIREABLE(t270) AND FIREABLE(t123) AND (FIREABLE(t33) OR (NOT FIREABLE(t37) AND NOT FIREABLE(t228))))))
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 48 bytes per marking, with 10 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t208) AND NOT FIREABLE(t159) AND NOT FIREABLE(t56) AND FIREABLE(t99) AND (FIREABLE(t305) OR FIREABLE(t285)))))
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 48 bytes per marking, with 10 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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
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(t59)))
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 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-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(t144) OR FIREABLE(t62) OR (FIREABLE(t376) AND FIREABLE(t25))) AND FIREABLE(t156) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t223) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t339))))))
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 48 bytes per marking, with 10 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 89 literals and 21 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t332)))
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 48 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-4.sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t136)))
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 48 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
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 DES-PT-40b-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file DES-PT-40b-ReachabilityFireability-4.sara.
lola: ...considering subproblem: E (F ((FIREABLE(t189) AND FIREABLE(t39) AND FIREABLE(t81) AND FIREABLE(t36) AND (NOT FIREABLE(t387) OR NOT FIREABLE(t244)) AND FIREABLE(t64))))
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 48 bytes per marking, with 10 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)
sara: lola: try reading problem file DES-PT-40b-ReachabilityFireability-5.sara.
RUNNING
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-6.sara
lola: The predicate is unreachable.
lola: ========================================
lola: lola: state equation: calling and running sarasubprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t376)))
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 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-6.sara.
sara: try reading problem file DES-PT-40b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
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(t205)))
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 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 921647 markings, 1162032 edges, 184329 markings/sec, 0 secs
lola: sara is running 5 secs || 1779950 markings, 2293959 edges, 171661 markings/sec, 5 secs
lola: sara is running 10 secs || 2588493 markings, 3422334 edges, 161709 markings/sec, 10 secs
lola: sara is running 15 secs || 3394731 markings, 4532686 edges, 161248 markings/sec, 15 secs
lola: sara is running 20 secs || 4200659 markings, 5646283 edges, 161186 markings/sec, 20 secs
lola: sara is running 25 secs || 4972211 markings, 6753384 edges, 154310 markings/sec, 25 secs
lola: sara is running 30 secs || 5740632 markings, 7826673 edges, 153684 markings/sec, 30 secs
lola: sara is running 35 secs || 6371998 markings, 8975827 edges, 126273 markings/sec, 35 secs
lola: sara is running 40 secs || 6923927 markings, 10082932 edges, 110386 markings/sec, 40 secs
lola: sara is running 45 secs || 7475846 markings, 11322152 edges, 110384 markings/sec, 45 secs
lola: sara is running 50 secs || 8066262 markings, 12472659 edges, 118083 markings/sec, 50 secs
lola: sara is running 55 secs || 8579260 markings, 13633061 edges, 102600 markings/sec, 55 secs
lola: sara is running 60 secs || 9175227 markings, 14830554 edges, 119193 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t274) AND (FIREABLE(t37) OR FIREABLE(t201) OR (FIREABLE(t8) AND FIREABLE(t231))) AND NOT FIREABLE(t124))))
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 48 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t160) OR FIREABLE(t9))))
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 48 bytes per marking, with 10 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-10.sara
lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t212) AND FIREABLE(t164)) OR (FIREABLE(t234) AND FIREABLE(t94) AND FIREABLE(t75) AND FIREABLE(t366)))))
lola: ========================================
lola: SUBTASK
lola: lola: checking reachability
lola: ========================================lola:
state equation: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-11.sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 577042 markings, 1265054 edges, 115408 markings/sec, 0 secs
lola: sara is running 5 secs || 1026834 markings, 2318283 edges, 89958 markings/sec, 5 secs
lola: sara is running 10 secs || 1464501 markings, 3315338 edges, 87533 markings/sec, 10 secs
lola: sara is running 15 secs || 1942831 markings, 4506952 edges, 95666 markings/sec, 15 secs
lola: sara is running 20 secs || 2401946 markings, 5559461 edges, 91823 markings/sec, 20 secs
lola: sara is running 25 secs || 2858894 markings, 6600524 edges, 91390 markings/sec, 25 secs
lola: sara is running 30 secs || 3305819 markings, 7686088 edges, 89385 markings/sec, 30 secs
lola: sara is running 35 secs || 3713420 markings, 8719979 edges, 81520 markings/sec, 35 secs
lola: sara is running 40 secs || 4115229 markings, 9714049 edges, 80362 markings/sec, 40 secs
lola: sara is running 45 secs || 4511323 markings, 10682082 edges, 79219 markings/sec, 45 secs
lola: sara is running 50 secs || 4907977 markings, 11614850 edges, 79331 markings/sec, 50 secs
lola: sara is running 55 secs || 5290125 markings, 12547478 edges, 76430 markings/sec, 55 secs
lola: sara is running 60 secs || 5676250 markings, 13490469 edges, 77225 markings/sec, 60 secs
lola: sara is running 65 secs || 6054023 markings, 14416152 edges, 75555 markings/sec, 65 secs
lola: sara is running 70 secs || 6433357 markings, 15345239 edges, 75867 markings/sec, 70 secs
lola: sara is running 75 secs || 6812693 markings, 16275624 edges, 75867 markings/sec, 75 secs
lola: sara is running 80 secs || 7190813 markings, 17202266 edges, 75624 markings/sec, 80 secs
lola: sara is running 85 secs || 7557866 markings, 18103202 edges, 73411 markings/sec, 85 secs
lola: sara is running 90 secs || 7927569 markings, 19028048 edges, 73941 markings/sec, 90 secs
lola: sara is running 95 secs || 8340666 markings, 20061396 edges, 82619 markings/sec, 95 secs
lola: sara is running 100 secs || 8753505 markings, 21154612 edges, 82568 markings/sec, 100 secs
lola: sara is running 105 secs || 9174963 markings, 22249825 edges, 84292 markings/sec, 105 secs
lola: sara is running 110 secs || 9616792 markings, 23428670 edges, 88366 markings/sec, 110 secs
lola: sara is running 115 secs || 10036841 markings, 24588594 edges, 84010 markings/sec, 115 secs
lola: sara is running 120 secs || 10421204 markings, 25643230 edges, 76873 markings/sec, 120 secs
lola: sara is running 125 secs || 10795571 markings, 26653743 edges, 74873 markings/sec, 125 secs
lola: sara is running 130 secs || 11159276 markings, 27656470 edges, 72741 markings/sec, 130 secs
lola: sara is running 135 secs || 11524230 markings, 28664921 edges, 72991 markings/sec, 135 secs
lola: sara is running 140 secs || 11879350 markings, 29645717 edges, 71024 markings/sec, 140 secs
lola: sara is running 145 secs || 12285737 markings, 30778389 edges, 81277 markings/sec, 145 secs
lola: sara is running 150 secs || 12771645 markings, 31953192 edges, 97182 markings/sec, 150 secs
lola: sara is running 155 secs || 13258645 markings, 33162256 edges, 97400 markings/sec, 155 secs
lola: sara is running 160 secs || 13713168 markings, 34190348 edges, 90905 markings/sec, 160 secs
lola: sara is running 165 secs || 14185234 markings, 35310214 edges, 94413 markings/sec, 165 secs
lola: sara is running 170 secs || 14675096 markings, 36424761 edges, 97972 markings/sec, 170 secs
lola: sara is running 175 secs || 15189170 markings, 37531185 edges, 102815 markings/sec, 175 secs
lola: sara is running 180 secs || 15712202 markings, 38835206 edges, 104606 markings/sec, 180 secs
lola: sara is running 185 secs || 16231553 markings, 40151214 edges, 103870 markings/sec, 185 secs
lola: sara is running 190 secs || 16742047 markings, 41483014 edges, 102099 markings/sec, 190 secs
lola: sara is running 195 secs || 17250055 markings, 42813102 edges, 101602 markings/sec, 195 secs
lola: sara is running 200 secs || 17735620 markings, 44077841 edges, 97113 markings/sec, 200 secs
lola: sara is running 205 secs || 18478753 markings, 45114475 edges, 148627 markings/sec, 205 secs
lola: sara is running 210 secs || 19132545 markings, 46275044 edges, 130758 markings/sec, 210 secs
lola: sara is running 215 secs || 19881272 markings, 47311836 edges, 149745 markings/sec, 215 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t27) AND (((FIREABLE(t166) OR FIREABLE(t303)) AND (FIREABLE(t299) OR FIREABLE(t75))) OR (NOT FIREABLE(t181) AND NOT FIREABLE(t218))))))
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 48 bytes per marking, with 10 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 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t348) OR FIREABLE(t48)) AND (FIREABLE(t137) OR FIREABLE(t283))) OR FIREABLE(t232)) AND ((NOT FIREABLE(t279) AND NOT FIREABLE(t26)) OR (FIREABLE(t156) AND FIREABLE(t177) AND NOT FIREABLE(t343))))))
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 48 bytes per marking, with 10 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 105 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 542043 markings, 1114063 edges, 108409 markings/sec, 0 secs
lola: sara is running 5 secs || 1054647 markings, 2207771 edges, 102521 markings/sec, 5 secs
lola: sara is running 10 secs || 1559507 markings, 3320438 edges, 100972 markings/sec, 10 secs
lola: sara is running 15 secs || 2067492 markings, 4463499 edges, 101597 markings/sec, 15 secs
lola: sara is running 20 secs || 2575060 markings, 5609030 edges, 101514 markings/sec, 20 secs
lola: sara is running 25 secs || 3081019 markings, 6747675 edges, 101192 markings/sec, 25 secs
lola: sara is running 30 secs || 3585765 markings, 7885279 edges, 100949 markings/sec, 30 secs
lola: sara is running 35 secs || 4092753 markings, 9026994 edges, 101398 markings/sec, 35 secs
lola: sara is running 40 secs || 4599667 markings, 10168395 edges, 101383 markings/sec, 40 secs
lola: sara is running 45 secs || 5109723 markings, 11317805 edges, 102011 markings/sec, 45 secs
lola: sara is running 50 secs || 5620471 markings, 12467426 edges, 102150 markings/sec, 50 secs
lola: sara is running 55 secs || 6127452 markings, 13608509 edges, 101396 markings/sec, 55 secs
lola: sara is running 60 secs || 6630608 markings, 14745141 edges, 100631 markings/sec, 60 secs
lola: sara is running 65 secs || 7137702 markings, 15886447 edges, 101419 markings/sec, 65 secs
lola: sara is running 70 secs || 7600486 markings, 16929201 edges, 92557 markings/sec, 70 secs
lola: sara is running 75 secs || 8041979 markings, 17922431 edges, 88299 markings/sec, 75 secs
lola: sara is running 80 secs || 8482058 markings, 18912535 edges, 88016 markings/sec, 80 secs
lola: sara is running 85 secs || 8917805 markings, 19897605 edges, 87149 markings/sec, 85 secs
lola: sara is running 90 secs || 9350208 markings, 20871241 edges, 86481 markings/sec, 90 secs
lola: sara is running 95 secs || 9776425 markings, 21830555 edges, 85243 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1570 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t378)))
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 48 bytes per marking, with 10 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 DES-PT-40b-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 3141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t258)))
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 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 784947 markings, 1092218 edges, 156989 markings/sec, 0 secs
lola: sara is running 5 secs || 1439902 markings, 2186907 edges, 130991 markings/sec, 5 secs
lola: sara is running 10 secs || 2103787 markings, 3285355 edges, 132777 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes no yes yes yes yes yes yes yes yes no
FORMULA DES-PT-40b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494631649337
--------------------
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="DES-PT-40b"
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/DES-PT-40b.tgz
mv DES-PT-40b 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 DES-PT-40b, 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-149436309200315"
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 ;