fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r516-tajo-171654447300517
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PolyORBNT-PT-S10J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6668.520 97077.00 127176.00 96.60 1 4 1 3 1 1 3 10 1 1 10 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/mcc2024-input.r516-tajo-171654447300517.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 39K Apr 12 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K Apr 12 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 198K Apr 12 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 829K Apr 12 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 PolyORBNT-PT-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717262159821

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:16:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:16:01] [INFO ] Load time of PNML (sax parser for PT used): 645 ms
[2024-06-01 17:16:01] [INFO ] Transformed 1614 places.
[2024-06-01 17:16:02] [INFO ] Transformed 13500 transitions.
[2024-06-01 17:16:02] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 948 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 1, 3, 10, 1, 1, 10, 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, 1, 3, 10, 1, 1, 10, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 17:16:02] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2024-06-01 17:16:02] [INFO ] Computed 192 invariants in 202 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 3, 10, 1, 1, 10, 0, 0, 0, 0, 0] Max Struct:[152, 703, 319, 1830, 152, 247, 3, 703, 64, 4, +inf, 152, 152, 267, 152, 1]
FORMULA PolyORBNT-PT-S10J80-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (560 resets) in 387 ms. (25 steps per ms)
BEST_FIRST walk for 150014 steps (1395 resets) in 697 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 1, 3, 1, 1, 10, 1, 1, 10, 1, 1, 0, 1, 0] Max Struct:[152, 703, 319, 1830, 152, 247, 703, 64, 4, +inf, 152, 152, 267, 152, 1]
[2024-06-01 17:16:03] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 17:16:03] [INFO ] Invariant cache hit.
[2024-06-01 17:16:03] [INFO ] [Real]Absence check using 159 positive place invariants in 60 ms returned sat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 58 ms returned unsat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive place invariants in 45 ms returned sat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 68 ms returned unsat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive place invariants in 43 ms returned sat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 48 ms returned unsat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive place invariants in 36 ms returned sat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 28 ms returned unsat
[2024-06-01 17:16:04] [INFO ] [Real]Absence check using 159 positive place invariants in 34 ms returned sat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 41 ms returned unsat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive place invariants in 39 ms returned sat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 29 ms returned unsat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 56 ms returned unsat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive place invariants in 35 ms returned sat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 34 ms returned unsat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2024-06-01 17:16:05] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 18 ms returned unsat
[2024-06-01 17:16:06] [INFO ] [Real]Absence check using 159 positive place invariants in 34 ms returned sat
[2024-06-01 17:16:06] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 51 ms returned sat
[2024-06-01 17:16:08] [INFO ] [Real]Absence check using state equation in 2716 ms returned sat
[2024-06-01 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:16:09] [INFO ] [Nat]Absence check using 159 positive place invariants in 54 ms returned sat
[2024-06-01 17:16:09] [INFO ] [Nat]Absence check using 159 positive and 33 generalized place invariants in 106 ms returned sat
[2024-06-01 17:16:11] [INFO ] [Nat]Absence check using state equation in 2028 ms returned sat
[2024-06-01 17:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:16:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:16:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2189 ms returned unknown
[2024-06-01 17:16:13] [INFO ] [Real]Absence check using 159 positive place invariants in 47 ms returned sat
[2024-06-01 17:16:14] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 71 ms returned unsat
[2024-06-01 17:16:14] [INFO ] [Real]Absence check using 159 positive place invariants in 47 ms returned sat
[2024-06-01 17:16:14] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 69 ms returned unsat
[2024-06-01 17:16:14] [INFO ] [Real]Absence check using 159 positive place invariants in 46 ms returned sat
[2024-06-01 17:16:14] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 78 ms returned sat
[2024-06-01 17:16:19] [INFO ] [Real]Absence check using state equation in 4692 ms returned unknown
[2024-06-01 17:16:19] [INFO ] [Real]Absence check using 159 positive place invariants in 48 ms returned sat
[2024-06-01 17:16:19] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 54 ms returned unsat
[2024-06-01 17:16:19] [INFO ] [Real]Absence check using 159 positive place invariants in 50 ms returned sat
[2024-06-01 17:16:20] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 71 ms returned sat
[2024-06-01 17:16:21] [INFO ] [Real]Absence check using state equation in 1708 ms returned sat
[2024-06-01 17:16:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:16:22] [INFO ] [Nat]Absence check using 159 positive place invariants in 40 ms returned sat
[2024-06-01 17:16:22] [INFO ] [Nat]Absence check using 159 positive and 33 generalized place invariants in 61 ms returned sat
[2024-06-01 17:16:24] [INFO ] [Nat]Absence check using state equation in 2719 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 1, 3, 1, 1, 10, 1, 1, 10, 1, 1, 0, 1, 0] Max Struct:[1, 4, 1, 3, 1, 1, 10, 1, 1, +inf, 1, 1, 267, 1, 1]
FORMULA PolyORBNT-PT-S10J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 0, 0] Max Struct:[+inf, 267, 1]
Support contains 3 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1604 transition count 3306
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 178 place count 1520 transition count 3306
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 178 place count 1520 transition count 3222
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 346 place count 1436 transition count 3222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 1435 transition count 3221
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 1435 transition count 3221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 352 place count 1433 transition count 3219
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 1433 transition count 3218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 1432 transition count 3218
Applied a total of 354 rules in 1042 ms. Remains 1432 /1614 variables (removed 182) and now considering 3218/3390 (removed 172) transitions.
Running 3207 sub problems to find dead transitions.
[2024-06-01 17:16:26] [INFO ] Flow matrix only has 3209 transitions (discarded 9 similar events)
// Phase 1: matrix 3209 rows 1432 cols
[2024-06-01 17:16:26] [INFO ] Computed 182 invariants in 201 ms
[2024-06-01 17:16:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1422 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3207 unsolved
SMT process timed out in 44113ms, After SMT, problems are : Problem set: 0 solved, 3207 unsolved
Search for dead transitions found 0 dead transitions in 44174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45261 ms. Remains : 1432/1614 places, 3218/3390 transitions.
[2024-06-01 17:17:10] [INFO ] Flow matrix only has 3209 transitions (discarded 9 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 17:17:11] [INFO ] Flow matrix only has 3209 transitions (discarded 9 similar events)
[2024-06-01 17:17:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 0, 0] Max Struct:[+inf, 1, 1]
RANDOM walk for 1000000 steps (72632 resets) in 18985 ms. (52 steps per ms)
FORMULA PolyORBNT-PT-S10J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (5311 resets) in 3094 ms. (323 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[+inf]
[2024-06-01 17:17:33] [INFO ] Flow matrix only has 3209 transitions (discarded 9 similar events)
[2024-06-01 17:17:33] [INFO ] Invariant cache hit.
[2024-06-01 17:17:34] [INFO ] [Real]Absence check using 160 positive place invariants in 42 ms returned sat
[2024-06-01 17:17:34] [INFO ] [Real]Absence check using 160 positive and 22 generalized place invariants in 57 ms returned sat
[2024-06-01 17:17:36] [INFO ] [Real]Absence check using state equation in 2533 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[10]
FORMULA PolyORBNT-PT-S10J80-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 13 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 95711 ms.
ITS solved all properties within timeout

BK_STOP 1717262256898

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S10J80, 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 r516-tajo-171654447300517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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