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 QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300119
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1463709903707

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ QuasiCertifProtocol-PT-28
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-2 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-3 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-6 16 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-7 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-9 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-10 1 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-15 CANNOT_COMPUTE
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: 3444/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 2998 places, 446 transitions, 445 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 591 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-28-UpperBounds.task
lola: read: MAX(n3_0 + n3_1 + n3_6 + n3_7 + n3_8 + n3_9 + n3_2 + n3_3 + n3_4 + n3_5 + n3_15 + n3_14 + n3_17 + n3_16 + n3_11 + n3_10 + n3_13 + n3_12 + n3_23 + n3_22 + n3_25 + n3_24 + n3_19 + n3_18 + n3_21 + n3_20 + n3_28 + n3_26 + n3_27 - 0) : MAX(n9_5_0 + n9_6_0 + n9_7_0 + n9_8_0 + n9_1_0 + n9_2_0 + n9_3_0 + n9_4_0 + n9_0_0 + n9_24_0 + n9_23_0 + n9_22_0 + n9_21_0 + n9_20_0 + n9_19_0 + n9_18_0 + n9_17_0 + n9_1... (shortened)
lola: formula length: 19278
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n3_28 + n3_27 + n3_26 + n3_25 + n3_24 + n3_23 + n3_22 + n3_21 + n3_20 + n3_19 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_2_28 + n9_2_27 + n9_2_26 + n9_2_25 + n9_2_24 + n9_2_23 + n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_26_28 + n9_26_27 + n9_26_26 + n9_26_25 + n9_26_24 + n9_26_23 + n9_26_22 + n9_26_21 + n9_26_20 + n9_26_19 + n9_26_18 + n9_26_17 + n9_26_16 + n9_26_15 + n9_26_14 + n9_26_13 + n9_26_12 + n9_26_11 + n9_26_10... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n4_9 + n4_8 + n4_7 + n4_6 + n4_5 + n4_4 + n4_3 + n4_2 + n4_1 + n4_0 + n4_28 + n4_27 + n4_26 + n4_25 + n4_24 + n4_23 + n4_22 + n4_21 + n4_20 + n4_19 + n4_18 + n4_17 + n4_16 + n4_15 + n4_14 + n4_13 + n4_12 + n4_11 + n4_10 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + n2_10 + n2_11 + n2_12 + n2_13 + n2_14 + n2_15 + n2_16 + n2_17 + n2_18 + n2_19 + n2_20 + n2_21 + n2_22 + n2_23 + n2_24 + n2_25 + n2_26 + n2_27 + n2_28 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(malicious_reservoir - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 16
lola: The maximum value of the given expression is 16
lola: ========================================
lola: subprocess 7 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_9_28 + n7_9_27 + n7_9_26 + n7_9_25 + n7_9_24 + n7_9_23 + n7_9_22 + n7_9_21 + n7_9_20 + n7_9_19 + n7_9_18 + n7_9_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CstopOK_28 + CstopOK_27 + CstopOK_26 + CstopOK_25 + CstopOK_24 + CstopOK_23 + CstopOK_22 + CstopOK_21 + CstopOK_20 + CstopOK_19 + CstopOK_18 + CstopOK_17 + CstopOK_16 + CstopOK_15 + CstopOK_14 + CstopOK_13 + CstopOK_12 + CstopOK_11 + CstopOK_10 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_28 + n5_27 + n5_26 + n5_25 + n5_24 + n5_23 + n5_22 + n5_21 + n5_20 + n5_19 + n5_18 + n5_17 + n5_16 + n5_15 + n5_14 + n5_13 + n5_12 + n5_11 + n5_10 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Astart - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + n6_19 + n6_20 + n6_21 + n6_22 + n6_23 + n6_24 + n6_25 + n6_26 + n6_27 + n6_28 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s2_10 + s2_11 + s2_12 + s2_13 + s2_14 + s2_15 + s2_16 + s2_17 + s2_18 + s2_19 + s2_20 + s2_21 + s2_22 + s2_23 + s2_24 + s2_25 + s2_26 + s2_27 + s2_28 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s2_7 + s2_8 + s2_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown unknown unknown unknown unknown unknown 16 unknown unknown unknown 1 unknown unknown unknown unknown unknown

BK_STOP 1463713443655

--------------------
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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
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/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 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 QuasiCertifProtocol-PT-28, examination is UpperBounds"
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-146369140300119"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;