About the Execution of LoLA for S_DLCshifumi-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 888.140 | 130095.00 | 257692.00 | 32.70 | TTTTFTFFTTFFTTTT | 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 S_DLCshifumi-PT-6a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488456000522
=====================================================================
--------------------
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-6a-ReachabilityFireability-0
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-1
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-15
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-2
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-3
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-4
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-5
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-6
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-7
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-8
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1496473070175
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DLCshifumi-PT-6a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DLCshifumi-PT-6a: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DLCshifumi-PT-6a @ 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: 29504/65536 symbol table entries, 13256 collisions
lola: preprocessing...
lola: finding significant places
lola: 3568 places, 25936 transitions, 1153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 22565 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6a-ReachabilityFireability.task
lola: E (F (FIREABLE(t7473))) : E (F ((FIREABLE(t17540) AND ((FIREABLE(t3299) AND FIREABLE(t1140)) OR (FIREABLE(t16195) AND FIREABLE(t18207)) OR FIREABLE(t9443))))) : E (F ((FIREABLE(t23325) AND (FIREABLE(t4940) OR FIREABLE(t15887)) AND (FIREABLE(t970) OR FIREABLE(t6014) OR FIREABLE(t21863) OR FIREABLE(t9746)) AND FIREABLE(t481)))) : A (G ((NOT FIREABLE(t3639) OR NOT FIREABLE(t1819)))) : A (G (NOT FIREABLE(t12433))) : A (G ((FIREABLE(t6848) OR FIREABLE(t8276) OR (FIREABLE(t4730) AND FIREABLE(t6574)) OR NOT FIREABLE(t23903) OR (FIREABLE(t8199) AND FIREABLE(t16139))))) : E (F (FIREABLE(t19939))) : E (F (FIREABLE(t3289))) : E (F (((FIREABLE(t7324) AND FIREABLE(t17758) AND FIREABLE(t23489) AND FIREABLE(t22162)) OR (FIREABLE(t393) AND FIREABLE(t25903))))) : E (F (FIREABLE(t8495))) : E (F (FIREABLE(t7866))) : E (F (FIREABLE(t15018))) : A (G (((NOT FIREABLE(t17650) AND NOT FIREABLE(t23834) AND NOT FIREABLE(t21361)) OR FIREABLE(t14619)))) : E (F (FIREABLE(t8913))) : A (G (((NOT FIREABLE(t7064) AND NOT FIREABLE(t16225) AND FIREABLE(t19563)) OR (NOT FIREABLE(t2710) AND NOT FIREABLE(t18395))))) : A (G ((NOT FIREABLE(t17972) OR NOT FIREABLE(t8849))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7473)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t17540) AND ((FIREABLE(t3299) AND FIREABLE(t1140)) OR (FIREABLE(t16195) AND FIREABLE(t18207)) OR FIREABLE(t9443)))))
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 148 bytes per marking, with 31 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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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(t23325) AND (FIREABLE(t4940) OR FIREABLE(t15887)) AND (FIREABLE(t970) OR FIREABLE(t6014) OR FIREABLE(t21863) OR FIREABLE(t9746)) AND FIREABLE(t481))))
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 148 bytes per marking, with 31 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 54 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3639) OR NOT FIREABLE(t1819))))
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 148 bytes per marking, with 31 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 333 markings, 27322 edges, 67 markings/sec, 0 secs
lola: sara is running 5 secs || 657 markings, 54193 edges, 65 markings/sec, 5 secs
lola: sara is running 10 secs || 983 markings, 81006 edges, 65 markings/sec, 10 secs
lola: sara is running 15 secs || 1317 markings, 109497 edges, 67 markings/sec, 15 secs
lola: sara is running 20 secs || 1685 markings, 142478 edges, 74 markings/sec, 20 secs
lola: sara is running 25 secs || 2058 markings, 176472 edges, 75 markings/sec, 25 secs
lola: sara is running 30 secs || 2430 markings, 210885 edges, 74 markings/sec, 30 secs
lola: sara is running 35 secs || 2813 markings, 246018 edges, 77 markings/sec, 35 secs
lola: sara is running 40 secs || 3195 markings, 282279 edges, 76 markings/sec, 40 secs
lola: sara is running 45 secs || 3578 markings, 316993 edges, 77 markings/sec, 45 secs
lola: sara is running 50 secs || 3955 markings, 350350 edges, 75 markings/sec, 50 secs
lola: sara is running 55 secs || 4333 markings, 384710 edges, 76 markings/sec, 55 secs
lola: sara is running 60 secs || 4706 markings, 418541 edges, 75 markings/sec, 60 secs
lola: sara is running 65 secs || 5078 markings, 453307 edges, 74 markings/sec, 65 secs
lola: sara is running 70 secs || 5453 markings, 489339 edges, 75 markings/sec, 70 secs
lola: sara is running 75 secs || 5835 markings, 523691 edges, 76 markings/sec, 75 secs
lola: sara is running 80 secs || 6211 markings, 557276 edges, 75 markings/sec, 80 secs
lola: sara is running 85 secs || 6579 markings, 590263 edges, 74 markings/sec, 85 secs
lola: sara is running 90 secs || 6945 markings, 623524 edges, 73 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 7306 markings, 657329 edges, 72 markings/sec, 95 secs
lola: sara is running 100 secs || 7668 markings, 691393 edges, 72 markings/sec, 100 secs
lola: sara is running 105 secs || 8029 markings, 724881 edges, 72 markings/sec, 105 secs
lola: sara is running 110 secs || 8390 markings, 757331 edges, 72 markings/sec, 110 secs
lola: sara is running 115 secs || 8750 markings, 789862 edges, 72 markings/sec, 115 secs
lola: sara is running 120 secs || 9110 markings, 822774 edges, 72 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t12433)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t6848) OR FIREABLE(t8276) OR (FIREABLE(t4730) AND FIREABLE(t6574)) OR NOT FIREABLE(t23903) OR (FIREABLE(t8199) AND FIREABLE(t16139)))))
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 148 bytes per marking, with 31 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 384 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t19939)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3289)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t7324) AND FIREABLE(t17758) AND FIREABLE(t23489) AND FIREABLE(t22162)) OR (FIREABLE(t393) AND FIREABLE(t25903)))))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t8495)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7866)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t15018)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 852 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t17650) AND NOT FIREABLE(t23834) AND NOT FIREABLE(t21361)) OR FIREABLE(t14619))))
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 148 bytes per marking, with 31 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 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t8913)))
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 148 bytes per marking, with 31 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-6a-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 1705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t7064) AND NOT FIREABLE(t16225) AND FIREABLE(t19563)) OR (NOT FIREABLE(t2710) AND NOT FIREABLE(t18395)))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t17972) OR NOT FIREABLE(t8849))))
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 148 bytes per marking, with 31 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no yes yes yes yes yes yes no yes no no
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496473200270
--------------------
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="S_DLCshifumi-PT-6a"
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/S_DLCshifumi-PT-6a.tgz
mv S_DLCshifumi-PT-6a 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 S_DLCshifumi-PT-6a, 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 r098-ebro-149488456000522"
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 ;