fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689400525
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutoFlight-PT-96b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
943.359 57942.00 74048.00 262.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400525.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-96b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.2K Apr 30 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 AutoFlight-PT-96b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652665457329

Running Version 202205111006
[2022-05-16 01:44:19] [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-16 01:44:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:44:19] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2022-05-16 01:44:19] [INFO ] Transformed 7894 places.
[2022-05-16 01:44:19] [INFO ] Transformed 7868 transitions.
[2022-05-16 01:44:19] [INFO ] Found NUPN structural information;
[2022-05-16 01:44:19] [INFO ] Parsed PT model containing 7894 places and 7868 transitions in 728 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 7868 rows 7894 cols
[2022-05-16 01:44:20] [INFO ] Computed 514 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-96b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
// Phase 1: matrix 7868 rows 7894 cols
[2022-05-16 01:44:20] [INFO ] Computed 514 place invariants in 121 ms
[2022-05-16 01:44:23] [INFO ] [Real]Absence check using 513 positive place invariants in 670 ms returned sat
[2022-05-16 01:44:23] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 28 ms returned sat
[2022-05-16 01:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:25] [INFO ] [Real]Absence check using state equation in 2834 ms returned unknown
[2022-05-16 01:44:27] [INFO ] [Real]Absence check using 513 positive place invariants in 639 ms returned sat
[2022-05-16 01:44:27] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 22 ms returned sat
[2022-05-16 01:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:30] [INFO ] [Real]Absence check using state equation in 3075 ms returned unknown
[2022-05-16 01:44:32] [INFO ] [Real]Absence check using 513 positive place invariants in 600 ms returned sat
[2022-05-16 01:44:32] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 01:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:35] [INFO ] [Real]Absence check using state equation in 3289 ms returned unknown
[2022-05-16 01:44:37] [INFO ] [Real]Absence check using 513 positive place invariants in 595 ms returned sat
[2022-05-16 01:44:37] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 26 ms returned sat
[2022-05-16 01:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:41] [INFO ] [Real]Absence check using state equation in 3269 ms returned unknown
[2022-05-16 01:44:42] [INFO ] [Real]Absence check using 513 positive place invariants in 618 ms returned sat
[2022-05-16 01:44:42] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 10 ms returned sat
[2022-05-16 01:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:46] [INFO ] [Real]Absence check using state equation in 3236 ms returned unknown
[2022-05-16 01:44:47] [INFO ] [Real]Absence check using 513 positive place invariants in 598 ms returned sat
[2022-05-16 01:44:47] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 24 ms returned sat
[2022-05-16 01:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:51] [INFO ] [Real]Absence check using state equation in 3133 ms returned unknown
[2022-05-16 01:44:52] [INFO ] [Real]Absence check using 513 positive place invariants in 589 ms returned sat
[2022-05-16 01:44:52] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 24 ms returned sat
[2022-05-16 01:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:44:56] [INFO ] [Real]Absence check using state equation in 3479 ms returned unknown
[2022-05-16 01:44:57] [INFO ] [Real]Absence check using 513 positive place invariants in 625 ms returned sat
[2022-05-16 01:44:57] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 27 ms returned sat
[2022-05-16 01:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:45:01] [INFO ] [Real]Absence check using state equation in 3054 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 7894 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions removed 3404 transitions
Trivial Post-agglo rules discarded 3404 transitions
Performed 3404 trivial Post agglomeration. Transition count delta: 3404
Iterating post reduction 0 with 3404 rules applied. Total rules applied 3404 place count 7894 transition count 4464
Reduce places removed 3404 places and 0 transitions.
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 3978 rules applied. Total rules applied 7382 place count 4490 transition count 3890
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 7576 place count 4298 transition count 3888
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7578 place count 4296 transition count 3888
Performed 1010 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1010 Pre rules applied. Total rules applied 7578 place count 4296 transition count 2878
Deduced a syphon composed of 1010 places in 43 ms
Reduce places removed 1010 places and 0 transitions.
Iterating global reduction 4 with 2020 rules applied. Total rules applied 9598 place count 3286 transition count 2878
Discarding 678 places :
Symmetric choice reduction at 4 with 678 rule applications. Total rules 10276 place count 2608 transition count 2200
Iterating global reduction 4 with 678 rules applied. Total rules applied 10954 place count 2608 transition count 2200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10955 place count 2608 transition count 2199
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 215 Pre rules applied. Total rules applied 10955 place count 2608 transition count 1984
Deduced a syphon composed of 215 places in 27 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 5 with 430 rules applied. Total rules applied 11385 place count 2393 transition count 1984
Performed 611 Post agglomeration using F-continuation condition.Transition count delta: 611
Deduced a syphon composed of 611 places in 2 ms
Reduce places removed 611 places and 0 transitions.
Iterating global reduction 5 with 1222 rules applied. Total rules applied 12607 place count 1782 transition count 1373
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 12608 place count 1782 transition count 1372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 12610 place count 1781 transition count 1371
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 12897 place count 1781 transition count 1084
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 13184 place count 1494 transition count 1084
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 13185 place count 1493 transition count 1083
Reduce places removed 307 places and 0 transitions.
Drop transitions removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 6 with 776 rules applied. Total rules applied 13961 place count 1186 transition count 614
Reduce places removed 469 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 470 rules applied. Total rules applied 14431 place count 717 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 14432 place count 716 transition count 613
Performed 187 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 187 Pre rules applied. Total rules applied 14432 place count 716 transition count 426
Deduced a syphon composed of 187 places in 0 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 9 with 374 rules applied. Total rules applied 14806 place count 529 transition count 426
Applied a total of 14806 rules in 2401 ms. Remains 529 /7894 variables (removed 7365) and now considering 426/7868 (removed 7442) transitions.
Finished structural reductions, in 1 iterations. Remains : 529/7894 places, 426/7868 transitions.
// Phase 1: matrix 426 rows 529 cols
[2022-05-16 01:45:03] [INFO ] Computed 207 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 8542 resets, run finished after 11715 ms. (steps per millisecond=85 ) properties (out of 8) seen :8
FORMULA AutoFlight-PT-96b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 56069 ms.

BK_STOP 1652665515271

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="AutoFlight-PT-96b"
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 AutoFlight-PT-96b, 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 r006-tajo-165245689400525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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