Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 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 CANConstruction-PT-030-UpperBounds-00
FORMULA_NAME CANConstruction-PT-030-UpperBounds-01
FORMULA_NAME CANConstruction-PT-030-UpperBounds-02
FORMULA_NAME CANConstruction-PT-030-UpperBounds-03
FORMULA_NAME CANConstruction-PT-030-UpperBounds-04
FORMULA_NAME CANConstruction-PT-030-UpperBounds-05
FORMULA_NAME CANConstruction-PT-030-UpperBounds-06
FORMULA_NAME CANConstruction-PT-030-UpperBounds-07
FORMULA_NAME CANConstruction-PT-030-UpperBounds-08
FORMULA_NAME CANConstruction-PT-030-UpperBounds-09
FORMULA_NAME CANConstruction-PT-030-UpperBounds-10
FORMULA_NAME CANConstruction-PT-030-UpperBounds-11
FORMULA_NAME CANConstruction-PT-030-UpperBounds-12
FORMULA_NAME CANConstruction-PT-030-UpperBounds-13
FORMULA_NAME CANConstruction-PT-030-UpperBounds-14
FORMULA_NAME CANConstruction-PT-030-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716217148147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-20 14:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:59:09] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2024-05-20 14:59:09] [INFO ] Transformed 2162 places.
[2024-05-20 14:59:09] [INFO ] Transformed 3840 transitions.
[2024-05-20 14:59:09] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 3840 rows 2162 cols
[2024-05-20 14:59:10] [INFO ] Computed 61 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (19 resets) in 120 ms. (82 steps per ms)
FORMULA CANConstruction-PT-030-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 86 ms. (689 steps per ms)
FORMULA CANConstruction-PT-030-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-20 14:59:10] [INFO ] Invariant cache hit.
[2024-05-20 14:59:10] [INFO ] [Real]Absence check using 31 positive place invariants in 53 ms returned sat
[2024-05-20 14:59:10] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-20 14:59:11] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2024-05-20 14:59:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:59:12] [INFO ] [Real]Added 1770 Read/Feed constraints in 155 ms returned sat
[2024-05-20 14:59:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:59:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2024-05-20 14:59:12] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 29 ms returned sat
[2024-05-20 14:59:13] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2024-05-20 14:59:13] [INFO ] [Nat]Added 1770 Read/Feed constraints in 184 ms returned sat
[2024-05-20 14:59:13] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 234 ms.
[2024-05-20 14:59:14] [INFO ] Added : 11 causal constraints over 3 iterations in 1017 ms. Result :sat
Minimization took 2130 ms.
[2024-05-20 14:59:17] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2024-05-20 14:59:17] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-20 14:59:18] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-20 14:59:18] [INFO ] [Real]Added 1770 Read/Feed constraints in 140 ms returned sat
[2024-05-20 14:59:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:59:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2024-05-20 14:59:18] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2024-05-20 14:59:19] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-05-20 14:59:19] [INFO ] [Nat]Added 1770 Read/Feed constraints in 153 ms returned sat
[2024-05-20 14:59:19] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 181 ms.
[2024-05-20 14:59:20] [INFO ] Added : 11 causal constraints over 3 iterations in 865 ms. Result :sat
Minimization took 2719 ms.
[2024-05-20 14:59:23] [INFO ] [Real]Absence check using 31 positive place invariants in 40 ms returned sat
[2024-05-20 14:59:23] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 11 ms returned sat
[2024-05-20 14:59:24] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2024-05-20 14:59:24] [INFO ] [Real]Added 1770 Read/Feed constraints in 142 ms returned sat
[2024-05-20 14:59:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:59:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2024-05-20 14:59:25] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 12 ms returned sat
[2024-05-20 14:59:26] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2024-05-20 14:59:26] [INFO ] [Nat]Added 1770 Read/Feed constraints in 159 ms returned sat
[2024-05-20 14:59:26] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 291 ms.
[2024-05-20 14:59:27] [INFO ] Added : 11 causal constraints over 3 iterations in 1122 ms. Result :sat
Minimization took 2461 ms.
[2024-05-20 14:59:30] [INFO ] [Real]Absence check using 31 positive place invariants in 51 ms returned sat
[2024-05-20 14:59:30] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 19 ms returned sat
[2024-05-20 14:59:31] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2024-05-20 14:59:31] [INFO ] [Real]Added 1770 Read/Feed constraints in 157 ms returned sat
[2024-05-20 14:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:59:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2024-05-20 14:59:31] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 11 ms returned sat
[2024-05-20 14:59:32] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2024-05-20 14:59:32] [INFO ] [Nat]Added 1770 Read/Feed constraints in 157 ms returned sat
[2024-05-20 14:59:33] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 170 ms.
[2024-05-20 14:59:33] [INFO ] Added : 11 causal constraints over 3 iterations in 813 ms. Result :sat
Minimization took 2260 ms.
[2024-05-20 14:59:36] [INFO ] [Real]Absence check using 31 positive place invariants in 67 ms returned sat
[2024-05-20 14:59:36] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2024-05-20 14:59:37] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2024-05-20 14:59:37] [INFO ] [Real]Added 1770 Read/Feed constraints in 129 ms returned sat
[2024-05-20 14:59:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:59:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 71 ms returned sat
[2024-05-20 14:59:37] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 44 ms returned sat
[2024-05-20 14:59:38] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2024-05-20 14:59:38] [INFO ] [Nat]Added 1770 Read/Feed constraints in 152 ms returned sat
[2024-05-20 14:59:39] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 207 ms.
[2024-05-20 14:59:39] [INFO ] Added : 8 causal constraints over 2 iterations in 713 ms. Result :sat
Minimization took 2022 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2162 transition count 3630
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1952 transition count 3630
Discarding 837 places :
Symmetric choice reduction at 2 with 837 rule applications. Total rules 1257 place count 1115 transition count 1956
Iterating global reduction 2 with 837 rules applied. Total rules applied 2094 place count 1115 transition count 1956
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 2154 place count 1085 transition count 1926
Free-agglomeration rule applied 54 times.
Iterating global reduction 2 with 54 rules applied. Total rules applied 2208 place count 1085 transition count 1872
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 2262 place count 1031 transition count 1872
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 2268 place count 1031 transition count 1872
Applied a total of 2268 rules in 1098 ms. Remains 1031 /2162 variables (removed 1131) and now considering 1872/3840 (removed 1968) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1108 ms. Remains : 1031/2162 places, 1872/3840 transitions.
// Phase 1: matrix 1872 rows 1031 cols
[2024-05-20 14:59:42] [INFO ] Computed 61 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (4870 resets) in 6658 ms. (150 steps per ms)
FORMULA CANConstruction-PT-030-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANConstruction-PT-030-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (158 resets) in 1059 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-20 14:59:51] [INFO ] Flatten gal took : 249 ms
[2024-05-20 14:59:51] [INFO ] Flatten gal took : 177 ms
[2024-05-20 14:59:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11136664264418666898.gal : 61 ms
[2024-05-20 14:59:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality459387634466132116.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11136664264418666898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality459387634466132116.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 42290 ms.

BK_STOP 1716217191718

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CANConstruction-PT-030"
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-5568"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, 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 r070-tall-171620505000029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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