Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349700032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CopsAndRobbers-PT-KFL036N009K002X003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 9.0K Jun 6 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 6 08:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Jun 6 11:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 11:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Jun 6 11:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 19 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 1.4M Jun 5 20:08 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-00
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-01
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-02
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-03
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-04
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-05
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-06
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-07
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-08
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-09
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-10
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-11
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-12
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-13
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-14
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318850156

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-KFL036N009K002X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:54:11] [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]
[2025-06-07 17:54:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:54:11] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-06-07 17:54:11] [INFO ] Transformed 186 places.
[2025-06-07 17:54:11] [INFO ] Transformed 1623 transitions.
[2025-06-07 17:54:11] [INFO ] Parsed PT model containing 186 places and 1623 transitions and 9582 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 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, 1, 0, 0, 1, 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 1623 rows 186 cols
[2025-06-07 17:54:11] [INFO ] Computed 39 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[3, 3, 1, 1, 3, 3, 3, 1, 1, 3, 3, 3, 3, 3, 3, 3]
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (121 resets) in 213 ms. (46 steps per ms)
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (62 resets) in 102 ms. (485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 2, 1] Max Struct:[3, 3, 3, 3, 3]
[2025-06-07 17:54:12] [INFO ] Invariant cache hit.
[2025-06-07 17:54:12] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-06-07 17:54:12] [INFO ] [Real]Absence check using 38 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-07 17:54:12] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-06-07 17:54:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:12] [INFO ] [Nat]Absence check using 38 positive place invariants in 7 ms returned sat
[2025-06-07 17:54:12] [INFO ] [Nat]Absence check using 38 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:13] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-06-07 17:54:13] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-06-07 17:54:13] [INFO ] [Nat]Added 92 Read/Feed constraints in 38 ms returned sat
[2025-06-07 17:54:13] [INFO ] Computed and/alt/rep : 694/694/694 causal constraints (skipped 866 transitions) in 132 ms.
[2025-06-07 17:54:13] [INFO ] Added : 2 causal constraints over 1 iterations in 318 ms. Result :sat
Minimization took 756 ms.
[2025-06-07 17:54:14] [INFO ] [Real]Absence check using 38 positive place invariants in 8 ms returned sat
[2025-06-07 17:54:14] [INFO ] [Real]Absence check using 38 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:14] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-07 17:54:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 9 ms returned sat
[2025-06-07 17:54:14] [INFO ] [Nat]Absence check using 38 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:15] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2025-06-07 17:54:15] [INFO ] [Nat]Added 92 Read/Feed constraints in 38 ms returned sat
[2025-06-07 17:54:15] [INFO ] Computed and/alt/rep : 694/694/694 causal constraints (skipped 866 transitions) in 102 ms.
[2025-06-07 17:54:15] [INFO ] Added : 2 causal constraints over 1 iterations in 274 ms. Result :sat
Minimization took 809 ms.
[2025-06-07 17:54:16] [INFO ] [Real]Absence check using 38 positive place invariants in 6 ms returned sat
[2025-06-07 17:54:16] [INFO ] [Real]Absence check using 38 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:16] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2025-06-07 17:54:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:16] [INFO ] [Nat]Absence check using 38 positive place invariants in 6 ms returned sat
[2025-06-07 17:54:16] [INFO ] [Nat]Absence check using 38 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:16] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-07 17:54:16] [INFO ] [Nat]Added 92 Read/Feed constraints in 72 ms returned sat
[2025-06-07 17:54:17] [INFO ] Computed and/alt/rep : 694/694/694 causal constraints (skipped 866 transitions) in 85 ms.
[2025-06-07 17:54:17] [INFO ] Added : 1 causal constraints over 1 iterations in 224 ms. Result :sat
Minimization took 769 ms.
[2025-06-07 17:54:17] [INFO ] [Real]Absence check using 38 positive place invariants in 9 ms returned sat
[2025-06-07 17:54:17] [INFO ] [Real]Absence check using 38 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:18] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-07 17:54:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:18] [INFO ] [Nat]Absence check using 38 positive place invariants in 7 ms returned sat
[2025-06-07 17:54:18] [INFO ] [Nat]Absence check using 38 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 17:54:18] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2025-06-07 17:54:18] [INFO ] [Nat]Added 92 Read/Feed constraints in 159 ms returned sat
[2025-06-07 17:54:18] [INFO ] Deduced a trap composed of 110 places in 197 ms of which 12 ms to minimize.
[2025-06-07 17:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2025-06-07 17:54:19] [INFO ] Computed and/alt/rep : 694/694/694 causal constraints (skipped 866 transitions) in 108 ms.
[2025-06-07 17:54:19] [INFO ] Added : 3 causal constraints over 1 iterations in 299 ms. Result :sat
Minimization took 823 ms.
[2025-06-07 17:54:20] [INFO ] [Real]Absence check using 38 positive place invariants in 6 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Real]Absence check using 38 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Real]Added 92 Read/Feed constraints in 14 ms returned sat
[2025-06-07 17:54:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:20] [INFO ] [Nat]Absence check using 38 positive place invariants in 7 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Nat]Absence check using 38 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-06-07 17:54:20] [INFO ] [Nat]Added 92 Read/Feed constraints in 50 ms returned sat
[2025-06-07 17:54:20] [INFO ] Computed and/alt/rep : 694/694/694 causal constraints (skipped 866 transitions) in 96 ms.
[2025-06-07 17:54:21] [INFO ] Added : 1 causal constraints over 1 iterations in 243 ms. Result :sat
Minimization took 731 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 2, 1] Max Struct:[3, 3, 3, 3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 2, 2, 1] Max Struct:[3, 3, 3, 3, 3]
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 1623/1623 transitions.
Graph (complete) has 3642 edges and 186 vertex of which 155 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.8 ms
Discarding 31 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 155 transition count 1622
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 154 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 153 transition count 1621
Applied a total of 5 rules in 230 ms. Remains 153 /186 variables (removed 33) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
// Phase 1: matrix 1621 rows 153 cols
[2025-06-07 17:54:22] [INFO ] Computed 38 invariants in 22 ms
[2025-06-07 17:54:22] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
SMT process timed out in 37806ms, After SMT, problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 37839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38099 ms. Remains : 153/186 places, 1621/1623 transitions.
[2025-06-07 17:54:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2, 2, 1] Max Struct:[3, 3, 3, 3, 3]
RANDOM walk for 1000000 steps (15090 resets) in 16730 ms. (59 steps per ms)
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1016 resets) in 1659 ms. (602 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 )
[2025-06-07 17:55:18] [INFO ] Flatten gal took : 188 ms
[2025-06-07 17:55:18] [INFO ] Flatten gal took : 108 ms
[2025-06-07 17:55:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14119611344773934743.gal : 44 ms
[2025-06-07 17:55:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14953394379510924727.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/ReachabilityCardinality14119611344773934743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14953394379510924727.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 67467 ms.

BK_STOP 1749318918994

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="CopsAndRobbers-PT-KFL036N009K002X003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CopsAndRobbers-PT-KFL036N009K002X003, 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 r265-tall-174931349700032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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