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.r496-tall-171640603800589.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 GPUForwardProgress-PT-32b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 160K 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 GPUForwardProgress-PT-32b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717198842129

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:40:43] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-31 23:40:43] [INFO ] Transformed 644 places.
[2024-05-31 23:40:43] [INFO ] Transformed 677 transitions.
[2024-05-31 23:40:43] [INFO ] Found NUPN structural information;
[2024-05-31 23:40:43] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
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]
// Phase 1: matrix 677 rows 644 cols
[2024-05-31 23:40:43] [INFO ] Computed 34 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 (34 resets) in 43 ms. (227 steps per ms)
FORMULA GPUForwardProgress-PT-32b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (19 resets) in 46 ms. (1063 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-31 23:40:43] [INFO ] Invariant cache hit.
[2024-05-31 23:40:44] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-31 23:40:44] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-31 23:40:44] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 58 ms.
[2024-05-31 23:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:40:44] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 23:40:44] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-31 23:40:45] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 49 ms.
[2024-05-31 23:40:47] [INFO ] Added : 336 causal constraints over 68 iterations in 2951 ms. Result :sat
Minimization took 420 ms.
[2024-05-31 23:40:48] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 23:40:48] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-31 23:40:48] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 48 ms.
[2024-05-31 23:40:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:40:49] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 23:40:49] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-31 23:40:49] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 49 ms.
[2024-05-31 23:40:52] [INFO ] Added : 381 causal constraints over 77 iterations in 3422 ms. Result :sat
Minimization took 455 ms.
[2024-05-31 23:40:53] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 23:40:53] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-31 23:40:53] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 33 ms.
[2024-05-31 23:40:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:40:54] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 23:40:54] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-31 23:40:54] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 39 ms.
[2024-05-31 23:40:55] [INFO ] Added : 130 causal constraints over 27 iterations in 1020 ms. Result :sat
Minimization took 493 ms.
[2024-05-31 23:40:55] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 23:40:56] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-31 23:40:56] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 31 ms.
[2024-05-31 23:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:40:56] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 23:40:56] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-31 23:40:56] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 35 ms.
[2024-05-31 23:40:59] [INFO ] Added : 326 causal constraints over 66 iterations in 2700 ms. Result :sat
Minimization took 413 ms.
[2024-05-31 23:41:00] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-31 23:41:00] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-31 23:41:00] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 35 ms.
[2024-05-31 23:41:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:41:00] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 21 ms returned sat
[2024-05-31 23:41:00] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-31 23:41:00] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 38 ms.
[2024-05-31 23:41:03] [INFO ] Added : 325 causal constraints over 65 iterations in 3206 ms. Result :sat
Minimization took 505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA GPUForwardProgress-PT-32b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 644 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p147) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 676/676 transitions.
Graph (trivial) has 576 edges and 644 vertex of which 7 / 644 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 967 edges and 638 vertex of which 601 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 369 rules applied. Total rules applied 371 place count 600 transition count 296
Reduce places removed 366 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 400 rules applied. Total rules applied 771 place count 234 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 772 place count 233 transition count 262
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 772 place count 233 transition count 198
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 900 place count 169 transition count 198
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 934 place count 135 transition count 164
Iterating global reduction 3 with 34 rules applied. Total rules applied 968 place count 135 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 968 place count 135 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 972 place count 133 transition count 162
Graph (complete) has 258 edges and 133 vertex of which 34 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.0 ms
Discarding 99 places :
Also discarding 98 output transitions
Drop transitions (Output transitions of discarded places.) removed 98 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 3 with 27 rules applied. Total rules applied 999 place count 34 transition count 38
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1057 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1062 place count 5 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 5 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1064 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1065 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1066 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1066 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1068 place count 2 transition count 1
Applied a total of 1068 rules in 74 ms. Remains 2 /644 variables (removed 642) and now considering 1/676 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2/644 places, 1/676 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-31 23:41:05] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 260 ms. (3831 steps per ms)
FORMULA GPUForwardProgress-PT-32b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 227 ms. (4385 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 22345 ms.
ITS solved all properties within timeout

BK_STOP 1717198865661

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="GPUForwardProgress-PT-32b"
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 GPUForwardProgress-PT-32b, 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 r496-tall-171640603800589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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