Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:33 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-03-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541164965

Running Version 0
[2022-05-14 15:12:46] [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]
[2022-05-14 15:12:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:12:46] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-14 15:12:46] [INFO ] Transformed 274 places.
[2022-05-14 15:12:46] [INFO ] Transformed 237 transitions.
[2022-05-14 15:12:46] [INFO ] Found NUPN structural information;
[2022-05-14 15:12:46] [INFO ] Parsed PT model containing 274 places and 237 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
// Phase 1: matrix 236 rows 273 cols
[2022-05-14 15:12:46] [INFO ] Computed 43 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :2
FORMULA BusinessProcesses-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :1
FORMULA BusinessProcesses-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :7
FORMULA BusinessProcesses-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 236 rows 273 cols
[2022-05-14 15:12:46] [INFO ] Computed 43 place invariants in 6 ms
[2022-05-14 15:12:47] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-14 15:12:47] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2022-05-14 15:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:47] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-14 15:12:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:12:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-14 15:12:47] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-14 15:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:47] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 5 ms to minimize.
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-05-14 15:12:47] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2022-05-14 15:12:48] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2022-05-14 15:12:49] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 2601 ms
[2022-05-14 15:12:49] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 19 ms.
[2022-05-14 15:12:50] [INFO ] Added : 142 causal constraints over 29 iterations in 592 ms. Result :sat
Minimization took 49 ms.
[2022-05-14 15:12:50] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-14 15:12:50] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-14 15:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-14 15:12:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:12:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2022-05-14 15:12:50] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 602 ms
[2022-05-14 15:12:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:12:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-14 15:12:51] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2022-05-14 15:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 9 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2022-05-14 15:12:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2022-05-14 15:12:51] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 14 ms.
[2022-05-14 15:12:52] [INFO ] Added : 112 causal constraints over 23 iterations in 396 ms. Result :sat
Minimization took 35 ms.
[2022-05-14 15:12:52] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-14 15:12:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-14 15:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:52] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-14 15:12:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:12:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-14 15:12:52] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-14 15:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:12:52] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:12:52] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:12:53] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:12:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 654 ms
[2022-05-14 15:12:53] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 11 ms.
[2022-05-14 15:12:53] [INFO ] Added : 119 causal constraints over 24 iterations in 384 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 12500 steps, including 107 resets, run finished after 29 ms. (steps per millisecond=431 ) properties (out of 3) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10800 steps, including 103 resets, run finished after 42 ms. (steps per millisecond=257 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 111 resets, run finished after 22 ms. (steps per millisecond=609 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541174563

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BusinessProcesses-PT-03, 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 r028-tall-165251936100127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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