fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r139-smll-167819422000157
Last Updated
May 14, 2023

About the Execution of Smart+red for Diffusion2D-PT-D20N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
625.691 34340.00 48724.00 483.70 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 normal

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.r139-smll-167819422000157.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 Diffusion2D-PT-D20N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819422000157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 04:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 04:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 04:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Diffusion2D-PT-D20N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678326324914

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=Diffusion2D-PT-D20N010
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 01:45:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 01:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:45:27] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2023-03-09 01:45:27] [INFO ] Transformed 400 places.
[2023-03-09 01:45:27] [INFO ] Transformed 2964 transitions.
[2023-03-09 01:45:27] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-09 01:45:28] [INFO ] Computed 1 place invariants in 73 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :64
FORMULA Diffusion2D-PT-D20N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :3
[2023-03-09 01:45:28] [INFO ] Invariant cache hit.
[2023-03-09 01:45:28] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 01:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:29] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2023-03-09 01:45:30] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 327 ms.
Minimization took 366 ms.
[2023-03-09 01:45:30] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:31] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-09 01:45:31] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 242 ms.
Minimization took 295 ms.
[2023-03-09 01:45:32] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:32] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2023-03-09 01:45:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:45:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:33] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2023-03-09 01:45:34] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 244 ms.
Minimization took 326 ms.
[2023-03-09 01:45:34] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:35] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2023-03-09 01:45:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:36] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-09 01:45:36] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 213 ms.
Minimization took 294 ms.
[2023-03-09 01:45:36] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:37] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2023-03-09 01:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:45:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-09 01:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:38] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2023-03-09 01:45:38] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 201 ms.
Minimization took 323 ms.
[2023-03-09 01:45:39] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:40] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-09 01:45:40] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 220 ms.
Minimization took 558 ms.
[2023-03-09 01:45:41] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:41] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-09 01:45:42] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 166 ms.
Minimization took 341 ms.
[2023-03-09 01:45:42] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:43] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2023-03-09 01:45:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 269 ms.
Minimization took 356 ms.
[2023-03-09 01:45:44] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:45] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-09 01:45:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 189 ms.
Minimization took 317 ms.
[2023-03-09 01:45:46] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-09 01:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:46] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2023-03-09 01:45:47] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 204 ms.
Minimization took 347 ms.
[2023-03-09 01:45:47] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:48] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-09 01:45:48] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 266 ms.
Minimization took 364 ms.
[2023-03-09 01:45:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:50] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-09 01:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:45:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:50] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2023-03-09 01:45:51] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 199 ms.
Minimization took 275 ms.
[2023-03-09 01:45:51] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:52] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2023-03-09 01:45:52] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 195 ms.
Minimization took 347 ms.
[2023-03-09 01:45:53] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:53] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2023-03-09 01:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:45:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:45:54] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2023-03-09 01:45:55] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 179 ms.
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[1, 1, 8, 9, 9, 1, 1, 1, 1, 1, 1, 0, 1, 9]
FORMULA Diffusion2D-PT-D20N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 30651 ms.
ITS solved all properties within timeout

BK_STOP 1678326359254

--------------------
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="Diffusion2D-PT-D20N010"
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 Diffusion2D-PT-D20N010, 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 r139-smll-167819422000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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