fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772500757
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Diffusion2D-PT-D20N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1109.720 31708.00 43881.00 76.10 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 05:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 05:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652648727737

Running Version 202205111006
[2022-05-15 21:05:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:05:29] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-05-15 21:05:29] [INFO ] Transformed 400 places.
[2022-05-15 21:05:29] [INFO ] Transformed 2964 transitions.
[2022-05-15 21:05:29] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 288 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2964 rows 400 cols
[2022-05-15 21:05:29] [INFO ] Computed 1 place invariants in 49 ms
Incomplete random walk after 10016 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1252 ) properties (out of 16) seen :249
FORMULA Diffusion2D-PT-D20N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) 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 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) 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 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) 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 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :4
// Phase 1: matrix 2964 rows 400 cols
[2022-05-15 21:05:29] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 21:05:29] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-15 21:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:29] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-05-15 21:05:30] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 198 ms.
Minimization took 220 ms.
[2022-05-15 21:05:30] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:31] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2022-05-15 21:05:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:31] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-05-15 21:05:31] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 164 ms.
Minimization took 234 ms.
[2022-05-15 21:05:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:32] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-15 21:05:32] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 163 ms.
Minimization took 217 ms.
[2022-05-15 21:05:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:33] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-05-15 21:05:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:34] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2022-05-15 21:05:34] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 147 ms.
Minimization took 187 ms.
[2022-05-15 21:05:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:35] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-05-15 21:05:35] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 152 ms.
Minimization took 185 ms.
[2022-05-15 21:05:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:36] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-05-15 21:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:36] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2022-05-15 21:05:36] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 153 ms.
Minimization took 173 ms.
[2022-05-15 21:05:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:37] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-05-15 21:05:37] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 169 ms.
Minimization took 235 ms.
[2022-05-15 21:05:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:38] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2022-05-15 21:05:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:39] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-05-15 21:05:39] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 155 ms.
Minimization took 215 ms.
[2022-05-15 21:05:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:39] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2022-05-15 21:05:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:40] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-05-15 21:05:40] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 166 ms.
Minimization took 210 ms.
[2022-05-15 21:05:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:41] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-05-15 21:05:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:41] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2022-05-15 21:05:42] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 139 ms.
Minimization took 221 ms.
[2022-05-15 21:05:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:42] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-15 21:05:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:05:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-15 21:05:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:43] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2022-05-15 21:05:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 188 ms.
Minimization took 215 ms.
[2022-05-15 21:05:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 21:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:05:44] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2022-05-15 21:05:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 292 ms.
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[2, 0, 9, 0, 5, 0, 1, 0, 0, 49, 0, 2]
FORMULA Diffusion2D-PT-D20N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 30563 ms.

BK_STOP 1652648759445

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D20N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D20N050, 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 r060-tall-165254772500757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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