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_TCPcondis-PT-30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100225
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496565713422


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


checking for too many tokens
===========================================================================================
S_TCPcondis-PT-30: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_TCPcondis-PT-30 @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-30-ReachabilityFireability.task
lola: E (F (FIREABLE(rf2))) : E (F (FIREABLE(rf2))) : E (F ((FIREABLE(xraf) AND FIREABLE(xrf) AND NOT FIREABLE(xras) AND (FIREABLE(xAOPEN) OR FIREABLE(xraf1) OR NOT FIREABLE(xrf2)) AND NOT FIREABLE(xrs1)))) : E (F ((FIREABLE(xend)))) : A (G ((FIREABLE(xSEND) OR FIREABLE(CLOSE2) OR NOT FIREABLE(end) OR (FIREABLE(AOPEN) AND FIREABLE(xras)) OR (FIREABLE(xrf) AND FIREABLE(rs1)) OR NOT FIREABLE(raf2) OR NOT FIREABLE(rf1)))) : E (F ((NOT FIREABLE(CLOSE2) AND FIREABLE(xraf2) AND (FIREABLE(end) OR FIREABLE(rf2))))) : E (F ((FIREABLE(xCLOSE3) AND FIREABLE(CLOSE2) AND FIREABLE(rsa)))) : A (G (((FIREABLE(xCLOSE2) AND (FIREABLE(rs) OR FIREABLE(xrf2)) AND (FIREABLE(xraf1) OR FIREABLE(AOPEN) OR FIREABLE(xrs1))) OR FIREABLE(xAOPEN)))) : E (F ((FIREABLE(xend) OR FIREABLE(xraf2)))) : E (F ((((NOT FIREABLE(POPEN) AND NOT FIREABLE(xCLOSE3)) OR (NOT FIREABLE(ras) AND NOT FIREABLE(end))) AND FIREABLE(raf1)))) : E (F (FIREABLE(xrf2))) : E (F (((FIREABLE(rs1) AND FIREABLE(xraf1))))) : A (G ((FIREABLE(xPOPEN) OR (FIREABLE(xraf1) AND FIREABLE(rs) AND (FIREABLE(xPOPEN) OR FIREABLE(xrf1)) AND FIREABLE(SEND))))) : E (F ((NOT FIREABLE(rs) AND (FIREABLE(xraf1) OR FIREABLE(rs)) AND FIREABLE(xrsa) AND NOT FIREABLE(xPOPEN)))) : E (F ((FIREABLE(xCLOSE3) AND (((FIREABLE(xraf1) OR FIREABLE(xCLOSE2)) AND FIREABLE(rf2)) OR (FIREABLE(rf1) AND FIREABLE(AOPEN) AND (FIREABLE(xend) OR FIREABLE(xrf))))))) : A (G (FIREABLE(POPEN)))
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(rf2)))
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 84 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 TCPcondis-PT-30-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: The predicate is reachable.state equation: calling and running sara

lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(rf2)))
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 84 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 TCPcondis-PT-30-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(xraf) AND FIREABLE(xrf) AND NOT FIREABLE(xras) AND (FIREABLE(xAOPEN) OR FIREABLE(xraf1) OR NOT FIREABLE(xrf2)) AND NOT FIREABLE(xrs1))))
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 84 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 88 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-2.sara
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(xend))))
lola: ========================================
lola: SUBTASK
lola: sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability.sara.checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 1 literals and 1 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 TCPcondis-PT-30-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(xSEND) OR FIREABLE(CLOSE2) OR NOT FIREABLE(end) OR (FIREABLE(AOPEN) AND FIREABLE(xras)) OR (FIREABLE(xrf) AND FIREABLE(rs1)) OR NOT FIREABLE(raf2) OR NOT FIREABLE(rf1))))
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 84 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 108 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-4.sara
sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-3.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
sara: place or transition ordering is non-deterministic
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F ((NOT FIREABLE(CLOSE2) AND FIREABLE(xraf2) AND (FIREABLE(end) OR FIREABLE(rf2)))))
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 84 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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(xCLOSE3) AND FIREABLE(CLOSE2) AND FIREABLE(rsa))))
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 84 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: state equation: calling and running sara


sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-6.sara.
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(xCLOSE2) AND (FIREABLE(rs) OR FIREABLE(xrf2)) AND (FIREABLE(xraf1) OR FIREABLE(AOPEN) OR FIREABLE(xrs1))) OR FIREABLE(xAOPEN))))
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 84 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 9 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 TCPcondis-PT-30-ReachabilityFireability-7.sara
sara: place or transition ordering is non-deterministic
lola: lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)========================================

lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(xend) OR FIREABLE(xraf2))))
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 84 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 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 TCPcondis-PT-30-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(POPEN) AND NOT FIREABLE(xCLOSE3)) OR (NOT FIREABLE(ras) AND NOT FIREABLE(end))) AND FIREABLE(raf1))))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-9.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(xrf2)))
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 84 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 TCPcondis-PT-30-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: state equation: calling and running sara
The predicate is reachable.
lola: ========================================
sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-9.sara.
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(rs1) AND FIREABLE(xraf1)))))
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 84 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
sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-11.sara
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(xPOPEN) OR (FIREABLE(xraf1) AND FIREABLE(rs) AND (FIREABLE(xPOPEN) OR FIREABLE(xrf1)) AND FIREABLE(SEND)))))
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 84 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 16 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.sara:
place or transition ordering is non-deterministic
lola: state equation: write sara problem file to TCPcondis-PT-30-ReachabilityFireability-12.sara
lola: ========================================
sara: place or transition ordering is non-deterministic

lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(rs) AND (FIREABLE(xraf1) OR FIREABLE(rs)) AND FIREABLE(xrsa) AND NOT FIREABLE(xPOPEN))))
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 84 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 TCPcondis-PT-30-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================

sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-13.sara.
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(xCLOSE3) AND (((FIREABLE(xraf1) OR FIREABLE(xCLOSE2)) AND FIREABLE(rf2)) OR (FIREABLE(rf1) AND FIREABLE(AOPEN) AND (FIREABLE(xend) OR FIREABLE(xrf)))))))
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 84 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 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-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 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(POPEN)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
sara: lola: place or transition ordering is non-deterministic
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 TCPcondis-PT-30-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: state equation: calling and running saraThe predicate is not invariant.

lola: ========================================lola:
RESULT
lola:
SUMMARY: yes yes yes yes no yes yes no yes yes yes yes no yes yes no
sara: try reading problem file TCPcondis-PT-30-ReachabilityFireability-15.sara.

sara: place or transition ordering is non-deterministic

FORMULA TCPcondis-PT-30-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496565713885

--------------------
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_TCPcondis-PT-30"
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_TCPcondis-PT-30.tgz
mv S_TCPcondis-PT-30 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_TCPcondis-PT-30, 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 r158-ebro-149443464100225"
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 ;