fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612200252
Last Updated
June 27, 2017

About the Execution of LoLA for S_Echo-PT-d02r11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.640 78395.00 138898.00 1593.80 ?FTTTTFTFTTTTTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Echo-PT-d02r11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612200252
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496362625080


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Echo-PT-d02r11: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_Echo-PT-d02r11: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_Echo-PT-d02r11 @ 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: 1993/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1119 places, 874 transitions, 558 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1736 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r11-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t8) AND NOT FIREABLE(t82)) OR NOT FIREABLE(t359) OR NOT FIREABLE(t159)))) : A (G (((NOT FIREABLE(t441) OR FIREABLE(t766)) AND (NOT FIREABLE(t95) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t126)))))) : A (G (NOT FIREABLE(t546))) : E (F (((FIREABLE(t278) AND FIREABLE(t708)) OR (FIREABLE(t750) AND FIREABLE(t195) AND FIREABLE(t507) AND FIREABLE(t222))))) : E (F (FIREABLE(t548))) : A (G ((FIREABLE(t462) OR FIREABLE(t311) OR FIREABLE(t232) OR NOT FIREABLE(t310) OR NOT FIREABLE(t781) OR FIREABLE(t476)))) : E (F ((FIREABLE(t49) OR (FIREABLE(t225) AND FIREABLE(t611) AND (FIREABLE(t63) OR FIREABLE(t780) OR NOT FIREABLE(t415)))))) : E (F (FIREABLE(t489))) : E (F ((FIREABLE(t806) AND FIREABLE(t740) AND FIREABLE(t400)))) : E (F (FIREABLE(t114))) : E (F (FIREABLE(t803))) : E (F ((NOT FIREABLE(t95) AND ((FIREABLE(t638) AND FIREABLE(t464)) OR (FIREABLE(t1) AND FIREABLE(t241))) AND FIREABLE(t219)))) : E (F (FIREABLE(t678))) : E (F ((FIREABLE(t575) OR FIREABLE(t148) OR FIREABLE(t665) OR ((FIREABLE(t858) OR FIREABLE(t466)) AND NOT FIREABLE(t267)) OR (FIREABLE(t81) AND ((FIREABLE(t462) AND FIREABLE(t593)) OR (FIREABLE(t283) AND FIREABLE(t441))))))) : A (G ((((FIREABLE(t858) AND FIREABLE(t438)) OR NOT FIREABLE(t340) OR (FIREABLE(t534) AND FIREABLE(t284) AND (FIREABLE(t579) OR FIREABLE(t385)))) AND NOT FIREABLE(t95)))) : E (F (((FIREABLE(t519) OR FIREABLE(t213) OR NOT FIREABLE(t235)) AND FIREABLE(t103) AND FIREABLE(t21))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t8) AND NOT FIREABLE(t82)) OR NOT FIREABLE(t359) OR NOT FIREABLE(t159))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1943558 markings, 1947249 edges, 388712 markings/sec, 0 secs
lola: sara is running 5 secs || 3838127 markings, 3845529 edges, 378914 markings/sec, 5 secs
lola: sara is running 10 secs || 5687799 markings, 5698832 edges, 369934 markings/sec, 10 secs
lola: sara is running 15 secs || 7513251 markings, 7527867 edges, 365090 markings/sec, 15 secs
lola: sara is running 20 secs || 9352886 markings, 9371188 edges, 367927 markings/sec, 20 secs
lola: sara is running 25 secs || 11166630 markings, 11188570 edges, 362749 markings/sec, 25 secs
lola: sara is running 30 secs || 12973693 markings, 12999258 edges, 361413 markings/sec, 30 secs
lola: sara is running 35 secs || 14720772 markings, 14749842 edges, 349416 markings/sec, 35 secs
sara: warning, failure of lp_solve (at job 586)
lola: sara is running 40 secs || 16482302 markings, 16514905 edges, 352306 markings/sec, 40 secs
lola: sara is running 45 secs || 18239519 markings, 18275647 edges, 351443 markings/sec, 45 secs
lola: sara is running 50 secs || 19992898 markings, 20032543 edges, 350676 markings/sec, 50 secs
lola: sara is running 55 secs || 20646695 markings, 20687652 edges, 130759 markings/sec, 55 secs
lola: sara is running 60 secs || 20649055 markings, 20690017 edges, 472 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t441) OR FIREABLE(t766)) AND (NOT FIREABLE(t95) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t126))))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t546)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t278) AND FIREABLE(t708)) OR (FIREABLE(t750) AND FIREABLE(t195) AND FIREABLE(t507) AND FIREABLE(t222)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability.sara
lola: ========================================
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t548)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t462) OR FIREABLE(t311) OR FIREABLE(t232) OR NOT FIREABLE(t310) OR NOT FIREABLE(t781) OR FIREABLE(t476))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 480 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1566184 markings, 2284605 edges, 313237 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t49) OR (FIREABLE(t225) AND FIREABLE(t611) AND (FIREABLE(t63) OR FIREABLE(t780) OR NOT FIREABLE(t415))))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t489)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t806) AND FIREABLE(t740) AND FIREABLE(t400))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t114)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t803)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-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 692 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t95) AND ((FIREABLE(t638) AND FIREABLE(t464)) OR (FIREABLE(t1) AND FIREABLE(t241))) AND FIREABLE(t219))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 38 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-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 865 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t678)))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-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 1154 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t575) OR FIREABLE(t148) OR FIREABLE(t665) OR ((FIREABLE(t858) OR FIREABLE(t466)) AND NOT FIREABLE(t267)) OR (FIREABLE(t81) AND ((FIREABLE(t462) AND FIREABLE(t593)) OR (FIREABLE(t283) AND FIREABLE(t441)))))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 41 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability-13.sara.
lola: subprocess 14 will run for 1731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t858) AND FIREABLE(t438)) OR NOT FIREABLE(t340) OR (FIREABLE(t534) AND FIREABLE(t284) AND (FIREABLE(t579) OR FIREABLE(t385)))) AND NOT FIREABLE(t95))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3462 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t519) OR FIREABLE(t213) OR NOT FIREABLE(t235)) AND FIREABLE(t103) AND FIREABLE(t21))))
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 2232 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 23 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no yes yes yes yes yes yes yes yes yes yes yes no yes
FORMULA Echo-PT-d02r11-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496362703475

--------------------
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_Echo-PT-d02r11"
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_Echo-PT-d02r11.tgz
mv S_Echo-PT-d02r11 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_Echo-PT-d02r11, 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 r108-blw3-149441612200252"
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 ;