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.r199-smll-167840345500093.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 lolaxred
Input is GPUForwardProgress-PT-24b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345500093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:15 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 122K 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-24b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678473102339

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 18:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 18:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:31:46] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-10 18:31:46] [INFO ] Transformed 492 places.
[2023-03-10 18:31:46] [INFO ] Transformed 517 transitions.
[2023-03-10 18:31:46] [INFO ] Found NUPN structural information;
[2023-03-10 18:31:46] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 517 rows 492 cols
[2023-03-10 18:31:46] [INFO ] Computed 26 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :9
FORMULA GPUForwardProgress-PT-24b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 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 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 5 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 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2023-03-10 18:31:46] [INFO ] Invariant cache hit.
[2023-03-10 18:31:46] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-10 18:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:47] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-10 18:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:31:47] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 41 ms returned sat
[2023-03-10 18:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:48] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2023-03-10 18:31:48] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 88 ms.
[2023-03-10 18:31:52] [INFO ] Added : 329 causal constraints over 66 iterations in 4186 ms. Result :unknown
[2023-03-10 18:31:52] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-10 18:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:53] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-10 18:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:31:53] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-10 18:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:53] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-10 18:31:53] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 66 ms.
[2023-03-10 18:31:55] [INFO ] Added : 162 causal constraints over 33 iterations in 1809 ms. Result :sat
Minimization took 172 ms.
[2023-03-10 18:31:56] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-10 18:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:56] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-10 18:31:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:31:56] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-10 18:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:57] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-10 18:31:57] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 62 ms.
[2023-03-10 18:31:58] [INFO ] Added : 116 causal constraints over 24 iterations in 1376 ms. Result :sat
Minimization took 149 ms.
[2023-03-10 18:31:58] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-10 18:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:59] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-10 18:31:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:31:59] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 44 ms returned sat
[2023-03-10 18:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:59] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-10 18:31:59] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 61 ms.
[2023-03-10 18:32:01] [INFO ] Added : 125 causal constraints over 25 iterations in 1376 ms. Result :sat
Minimization took 134 ms.
[2023-03-10 18:32:01] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-10 18:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:02] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-10 18:32:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:32:02] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 37 ms returned sat
[2023-03-10 18:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:02] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-10 18:32:02] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 59 ms.
[2023-03-10 18:32:04] [INFO ] Added : 125 causal constraints over 25 iterations in 1391 ms. Result :sat
Minimization took 160 ms.
[2023-03-10 18:32:04] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-10 18:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:04] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-10 18:32:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:32:05] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-10 18:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:05] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-10 18:32:05] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 54 ms.
[2023-03-10 18:32:07] [INFO ] Added : 193 causal constraints over 39 iterations in 2110 ms. Result :sat
Minimization took 173 ms.
[2023-03-10 18:32:07] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 33 ms returned sat
[2023-03-10 18:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:08] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-10 18:32:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:32:08] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-10 18:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:08] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-10 18:32:08] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 59 ms.
[2023-03-10 18:32:10] [INFO ] Added : 114 causal constraints over 23 iterations in 1235 ms. Result :sat
Minimization took 123 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-24b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 517/517 transitions.
Graph (trivial) has 438 edges and 492 vertex of which 7 / 492 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 485 transition count 234
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 299 rules applied. Total rules applied 576 place count 210 transition count 210
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 579 place count 209 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 581 place count 207 transition count 208
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 581 place count 207 transition count 160
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 677 place count 159 transition count 160
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 680 place count 156 transition count 157
Iterating global reduction 4 with 3 rules applied. Total rules applied 683 place count 156 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 683 place count 156 transition count 156
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 685 place count 155 transition count 156
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 827 place count 84 transition count 85
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 849 place count 84 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 853 place count 82 transition count 63
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 857 place count 82 transition count 59
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 859 place count 82 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 861 place count 80 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 79 transition count 56
Applied a total of 862 rules in 219 ms. Remains 79 /492 variables (removed 413) and now considering 56/517 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 79/492 places, 56/517 transitions.
// Phase 1: matrix 56 rows 79 cols
[2023-03-10 18:32:10] [INFO ] Computed 25 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12044 resets, run finished after 3109 ms. (steps per millisecond=321 ) properties (out of 3) seen :3
FORMULA GPUForwardProgress-PT-24b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 28146 ms.
ITS solved all properties within timeout

BK_STOP 1678473135065

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-24b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is GPUForwardProgress-PT-24b, 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 r199-smll-167840345500093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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