fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r186kn-smll-146444131800083
Last Updated
June 30, 2016

About the Execution of Tapaal(SEQ) for S_QuasiCertifProtocol-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2658.490 885333.00 884989.00 49.90 7 49 7 7 7 49 7 7 7 7 1 7 7 1 7 7 normal

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 tapaalSEQ
Input is S_QuasiCertifProtocol-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r186kn-smll-146444131800083
=====================================================================


--------------------
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-06-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1464538957323

---> tapaalSEQ --- TAPAAL Sequential

*******************************************
* TAPAAL Sequential verifying UpperBounds *
*******************************************

timeout 60 verifypn -n -d -r 1 -s DFS -x 1 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-0: place-bound EF ("n2_6" < 0) and ("n2_5" < 0) and ("n2_4" < 0) and ("n2_3" < 0) and ("n2_2" < 0) and ("n2_1" < 0) and ("n2_0" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-0 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n2_6, n2_5, n2_4, n2_3, n2_2, n2_1 and n2_0: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 2 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-1: place-bound EF ("n9_2_0" < 0) and ("n9_1_0" < 0) and ("n9_0_0" < 0) and ("n9_0_1" < 0) and ("n9_1_1" < 0) and ("n9_2_1" < 0) and ("n9_3_1" < 0) and ("n9_3_0" < 0) and ("n9_4_0" < 0) and ("n9_5_0" < 0) and ("n9_6_0" < 0) and ("n9_1_2" < 0) and ("n9_2_2" < 0) and ("n9_3_2" < 0) and ("n9_4_2" < 0) and ("n9_4_1" < 0) and ("n9_5_1" < 0) and ("n9_6_1" < 0) and ("n9_0_2" < 0) and ("n9_3_3" < 0) and ("n9_2_3" < 0) and ("n9_5_3" < 0) and ("n9_4_3" < 0) and ("n9_6_2" < 0) and ("n9_5_2" < 0) and ("n9_1_3" < 0) and ("n9_0_3" < 0) and ("n9_4_4" < 0) and ("n9_3_4" < 0) and ("n9_6_4" < 0) and ("n9_5_4" < 0) and ("n9_0_4" < 0) and ("n9_6_3" < 0) and ("n9_2_4" < 0) and ("n9_1_4" < 0) and ("n9_6_5" < 0) and ("n9_0_6" < 0) and ("n9_4_5" < 0) and ("n9_5_5" < 0) and ("n9_2_5" < 0) and ("n9_3_5" < 0) and ("n9_0_5" < 0) and ("n9_1_5" < 0) and ("n9_5_6" < 0) and ("n9_6_6" < 0) and ("n9_3_6" < 0) and ("n9_4_6" < 0) and ("n9_1_6" < 0) and ("n9_2_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-1 49 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n9_2_0, n9_1_0, n9_0_0, n9_0_1, n9_1_1, n9_2_1, n9_3_1, n9_3_0, n9_4_0, n9_5_0, n9_6_0, n9_1_2, n9_2_2, n9_3_2, n9_4_2, n9_4_1, n9_5_1, n9_6_1, n9_0_2, n9_3_3, n9_2_3, n9_5_3, n9_4_3, n9_6_2, n9_5_2, n9_1_3, n9_0_3, n9_4_4, n9_3_4, n9_6_4, n9_5_4, n9_0_4, n9_6_3, n9_2_4, n9_1_4, n9_6_5, n9_0_6, n9_4_5, n9_5_5, n9_2_5, n9_3_5, n9_0_5, n9_1_5, n9_5_6, n9_6_6, n9_3_6, n9_4_6, n9_1_6 and n9_2_6: 49


timeout 60 verifypn -n -d -r 1 -s DFS -x 3 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-2: place-bound EF ("c1_0" < 0) and ("c1_1" < 0) and ("c1_2" < 0) and ("c1_3" < 0) and ("c1_4" < 0) and ("c1_5" < 0) and ("c1_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-2 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places c1_0, c1_1, c1_2, c1_3, c1_4, c1_5 and c1_6: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 4 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-3: place-bound EF ("s3_0" < 0) and ("s3_1" < 0) and ("s3_4" < 0) and ("s3_5" < 0) and ("s3_2" < 0) and ("s3_3" < 0) and ("s3_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-3 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places s3_0, s3_1, s3_4, s3_5, s3_2, s3_3 and s3_6: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 5 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-4: place-bound EF "a1" < 0

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in place a1: 1


timeout 60 verifypn -n -d -r 1 -s DFS -x 6 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-5: place-bound EF ("n4_5" < 0) and ("n4_6" < 0) and ("n4_3" < 0) and ("n4_4" < 0) and ("n4_1" < 0) and ("n4_2" < 0) and ("n4_0" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-5 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n4_5, n4_6, n4_3, n4_4, n4_1, n4_2 and n4_0: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 7 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-6: place-bound EF ("n2_6" < 0) and ("n2_5" < 0) and ("n2_4" < 0) and ("n2_3" < 0) and ("n2_2" < 0) and ("n2_1" < 0) and ("n2_0" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-6 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n2_6, n2_5, n2_4, n2_3, n2_2, n2_1 and n2_0: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 8 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-7: place-bound EF "a5" < 0

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in place a5: 1


timeout 60 verifypn -n -d -r 1 -s DFS -x 9 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-8: place-bound EF ("s2_1" < 0) and ("s2_2" < 0) and ("s2_0" < 0) and ("s2_5" < 0) and ("s2_6" < 0) and ("s2_3" < 0) and ("s2_4" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-8 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places s2_1, s2_2, s2_0, s2_5, s2_6, s2_3 and s2_4: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 10 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-9: place-bound EF ("s5_1" < 0) and ("s5_0" < 0) and ("s5_3" < 0) and ("s5_2" < 0) and ("s5_5" < 0) and ("s5_4" < 0) and ("s5_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-9 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places s5_1, s5_0, s5_3, s5_2, s5_5, s5_4 and s5_6: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 11 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-10: place-bound EF ("s4_0" < 0) and ("s4_2" < 0) and ("s4_1" < 0) and ("s4_4" < 0) and ("s4_3" < 0) and ("s4_5" < 0) and ("s4_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places s4_0, s4_2, s4_1, s4_4, s4_3, s4_5 and s4_6: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 12 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-11: place-bound EF ("s2_1" < 0) and ("s2_2" < 0) and ("s2_0" < 0) and ("s2_5" < 0) and ("s2_6" < 0) and ("s2_3" < 0) and ("s2_4" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places s2_1, s2_2, s2_0, s2_5, s2_6, s2_3 and s2_4: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 13 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-12: place-bound EF ("CstopOK_0" < 0) and ("CstopOK_1" < 0) and ("CstopOK_6" < 0) and ("CstopOK_5" < 0) and ("CstopOK_4" < 0) and ("CstopOK_3" < 0) and ("CstopOK_2" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places CstopOK_0, CstopOK_1, CstopOK_6, CstopOK_5, CstopOK_4, CstopOK_3 and CstopOK_2: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 14 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-13: place-bound EF ("n7_2_0" < 0) and ("n7_1_0" < 0) and ("n7_0_0" < 0) and ("n7_3_1" < 0) and ("n7_2_1" < 0) and ("n7_1_1" < 0) and ("n7_0_1" < 0) and ("n7_6_0" < 0) and ("n7_5_0" < 0) and ("n7_4_0" < 0) and ("n7_3_0" < 0) and ("n7_6_2" < 0) and ("n7_5_2" < 0) and ("n7_1_3" < 0) and ("n7_0_3" < 0) and ("n7_3_3" < 0) and ("n7_2_3" < 0) and ("n7_5_3" < 0) and ("n7_4_3" < 0) and ("n7_5_1" < 0) and ("n7_4_1" < 0) and ("n7_0_2" < 0) and ("n7_6_1" < 0) and ("n7_2_2" < 0) and ("n7_1_2" < 0) and ("n7_4_2" < 0) and ("n7_3_2" < 0) and ("n7_0_5" < 0) and ("n7_1_5" < 0) and ("n7_2_5" < 0) and ("n7_3_5" < 0) and ("n7_4_5" < 0) and ("n7_5_5" < 0) and ("n7_6_5" < 0) and ("n7_0_6" < 0) and ("n7_6_3" < 0) and ("n7_0_4" < 0) and ("n7_1_4" < 0) and ("n7_2_4" < 0) and ("n7_3_4" < 0) and ("n7_4_4" < 0) and ("n7_5_4" < 0) and ("n7_6_4" < 0) and ("n7_4_6" < 0) and ("n7_3_6" < 0) and ("n7_2_6" < 0) and ("n7_1_6" < 0) and ("n7_6_6" < 0) and ("n7_5_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 49 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n7_2_0, n7_1_0, n7_0_0, n7_3_1, n7_2_1, n7_1_1, n7_0_1, n7_6_0, n7_5_0, n7_4_0, n7_3_0, n7_6_2, n7_5_2, n7_1_3, n7_0_3, n7_3_3, n7_2_3, n7_5_3, n7_4_3, n7_5_1, n7_4_1, n7_0_2, n7_6_1, n7_2_2, n7_1_2, n7_4_2, n7_3_2, n7_0_5, n7_1_5, n7_2_5, n7_3_5, n7_4_5, n7_5_5, n7_6_5, n7_0_6, n7_6_3, n7_0_4, n7_1_4, n7_2_4, n7_3_4, n7_4_4, n7_5_4, n7_6_4, n7_4_6, n7_3_6, n7_2_6, n7_1_6, n7_6_6 and n7_5_6: 49


timeout 60 verifypn -n -d -r 1 -s DFS -x 15 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-14: place-bound EF ("SstopOK_2" < 0) and ("SstopOK_3" < 0) and ("SstopOK_0" < 0) and ("SstopOK_1" < 0) and ("SstopOK_6" < 0) and ("SstopOK_4" < 0) and ("SstopOK_5" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places SstopOK_2, SstopOK_3, SstopOK_0, SstopOK_1, SstopOK_6, SstopOK_4 and SstopOK_5: 7


timeout 60 verifypn -n -d -r 1 -s DFS -x 16 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-15: place-bound EF ("n5_4" < 0) and ("n5_5" < 0) and ("n5_2" < 0) and ("n5_3" < 0) and ("n5_0" < 0) and ("n5_1" < 0) and ("n5_6" < 0)

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places n5_4, n5_5, n5_2, n5_3, n5_0, n5_1 and n5_6: 7


timeout 7200 verifypn -n -d -r 1 -s BFS -x 5 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-4: place-bound EF "a1" < 0

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in place a1: 1


timeout 7200 verifypn -n -d -r 1 -s BFS -x 8 model.pnml UpperBounds.xml
QuasiCertifProtocol-COL-06-UpperBounds-7: place-bound EF "a5" < 0

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in place a5: 1


BK_STOP 1464539842656

--------------------
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="S_QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="tapaalSEQ"
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/S_QuasiCertifProtocol-PT-06.tgz
mv S_QuasiCertifProtocol-PT-06 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool tapaalSEQ"
echo " Input is S_QuasiCertifProtocol-PT-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r186kn-smll-146444131800083"
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 ;