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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 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 199K 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-40b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678555585151

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 17:26:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 17:26:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:26:29] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-11 17:26:29] [INFO ] Transformed 796 places.
[2023-03-11 17:26:29] [INFO ] Transformed 837 transitions.
[2023-03-11 17:26:29] [INFO ] Found NUPN structural information;
[2023-03-11 17:26:29] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
FORMULA GPUForwardProgress-PT-40b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 837 rows 796 cols
[2023-03-11 17:26:29] [INFO ] Computed 42 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 29 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 15) seen :11
FORMULA GPUForwardProgress-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
[2023-03-11 17:26:29] [INFO ] Invariant cache hit.
[2023-03-11 17:26:30] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 58 ms returned sat
[2023-03-11 17:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:30] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-11 17:26:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:26:31] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 65 ms returned sat
[2023-03-11 17:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:31] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-11 17:26:32] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 88 ms.
[2023-03-11 17:26:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:26:36] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 59 ms returned sat
[2023-03-11 17:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:36] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-11 17:26:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:26:37] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 54 ms returned sat
[2023-03-11 17:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:37] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2023-03-11 17:26:37] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 93 ms.
[2023-03-11 17:26:41] [INFO ] Added : 197 causal constraints over 40 iterations in 3425 ms. Result :sat
Minimization took 283 ms.
[2023-03-11 17:26:41] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 42 ms returned sat
[2023-03-11 17:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:42] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-11 17:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:26:42] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 64 ms returned sat
[2023-03-11 17:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:43] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2023-03-11 17:26:43] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 91 ms.
[2023-03-11 17:26:47] [INFO ] Added : 238 causal constraints over 48 iterations in 3756 ms. Result :sat
Minimization took 268 ms.
[2023-03-11 17:26:47] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 42 ms returned sat
[2023-03-11 17:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:48] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-11 17:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:26:48] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 62 ms returned sat
[2023-03-11 17:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:26:49] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-11 17:26:49] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 78 ms.
[2023-03-11 17:26:52] [INFO ] Added : 191 causal constraints over 39 iterations in 3041 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 796 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 835/835 transitions.
Graph (trivial) has 710 edges and 796 vertex of which 7 / 796 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1198 edges and 790 vertex of which 745 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.5 ms
Discarding 45 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 452 transitions
Trivial Post-agglo rules discarded 452 transitions
Performed 452 trivial Post agglomeration. Transition count delta: 452
Iterating post reduction 0 with 456 rules applied. Total rules applied 458 place count 743 transition count 368
Reduce places removed 453 places and 1 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 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 494 rules applied. Total rules applied 952 place count 290 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 953 place count 289 transition count 326
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 953 place count 289 transition count 247
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 1111 place count 210 transition count 247
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1154 place count 167 transition count 204
Iterating global reduction 3 with 43 rules applied. Total rules applied 1197 place count 167 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1198 place count 167 transition count 203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1198 place count 167 transition count 200
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1204 place count 164 transition count 200
Graph (complete) has 320 edges and 164 vertex of which 17 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 146 output transitions
Drop transitions removed 146 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 10 rules applied. Total rules applied 1214 place count 17 transition count 45
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 1263 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1263 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1265 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1268 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 1269 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 1270 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 1270 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 1272 place count 2 transition count 1
Applied a total of 1272 rules in 171 ms. Remains 2 /796 variables (removed 794) and now considering 1/835 (removed 834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 2/796 places, 1/835 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 17:26:53] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 24824 ms.
ITS solved all properties within timeout

BK_STOP 1678555614745

--------------------
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-40b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is GPUForwardProgress-PT-40b, 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 r203-smll-167840349200157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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