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-167813711600061.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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-05-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678933608326

Running Version 202205111006
[2023-03-16 02:26:49] [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:26:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:26:49] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-16 02:26:49] [INFO ] Transformed 368 places.
[2023-03-16 02:26:49] [INFO ] Transformed 319 transitions.
[2023-03-16 02:26:49] [INFO ] Found NUPN structural information;
[2023-03-16 02:26:49] [INFO ] Parsed PT model containing 368 places and 319 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
// Phase 1: matrix 318 rows 367 cols
[2023-03-16 02:26:49] [INFO ] Computed 57 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 94 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
// Phase 1: matrix 318 rows 367 cols
[2023-03-16 02:26:49] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-16 02:26:50] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2023-03-16 02:26:50] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-16 02:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:50] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-16 02:26:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:26:50] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-16 02:26:50] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-16 02:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:50] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 8 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-16 02:26:50] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2023-03-16 02:26:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-16 02:26:51] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2023-03-16 02:26:51] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2023-03-16 02:26:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-16 02:26:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 693 ms
[2023-03-16 02:26:51] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 18 ms.
[2023-03-16 02:26:51] [INFO ] Added : 172 causal constraints over 35 iterations in 575 ms. Result :sat
Minimization took 44 ms.
[2023-03-16 02:26:51] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-16 02:26:51] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-16 02:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:51] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-16 02:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:26:52] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-16 02:26:52] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-16 02:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:52] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 0 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 0 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2023-03-16 02:26:52] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2023-03-16 02:26:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1761 ms
[2023-03-16 02:26:53] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 19 ms.
[2023-03-16 02:26:54] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2023-03-16 02:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-16 02:26:54] [INFO ] Added : 230 causal constraints over 47 iterations in 942 ms. Result :sat
Minimization took 67 ms.
[2023-03-16 02:26:55] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-16 02:26:55] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-16 02:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:55] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-16 02:26:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:26:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-16 02:26:55] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-16 02:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:55] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2023-03-16 02:26:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 359 ms
[2023-03-16 02:26:55] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 19 ms.
[2023-03-16 02:26:56] [INFO ] Added : 212 causal constraints over 43 iterations in 835 ms. Result :sat
Minimization took 51 ms.
[2023-03-16 02:26:56] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-16 02:26:56] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-16 02:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-16 02:26:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:26:56] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-16 02:26:56] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-16 02:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:26:56] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 0 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 1 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2023-03-16 02:26:57] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 1 ms to minimize.
[2023-03-16 02:26:58] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2038 ms
[2023-03-16 02:26:58] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 16 ms.
[2023-03-16 02:26:59] [INFO ] Added : 183 causal constraints over 37 iterations in 632 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA BusinessProcesses-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 10384 ms.

BK_STOP 1678933619945

--------------------
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-05"
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-05, 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-167813711600061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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