Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025500014.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025500014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 48K 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 MedleyA-PT-02-UpperBounds-00
FORMULA_NAME MedleyA-PT-02-UpperBounds-01
FORMULA_NAME MedleyA-PT-02-UpperBounds-02
FORMULA_NAME MedleyA-PT-02-UpperBounds-03
FORMULA_NAME MedleyA-PT-02-UpperBounds-04
FORMULA_NAME MedleyA-PT-02-UpperBounds-05
FORMULA_NAME MedleyA-PT-02-UpperBounds-06
FORMULA_NAME MedleyA-PT-02-UpperBounds-07
FORMULA_NAME MedleyA-PT-02-UpperBounds-08
FORMULA_NAME MedleyA-PT-02-UpperBounds-09
FORMULA_NAME MedleyA-PT-02-UpperBounds-10
FORMULA_NAME MedleyA-PT-02-UpperBounds-11
FORMULA_NAME MedleyA-PT-02-UpperBounds-12
FORMULA_NAME MedleyA-PT-02-UpperBounds-13
FORMULA_NAME MedleyA-PT-02-UpperBounds-14
FORMULA_NAME MedleyA-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942832591

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:33:54] [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-28 04:33:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:33:54] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-28 04:33:54] [INFO ] Transformed 69 places.
[2026-05-28 04:33:54] [INFO ] Transformed 168 transitions.
[2026-05-28 04:33:54] [INFO ] Found NUPN structural information;
[2026-05-28 04:33:54] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 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]
// Phase 1: matrix 162 rows 69 cols
[2026-05-28 04:33:54] [INFO ] Computed 9 invariants in 9 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 (991 resets) in 55 ms. (178 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (1187 resets) in 73 ms. (675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-28 04:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-28 04:33:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-28 04:33:55] [INFO ] [Real]Added 60 Read/Feed constraints in 7 ms returned sat
[2026-05-28 04:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 17 ms.
[2026-05-28 04:33:55] [INFO ] Added : 12 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Added 60 Read/Feed constraints in 11 ms returned sat
[2026-05-28 04:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Added 60 Read/Feed constraints in 16 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 46 ms.
[2026-05-28 04:33:55] [INFO ] Added : 12 causal constraints over 3 iterations in 157 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Added 60 Read/Feed constraints in 4 ms returned sat
[2026-05-28 04:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Added 60 Read/Feed constraints in 24 ms returned sat
[2026-05-28 04:33:56] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 26 ms.
[2026-05-28 04:33:56] [INFO ] Added : 14 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Added 60 Read/Feed constraints in 20 ms returned sat
[2026-05-28 04:33: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-28 04:33:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2026-05-28 04:33:56] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 22 ms.
[2026-05-28 04:33:56] [INFO ] Added : 15 causal constraints over 3 iterations in 117 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Added 60 Read/Feed constraints in 6 ms returned sat
[2026-05-28 04:33: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-28 04:33:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2026-05-28 04:33:56] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 16 ms.
[2026-05-28 04:33:56] [INFO ] Added : 13 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 288 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 140
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 51 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 51 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 50 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 50 transition count 125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 47 transition count 122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 51 place count 42 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 76 place count 42 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 42 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 40 transition count 126
Applied a total of 80 rules in 44 ms. Remains 40 /69 variables (removed 29) and now considering 126/162 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 40/69 places, 126/162 transitions.
// Phase 1: matrix 126 rows 40 cols
[2026-05-28 04:33:57] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (214471 resets) in 1987 ms. (503 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (54713 resets) in 680 ms. (1468 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-28 04:34:00] [INFO ] Flatten gal took : 61 ms
[2026-05-28 04:34:00] [INFO ] Flatten gal took : 31 ms
[2026-05-28 04:34:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16868093497055265401.gal : 10 ms
[2026-05-28 04:34:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16980660508495317464.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16868093497055265401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16980660508495317464.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 6049 ms.

BK_STOP 1779942840363

--------------------
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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r191-oct2-177969025500014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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