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 Raft-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140400162
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463729750700

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Raft-PT-04
FORMULA Raft-PT-04-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-04-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: 248/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 88 places, 160 transitions, 72 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 155 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-04-ReachabilityFireability.task
lola: read: EF (((((FIREABLE(t9) AND FIREABLE(t141)) AND !(FIREABLE(t144))) AND ((FIREABLE(t44) OR FIREABLE(t127)) AND !(FIREABLE(t49)))) AND !((FIREABLE(t46) OR (FIREABLE(t18) AND FIREABLE(t58)))))) : AG (((!(FIREABLE(t46)) OR !((FIREABLE(t120) AND FIREABLE(t146)))) OR (!((FIREABLE(t51) OR FIREABLE(t75))) OR ((FIREABLE(t59) OR FIREABLE(t10)) OR !(FIREABLE(t120)))))) : EF (((FIREABLE(t84) AND !(FIREABLE(t139)... (shortened)
lola: formula length: 1949
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(t9) AND (FIREABLE(t141) AND (! FIREABLE(t144) AND ((FIREABLE(t44) OR FIREABLE(t127)) AND (! FIREABLE(t49) AND (! FIREABLE(t46) AND (! FIREABLE(t18) OR ! FIREABLE(t58)))))))))
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 288 bytes per marking, with 0 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 58 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability.sara.
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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t46) OR (! FIREABLE(t120) OR (! FIREABLE(t146) OR ((! FIREABLE(t51) AND ! FIREABLE(t75)) OR (FIREABLE(t59) OR (FIREABLE(t10) OR ! FIREABLE(t120))))))))
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 288 bytes per marking, with 0 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 21 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t84) AND (! FIREABLE(t139) AND ((FIREABLE(t86) OR FIREABLE(t59)) AND ((FIREABLE(t79) OR FIREABLE(t148)) AND (! FIREABLE(t38) AND (FIREABLE(t133) AND FIREABLE(t54))))))))
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 288 bytes per marking, with 0 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 132 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-2.sara.
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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t120) OR (! FIREABLE(t42) OR ! FIREABLE(t39))))
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 288 bytes per marking, with 0 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 6 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t66) AND (FIREABLE(t63) AND (! FIREABLE(t107) OR (FIREABLE(t45) OR FIREABLE(t11))))))
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 288 bytes per marking, with 0 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 Raft-PT-04-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-4.sara.
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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t134) OR (! FIREABLE(t79) OR (FIREABLE(t100) OR (FIREABLE(t86) OR (FIREABLE(t77) AND FIREABLE(t37)))))))
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 288 bytes per marking, with 0 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 120 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(t25) AND ((FIREABLE(t77) OR FIREABLE(t135)) AND ! FIREABLE(t75))) OR (! FIREABLE(t10) OR (! FIREABLE(t82) OR (FIREABLE(t156) OR (FIREABLE(t32) OR FIREABLE(t140)))))))
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 288 bytes per marking, with 0 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 214 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t33) OR (FIREABLE(t119) AND (FIREABLE(t35) AND FIREABLE(t53)))) AND FIREABLE(t41)))
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 288 bytes per marking, with 0 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 11 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t41) AND (FIREABLE(t10) AND (FIREABLE(t154) AND (FIREABLE(t113) AND (FIREABLE(t128) AND ! FIREABLE(t75)))))))
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 288 bytes per marking, with 0 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 Raft-PT-04-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-8.sara.
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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t28) OR ! FIREABLE(t107)))
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 288 bytes per marking, with 0 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 3 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t14) OR (! FIREABLE(t17) OR (! FIREABLE(t33) OR ! FIREABLE(t5)))))
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 288 bytes per marking, with 0 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 5 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(t112) OR FIREABLE(t16)) AND ! FIREABLE(t55)) OR (! FIREABLE(t102) OR (! FIREABLE(t56) OR ((FIREABLE(t103) OR (FIREABLE(t39) OR (FIREABLE(t0) OR FIREABLE(t109)))) AND (! FIREABLE(t6) AND ! FIREABLE(t137)))))))
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 288 bytes per marking, with 0 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 183 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t98) OR ((! FIREABLE(t6) AND ! FIREABLE(t150)) OR (! FIREABLE(t90) AND (FIREABLE(t154) AND (FIREABLE(t82) AND FIREABLE(t40)))))))
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 288 bytes per marking, with 0 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 53 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t10))
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 288 bytes per marking, with 0 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 1 literals
lola: SUBRESULT
lola: result: yes
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-13.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t155) AND (FIREABLE(t36) AND (FIREABLE(t159) AND (FIREABLE(t98) AND FIREABLE(t104))))) OR (! FIREABLE(t60) AND FIREABLE(t151))))
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 288 bytes per marking, with 0 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 13 literals
lola: write sara problem file to Raft-PT-04-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-14.sara.
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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t30))
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 288 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no yes no yes no no no yes no yes yes no no yes no yes

BK_STOP 1463729751172

--------------------
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="Raft-PT-04"
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/Raft-PT-04.tgz
mv Raft-PT-04 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 Raft-PT-04, 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 r098kn-smll-146369140400162"
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 ;