Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r080-smll-158922977000437.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gspn
Input is GPPP-PT-C0001N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r080-smll-158922977000437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 model.pnml

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

=== Now, execution of the tool begins

BK_START 1589767706574

----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2020
----------------------------------------------------------------------

Running GPPP (PT), instance C0001N0000000100

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


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


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

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

Process ID: 423
MODEL NAME: /home/mcc/execution/model
33 places, 22 transitions.

Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-00 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-02 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-04 100 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-05 200 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-08 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-06 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-09 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-10 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-11 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-15 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Split: SplitSubtract
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1589767708406

--------------------
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="GPPP-PT-C0001N0000000100"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gspn"
echo " Input is GPPP-PT-C0001N0000000100, 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 r080-smll-158922977000437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;