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-2979
Executing tool lola
Input is Echo-PT-d05r03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038kn-smll-146351480600216
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463564027956

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Echo-PT-d05r03
FORMULA Echo-PT-d05r03-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Echo-PT-d05r03-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 6939/65536 symbol table entries, 1161 collisions
lola: preprocessing...
lola: finding significant places
lola: 3717 places, 3222 transitions, 1854 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6434 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d05r03-ReachabilityFireability.task
lola: read: EF (FIREABLE(t2208)) : EF (((((FIREABLE(t1975) AND FIREABLE(t1669)) OR !(FIREABLE(t318))) AND FIREABLE(t643)) OR (((FIREABLE(t2337) OR FIREABLE(t373)) OR (FIREABLE(t1727) OR FIREABLE(t2749))) AND FIREABLE(t1992)))) : EF (FIREABLE(t3030)) : AG ((FIREABLE(t2840) OR !(((FIREABLE(t2203) OR FIREABLE(t2243)) AND FIREABLE(t2647))))) : EF (FIREABLE(t2609)) : EF (!(!(FIREABLE(t435)))) : EF ((FIREABLE(t2121... (shortened)
lola: formula length: 1484
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t2208))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(t1975) AND FIREABLE(t1669)) OR ! FIREABLE(t318)) AND FIREABLE(t643)) OR ((FIREABLE(t2337) OR (FIREABLE(t373) OR (FIREABLE(t1727) OR FIREABLE(t2749)))) AND FIREABLE(t1992))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 65 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t3030))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t2840) OR ((! FIREABLE(t2203) AND ! FIREABLE(t2243)) OR ! FIREABLE(t2647))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 198 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t2609))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t435))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t2121) AND (! FIREABLE(t953) OR (! FIREABLE(t1566) OR ! FIREABLE(t2469)))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 72 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: lola: calling and running sara
result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(t3089) OR (! FIREABLE(t1457) OR ! FIREABLE(t2816))) AND ((! FIREABLE(t1069) AND ! FIREABLE(t255)) OR ! FIREABLE(t2448))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-6.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 76 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t1237) OR FIREABLE(t967)) AND (! FIREABLE(t720) AND FIREABLE(t965))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 20 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t2033) OR (! FIREABLE(t2156) OR FIREABLE(t909))) AND FIREABLE(t919)))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 34 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t366))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-10.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(t1148) OR ! FIREABLE(t620)) AND (((FIREABLE(t1719) AND FIREABLE(t379)) OR (FIREABLE(t2592) AND FIREABLE(t1007))) AND (FIREABLE(t48) AND FIREABLE(t2112)))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 148 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t797) AND (((FIREABLE(t624) AND FIREABLE(t941)) OR (FIREABLE(t1614) OR FIREABLE(t1038))) AND FIREABLE(t2249))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 35 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(t1698) OR (FIREABLE(t2842) OR FIREABLE(t300))) AND (! FIREABLE(t905) AND ! FIREABLE(t2403))) OR (FIREABLE(t1093) AND (! FIREABLE(t3129) OR ! FIREABLE(t738)))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 307 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(t961) AND ! FIREABLE(t1376)) OR ! FIREABLE(t2376)) AND FIREABLE(t2095)))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 75 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(t562) OR ! FIREABLE(t2818)) AND (FIREABLE(t2590) AND FIREABLE(t2725))))
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 232 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 117 literals
lola: write sara problem file to Echo-PT-d05r03-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file Echo-PT-d05r03-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes no yes yes yes no yes yes yes no yes no yes yes

BK_STOP 1463564110999

--------------------
content from 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="Echo-PT-d05r03"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/Echo-PT-d05r03.tgz
mv Echo-PT-d05r03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is Echo-PT-d05r03, 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 r038kn-smll-146351480600216"
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 ;