Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r079-tall-177946972200060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is CopsAndRobbers-PT-CRL025X003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-177946972200060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 133K Mar 3 18:30 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-CRL025X003-UpperBounds-00
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-01
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-02
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-03
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-04
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-05
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-06
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-07
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-08
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-09
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-10
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-11
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-12
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-13
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-14
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556974373

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:22:55] [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]
[2026-05-23 17:22:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:22:55] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2026-05-23 17:22:55] [INFO ] Transformed 135 places.
[2026-05-23 17:22:55] [INFO ] Transformed 179 transitions.
[2026-05-23 17:22:55] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 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, 1, 0, 0, 0, 1, 0, 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 179 rows 135 cols
[2026-05-23 17:22:55] [INFO ] Computed 29 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[3, 1, 3, 3, 3, 1, 1, 3, 3, 3, 1, 3, 3, 3, 1, 3]
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 46 ms. (212 steps per ms)
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (8 resets) in 62 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[3, 3, 3]
[2026-05-23 17:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-23 17:22:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 17:22:56] [INFO ] [Real]Added 50 Read/Feed constraints in 9 ms returned sat
[2026-05-23 17:22:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Added 50 Read/Feed constraints in 7 ms returned sat
[2026-05-23 17:22:56] [INFO ] Computed and/alt/rep : 125/400/125 causal constraints (skipped 4 transitions) in 15 ms.
[2026-05-23 17:22:56] [INFO ] Added : 11 causal constraints over 3 iterations in 128 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-23 17:22:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2026-05-23 17:22:56] [INFO ] Computed and/alt/rep : 125/400/125 causal constraints (skipped 4 transitions) in 12 ms.
[2026-05-23 17:22:56] [INFO ] Added : 5 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:57] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Real]Added 50 Read/Feed constraints in 6 ms returned sat
[2026-05-23 17:22:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:57] [INFO ] [Nat]Absence check using 28 positive place invariants in 8 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Nat]Added 50 Read/Feed constraints in 7 ms returned sat
[2026-05-23 17:22:57] [INFO ] Computed and/alt/rep : 125/400/125 causal constraints (skipped 4 transitions) in 10 ms.
[2026-05-23 17:22:57] [INFO ] Added : 75 causal constraints over 16 iterations in 630 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[3, 3, 3]
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[3]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 179/179 transitions.
Graph (complete) has 610 edges and 135 vertex of which 111 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 111 transition count 178
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 3 place count 110 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 109 transition count 177
Applied a total of 5 rules in 35 ms. Remains 109 /135 variables (removed 26) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 109 cols
[2026-05-23 17:22:58] [INFO ] Computed 28 invariants in 3 ms
[2026-05-23 17:22:58] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/286 variables, and 187 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 123/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/286 variables, and 309 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/109 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 123/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40142ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40197 ms. Remains : 109/135 places, 177/179 transitions.
[2026-05-23 17:23:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[3]
FORMULA CopsAndRobbers-PT-CRL025X003-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1108 ms. (901 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 )
[2026-05-23 17:23:39] [INFO ] Flatten gal took : 42 ms
[2026-05-23 17:23:39] [INFO ] Flatten gal took : 15 ms
[2026-05-23 17:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2353885797739028459.gal : 11 ms
[2026-05-23 17:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16992594079374403675.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2353885797739028459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16992594079374403675.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 43915 ms.

BK_STOP 1779557019628

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-CRL025X003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is CopsAndRobbers-PT-CRL025X003, 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 r079-tall-177946972200060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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