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.r553-tall-171734901300261.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 ltsminxred
Input is FireWire-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16: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 FireWire-PT-12-UpperBounds-00
FORMULA_NAME FireWire-PT-12-UpperBounds-01
FORMULA_NAME FireWire-PT-12-UpperBounds-02
FORMULA_NAME FireWire-PT-12-UpperBounds-03
FORMULA_NAME FireWire-PT-12-UpperBounds-04
FORMULA_NAME FireWire-PT-12-UpperBounds-05
FORMULA_NAME FireWire-PT-12-UpperBounds-06
FORMULA_NAME FireWire-PT-12-UpperBounds-07
FORMULA_NAME FireWire-PT-12-UpperBounds-08
FORMULA_NAME FireWire-PT-12-UpperBounds-09
FORMULA_NAME FireWire-PT-12-UpperBounds-10
FORMULA_NAME FireWire-PT-12-UpperBounds-11
FORMULA_NAME FireWire-PT-12-UpperBounds-12
FORMULA_NAME FireWire-PT-12-UpperBounds-13
FORMULA_NAME FireWire-PT-12-UpperBounds-14
FORMULA_NAME FireWire-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717355456168

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:10:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:10:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:10:57] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 19:10:57] [INFO ] Transformed 169 places.
[2024-06-02 19:10:57] [INFO ] Transformed 508 transitions.
[2024-06-02 19:10:57] [INFO ] Found NUPN structural information;
[2024-06-02 19:10:57] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : 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]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:10:57] [INFO ] Flow matrix only has 402 transitions (discarded 38 similar events)
// Phase 1: matrix 402 rows 169 cols
[2024-06-02 19:10:57] [INFO ] Computed 10 invariants in 16 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 (280 resets) in 49 ms. (200 steps per ms)
FORMULA FireWire-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (347 resets) in 86 ms. (689 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 19:10:57] [INFO ] Flow matrix only has 402 transitions (discarded 38 similar events)
[2024-06-02 19:10:57] [INFO ] Invariant cache hit.
[2024-06-02 19:10:57] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 19:10:58] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-02 19:10:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:10:58] [INFO ] [Real]Added 58 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:10:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:10:58] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 19:10:58] [INFO ] [Nat]Added 58 Read/Feed constraints in 39 ms returned sat
[2024-06-02 19:10:58] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 48 ms.
[2024-06-02 19:10:58] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 10 ms to minimize.
[2024-06-02 19:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-02 19:10:58] [INFO ] Added : 13 causal constraints over 3 iterations in 263 ms. Result :sat
Minimization took 175 ms.
[2024-06-02 19:10:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:10:58] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-02 19:10:59] [INFO ] [Real]Added 58 Read/Feed constraints in 46 ms returned sat
[2024-06-02 19:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:10:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:10:59] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-02 19:10:59] [INFO ] [Nat]Added 58 Read/Feed constraints in 42 ms returned sat
[2024-06-02 19:10:59] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 42 ms.
[2024-06-02 19:10:59] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:10:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:10:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-06-02 19:10:59] [INFO ] Added : 45 causal constraints over 11 iterations in 559 ms. Result :sat
Minimization took 162 ms.
[2024-06-02 19:11:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:11:00] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:11:00] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:11:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:11:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:11:00] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 19:11:00] [INFO ] [Nat]Added 58 Read/Feed constraints in 52 ms returned sat
[2024-06-02 19:11:00] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 39 ms.
[2024-06-02 19:11:00] [INFO ] Added : 52 causal constraints over 11 iterations in 327 ms. Result :sat
Minimization took 169 ms.
[2024-06-02 19:11:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:11:00] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:11:01] [INFO ] [Real]Added 58 Read/Feed constraints in 38 ms returned sat
[2024-06-02 19:11:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:11:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:11:01] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:11:01] [INFO ] [Nat]Added 58 Read/Feed constraints in 47 ms returned sat
[2024-06-02 19:11:01] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 31 ms.
[2024-06-02 19:11:01] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:11:01] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:11:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2024-06-02 19:11:01] [INFO ] Added : 42 causal constraints over 10 iterations in 571 ms. Result :sat
Minimization took 168 ms.
[2024-06-02 19:11:02] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:11:02] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-02 19:11:02] [INFO ] [Real]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:11:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:11:02] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:11:02] [INFO ] [Nat]Added 58 Read/Feed constraints in 27 ms returned sat
[2024-06-02 19:11:02] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 29 ms.
[2024-06-02 19:11:02] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:11:02] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:11:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2024-06-02 19:11:02] [INFO ] Added : 61 causal constraints over 13 iterations in 586 ms. Result :sat
Minimization took 174 ms.
[2024-06-02 19:11:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:11:03] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:11:03] [INFO ] [Real]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:11:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 19:11:03] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 19:11:03] [INFO ] [Nat]Added 58 Read/Feed constraints in 35 ms returned sat
[2024-06-02 19:11:03] [INFO ] Computed and/alt/rep : 169/611/169 causal constraints (skipped 232 transitions) in 31 ms.
[2024-06-02 19:11:03] [INFO ] Added : 13 causal constraints over 4 iterations in 140 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 440/440 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 169 transition count 437
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 169 transition count 431
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 163 transition count 431
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 160 transition count 425
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 160 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 157 transition count 434
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 157 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 42 place count 157 transition count 419
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 157 transition count 427
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 60 place count 152 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 152 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 151 transition count 412
Applied a total of 67 rules in 115 ms. Remains 151 /169 variables (removed 18) and now considering 412/440 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 151/169 places, 412/440 transitions.
[2024-06-02 19:11:04] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 151 cols
[2024-06-02 19:11:04] [INFO ] Computed 10 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31953 resets) in 1503 ms. (664 steps per ms)
FORMULA FireWire-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6954 resets) in 447 ms. (2232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 8847 ms.
ITS solved all properties within timeout

BK_STOP 1717355466153

--------------------
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="FireWire-PT-12"
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 FireWire-PT-12, 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 r553-tall-171734901300261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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