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 ParamProductionCell-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811000167
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463680049838

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ ParamProductionCell-PT-3
FORMULA ParamProductionCell-PT-3-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ParamProductionCell-PT-3-LTLCardinality-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: 433/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 231 places, 202 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 320 transition conflict sets
lola: TASK
lola: reading formula from ParamProductionCell-PT-3-LTLCardinality.task
lola: read: A(crane_above_feed_belt <= PL_out U (A1U_ret_run <= A1U_in U 2 <= CU_unloaded)) : A(X (F (belt2_stop <= belt1_light_barrier_false)) U X (G (3 <= A2L_in))) : AF (G (G (X (arm1_release_angle <= FB_trans_run)))) : AG (1 <= A1U_ext_rs) : AG (X (DB_trans_run <= PU_out)) : AG (F (G (G (2 <= forge_run)))) : AG (3 <= crane_storing) : AG (X (F (F (3 <= arm2_store_free)))) : AX ((X (PL_lower_run <= ch_CF_fu... (shortened)
lola: formula length: 706
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-PL_out + crane_above_feed_belt <= 0 U (A1U_ret_run + -A1U_in <= 0 U -CU_unloaded <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((F (belt2_stop + -belt1_light_barrier_false <= 0) U G (-A2L_in <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (X (arm1_release_angle + -FB_trans_run <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-A1U_ext_rs <= -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (DB_trans_run + -PU_out <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (-forge_run <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-crane_storing <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F (-arm2_store_free <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((X (PL_lower_run + -ch_CF_full <= 0) U G (-FB_deliver_run <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((F (-TU_out <= -1) U G (-A2U_rot1_rs <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ch_CF_free <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ParamProductionCell-PT-3-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-crane_mag_off <= -2 U PL_in + -A2U_rot3_run <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (crane_lower + -CU_out <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((A2U_in + -A2L_rotated <= 0 U X (-A1L_rot1_run <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ch_A2D_free + press_at_middle_pos <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ParamProductionCell-PT-3-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A2L_rot3_in + -A2U_ret_run <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ParamProductionCell-PT-3-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: no no no no no no no no no no no yes no no yes yes
lola: ========================================

BK_STOP 1463680406866

--------------------
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="ParamProductionCell-PT-3"
export BK_EXAMINATION="LTLCardinality"
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/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ParamProductionCell-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074kn-smll-146363811000167"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;