Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r223-smll-167840362200008.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is GPUForwardProgress-PT-16b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362200008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 84K 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 GPUForwardProgress-PT-16b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578398871

Running Version 202205111006
[2023-03-11 23:46:41] [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-11 23:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:46:41] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-11 23:46:41] [INFO ] Transformed 340 places.
[2023-03-11 23:46:41] [INFO ] Transformed 357 transitions.
[2023-03-11 23:46:41] [INFO ] Found NUPN structural information;
[2023-03-11 23:46:41] [INFO ] Parsed PT model containing 340 places and 357 transitions in 372 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 357 rows 340 cols
[2023-03-11 23:46:41] [INFO ] Computed 18 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :9
FORMULA GPUForwardProgress-PT-16b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
// Phase 1: matrix 357 rows 340 cols
[2023-03-11 23:46:41] [INFO ] Computed 18 place invariants in 9 ms
[2023-03-11 23:46:42] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 43 ms returned sat
[2023-03-11 23:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:42] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-11 23:46:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:42] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-11 23:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:43] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-11 23:46:43] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 49 ms.
[2023-03-11 23:46:45] [INFO ] Added : 250 causal constraints over 52 iterations in 1947 ms. Result :sat
Minimization took 127 ms.
[2023-03-11 23:46:45] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:45] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-11 23:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:45] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-11 23:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:45] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-11 23:46:45] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 40 ms.
[2023-03-11 23:46:46] [INFO ] Added : 108 causal constraints over 22 iterations in 783 ms. Result :sat
Minimization took 74 ms.
[2023-03-11 23:46:46] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:47] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-11 23:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:47] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-11 23:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:47] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-11 23:46:47] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 37 ms.
[2023-03-11 23:46:47] [INFO ] Added : 94 causal constraints over 19 iterations in 586 ms. Result :sat
Minimization took 71 ms.
[2023-03-11 23:46:48] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:48] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-11 23:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:48] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-11 23:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:48] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-11 23:46:48] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 44 ms.
[2023-03-11 23:46:49] [INFO ] Added : 161 causal constraints over 33 iterations in 1096 ms. Result :sat
Minimization took 83 ms.
[2023-03-11 23:46:49] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-11 23:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:50] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-11 23:46:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:50] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-11 23:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:50] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-11 23:46:50] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 34 ms.
[2023-03-11 23:46:51] [INFO ] Added : 91 causal constraints over 19 iterations in 644 ms. Result :sat
Minimization took 62 ms.
[2023-03-11 23:46:51] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:51] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-11 23:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:51] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-11 23:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:51] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-11 23:46:51] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 32 ms.
[2023-03-11 23:46:52] [INFO ] Added : 92 causal constraints over 19 iterations in 601 ms. Result :sat
Minimization took 59 ms.
[2023-03-11 23:46:52] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:52] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-11 23:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:52] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-11 23:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:53] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-11 23:46:53] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 31 ms.
[2023-03-11 23:46:54] [INFO ] Added : 149 causal constraints over 32 iterations in 959 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-16b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 340 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 340/340 places, 356/356 transitions.
Graph (trivial) has 304 edges and 340 vertex of which 7 / 340 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 503 edges and 334 vertex of which 313 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.9 ms
Discarding 21 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 312 transition count 152
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 403 place count 122 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 404 place count 121 transition count 134
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 404 place count 121 transition count 102
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 468 place count 89 transition count 102
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 486 place count 71 transition count 84
Iterating global reduction 3 with 18 rules applied. Total rules applied 504 place count 71 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 504 place count 71 transition count 82
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 508 place count 69 transition count 82
Graph (complete) has 130 edges and 69 vertex of which 22 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 523 place count 22 transition count 22
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 553 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 558 place count 5 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 559 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 560 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 562 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 562 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 564 place count 2 transition count 1
Applied a total of 564 rules in 72 ms. Remains 2 /340 variables (removed 338) and now considering 1/356 (removed 355) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/340 places, 1/356 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 23:46:54] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-16b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13727 ms.

BK_STOP 1678578414863

--------------------
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="GPUForwardProgress-PT-16b"
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 GPUForwardProgress-PT-16b, 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 r223-smll-167840362200008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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