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)
..................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.3K May 30 21:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 30 21:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 09:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 17K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool gspn
Input is DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r277-csrt-152749165100182
=====================================================================

--------------------
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 DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527758872656

----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2018
----------------------------------------------------------------------

Running DoubleExponent (PT), instance 001

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 57
TRANSITIONS: 48
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2018, University of Torino, Italy.

Based on MEDDLY version 0.15.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 445
MODEL NAME: /home/mcc/execution/model
57 places, 48 transitions.
Enabling coverability test.

Setting MEDDLY cache to 67108864 entries.
Convergence in 68 steps.
Convergence in 42 steps.
FORMULA DoubleExponent-PT-001-UpperBounds-00 4 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-13 2 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS SEQUENTIAL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
----------------------------------------------------------------------

BK_STOP 1527758873499

--------------------
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="DoubleExponent-PT-001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gspn"
export BK_RESULT_DIR="/tmp/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/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool gspn"
echo " Input is DoubleExponent-PT-001, 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 r277-csrt-152749165100182"
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 ;