About the Execution of ITS-Tools for Philosophers-PT-000200
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.r293-tall-167873945100229.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 itstools
Input is Philosophers-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945100229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 171K Feb 25 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 960K Feb 25 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 762K Feb 25 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 75K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 332K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 310K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 445K Mar 5 18:23 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 Philosophers-PT-000200-UpperBounds-00
FORMULA_NAME Philosophers-PT-000200-UpperBounds-01
FORMULA_NAME Philosophers-PT-000200-UpperBounds-02
FORMULA_NAME Philosophers-PT-000200-UpperBounds-03
FORMULA_NAME Philosophers-PT-000200-UpperBounds-04
FORMULA_NAME Philosophers-PT-000200-UpperBounds-05
FORMULA_NAME Philosophers-PT-000200-UpperBounds-06
FORMULA_NAME Philosophers-PT-000200-UpperBounds-07
FORMULA_NAME Philosophers-PT-000200-UpperBounds-08
FORMULA_NAME Philosophers-PT-000200-UpperBounds-09
FORMULA_NAME Philosophers-PT-000200-UpperBounds-10
FORMULA_NAME Philosophers-PT-000200-UpperBounds-11
FORMULA_NAME Philosophers-PT-000200-UpperBounds-12
FORMULA_NAME Philosophers-PT-000200-UpperBounds-13
FORMULA_NAME Philosophers-PT-000200-UpperBounds-14
FORMULA_NAME Philosophers-PT-000200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678808433436
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-14 15:40:35] [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]
[2023-03-14 15:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:40:35] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-14 15:40:35] [INFO ] Transformed 1000 places.
[2023-03-14 15:40:35] [INFO ] Transformed 1000 transitions.
[2023-03-14 15:40:35] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 15:40:35] [INFO ] Computed 400 place invariants in 29 ms
FORMULA Philosophers-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 9) seen :514
FORMULA Philosophers-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :18
[2023-03-14 15:40:37] [INFO ] Invariant cache hit.
[2023-03-14 15:40:37] [INFO ] [Real]Absence check using 400 positive place invariants in 139 ms returned sat
[2023-03-14 15:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:37] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2023-03-14 15:40:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:40:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 92 ms returned sat
[2023-03-14 15:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:38] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2023-03-14 15:40:38] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-14 15:40:39] [INFO ] Added : 35 causal constraints over 7 iterations in 560 ms. Result :sat
Minimization took 157 ms.
[2023-03-14 15:40:39] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2023-03-14 15:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:40] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-14 15:40:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:40:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 83 ms returned sat
[2023-03-14 15:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:40] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-14 15:40:40] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-14 15:40:40] [INFO ] Added : 18 causal constraints over 4 iterations in 335 ms. Result :sat
Minimization took 121 ms.
[2023-03-14 15:40:41] [INFO ] [Real]Absence check using 400 positive place invariants in 79 ms returned sat
[2023-03-14 15:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:41] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-14 15:40:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:40:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2023-03-14 15:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:42] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-14 15:40:42] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-14 15:40:42] [INFO ] Added : 19 causal constraints over 4 iterations in 308 ms. Result :sat
Minimization took 112 ms.
[2023-03-14 15:40:42] [INFO ] [Real]Absence check using 400 positive place invariants in 79 ms returned sat
[2023-03-14 15:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:43] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-14 15:40:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:40:43] [INFO ] [Nat]Absence check using 400 positive place invariants in 79 ms returned sat
[2023-03-14 15:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:43] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-14 15:40:43] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-14 15:40:44] [INFO ] Added : 19 causal constraints over 4 iterations in 309 ms. Result :sat
Minimization took 113 ms.
[2023-03-14 15:40:44] [INFO ] [Real]Absence check using 400 positive place invariants in 119 ms returned sat
[2023-03-14 15:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:44] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-14 15:40:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:40:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 81 ms returned sat
[2023-03-14 15:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:40:45] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2023-03-14 15:40:45] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-14 15:40:45] [INFO ] Added : 18 causal constraints over 4 iterations in 310 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200] Max seen :[34, 126, 112, 112, 126]
FORMULA Philosophers-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 1000 transition count 600
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 1000 place count 600 transition count 400
Applied a total of 1000 rules in 183 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 600/1000 places, 400/1000 transitions.
// Phase 1: matrix 400 rows 600 cols
[2023-03-14 15:40:50] [INFO ] Computed 400 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23556 ms. (steps per millisecond=42 ) properties (out of 1) seen :74
Finished Best-First random walk after 568409 steps, including 1 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=113 )
[2023-03-14 15:41:18] [INFO ] Invariant cache hit.
[2023-03-14 15:41:18] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2023-03-14 15:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:41:18] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-14 15:41:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 15:41:19] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2023-03-14 15:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 15:41:19] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-14 15:41:19] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-14 15:41:19] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [200] Max seen :[98]
Support contains 200 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 600/600 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-14 15:41:19] [INFO ] Invariant cache hit.
[2023-03-14 15:41:19] [INFO ] Implicit Places using invariants in 339 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 343 ms to find 200 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/600 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 365 ms. Remains : 400/600 places, 400/400 transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-14 15:41:19] [INFO ] Computed 200 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 17565 ms. (steps per millisecond=56 ) properties (out of 1) seen :75
Finished Best-First random walk after 798124 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=159 )
[2023-03-14 15:41:42] [INFO ] Invariant cache hit.
[2023-03-14 15:41:42] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : [100] Max seen :[100]
FORMULA Philosophers-PT-000200-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 67298 ms.
BK_STOP 1678808503562
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Philosophers-PT-000200"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000200, 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 r293-tall-167873945100229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 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 '
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 ;