Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600065.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BusinessProcesses-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 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 BusinessProcesses-PT-09-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678933629304

Running Version 202205111006
[2023-03-16 02:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 02:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:27:10] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-16 02:27:10] [INFO ] Transformed 403 places.
[2023-03-16 02:27:10] [INFO ] Transformed 374 transitions.
[2023-03-16 02:27:10] [INFO ] Found NUPN structural information;
[2023-03-16 02:27:10] [INFO ] Parsed PT model containing 403 places and 374 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 374 rows 403 cols
[2023-03-16 02:27:10] [INFO ] Computed 65 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 103 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
// Phase 1: matrix 374 rows 403 cols
[2023-03-16 02:27:10] [INFO ] Computed 65 place invariants in 8 ms
[2023-03-16 02:27:11] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-16 02:27:11] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-16 02:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:11] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-16 02:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-16 02:27:11] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-16 02:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:11] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 13 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 576 ms
[2023-03-16 02:27:12] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 32 ms.
[2023-03-16 02:27:13] [INFO ] Added : 205 causal constraints over 41 iterations in 1003 ms. Result :sat
Minimization took 71 ms.
[2023-03-16 02:27:13] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-16 02:27:13] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-16 02:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:13] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-16 02:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-16 02:27:13] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-16 02:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:13] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 5 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 0 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 0 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 0 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 4 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 0 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3540 ms
[2023-03-16 02:27:17] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 28 ms.
[2023-03-16 02:27:17] [INFO ] Added : 167 causal constraints over 34 iterations in 707 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7629 ms.

BK_STOP 1678933638194

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BusinessProcesses-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool gold2022"
echo " Input is BusinessProcesses-PT-09, 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 r063-tajo-167813711600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 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 ;