fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r198-tall-174894532000045
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ServersAndClients-PT-200040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 51111.00 0.00 0.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532000045.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 itstools
Input is ServersAndClients-PT-200040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532000045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.1M May 29 14:32 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 ServersAndClients-PT-200040-UpperBounds-00
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-01
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-02
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-03
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-04
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-05
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-06
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-07
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-08
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-09
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-10
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-11
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-12
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-13
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-14
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748960856699

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-03 14:27:37] [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-03 14:27:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 14:27:38] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2025-06-03 14:27:38] [INFO ] Transformed 8841 places.
[2025-06-03 14:27:38] [INFO ] Transformed 16400 transitions.
[2025-06-03 14:27:38] [INFO ] Found NUPN structural information;
[2025-06-03 14:27:38] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ServersAndClients-PT-200040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16400 rows 8841 cols
[2025-06-03 14:27:39] [INFO ] Computed 441 invariants in 395 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 543 ms. (18 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 432 ms. (207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-03 14:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:27:42] [INFO ] [Real]Absence check using 241 positive place invariants in 823 ms returned sat
[2025-06-03 14:27:43] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 177 ms returned sat
[2025-06-03 14:27:45] [INFO ] [Real]Absence check using state equation in 2223 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:27:47] [INFO ] [Real]Absence check using 241 positive place invariants in 873 ms returned sat
[2025-06-03 14:27:47] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 171 ms returned sat
[2025-06-03 14:27:50] [INFO ] [Real]Absence check using state equation in 2443 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:27:52] [INFO ] [Real]Absence check using 241 positive place invariants in 781 ms returned sat
[2025-06-03 14:27:52] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 168 ms returned sat
[2025-06-03 14:27:55] [INFO ] [Real]Absence check using state equation in 2585 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:27:57] [INFO ] [Real]Absence check using 241 positive place invariants in 892 ms returned sat
[2025-06-03 14:27:57] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 184 ms returned sat
[2025-06-03 14:28:00] [INFO ] [Real]Absence check using state equation in 2532 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:28:02] [INFO ] [Real]Absence check using 241 positive place invariants in 964 ms returned sat
[2025-06-03 14:28:03] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 195 ms returned sat
[2025-06-03 14:28:05] [INFO ] [Real]Absence check using state equation in 2367 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:28:07] [INFO ] [Real]Absence check using 241 positive place invariants in 971 ms returned sat
[2025-06-03 14:28:08] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 190 ms returned sat
[2025-06-03 14:28:10] [INFO ] [Real]Absence check using state equation in 2371 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:28:12] [INFO ] [Real]Absence check using 241 positive place invariants in 745 ms returned sat
[2025-06-03 14:28:12] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 166 ms returned sat
[2025-06-03 14:28:15] [INFO ] [Real]Absence check using state equation in 2741 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:28:17] [INFO ] [Real]Absence check using 241 positive place invariants in 925 ms returned sat
[2025-06-03 14:28:18] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 174 ms returned sat
[2025-06-03 14:28:20] [INFO ] [Real]Absence check using state equation in 2375 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 14:28:22] [INFO ] [Real]Absence check using 241 positive place invariants in 851 ms returned sat
[2025-06-03 14:28:22] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 161 ms returned sat
[2025-06-03 14:28:25] [INFO ] [Real]Absence check using state equation in 2554 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7991 transitions
Trivial Post-agglo rules discarded 7991 transitions
Performed 7991 trivial Post agglomeration. Transition count delta: 7991
Iterating post reduction 0 with 7991 rules applied. Total rules applied 7991 place count 8841 transition count 8409
Reduce places removed 8023 places and 0 transitions.
Ensure Unique test removed 6200 transitions
Reduce isomorphic transitions removed 6200 transitions.
Iterating post reduction 1 with 14223 rules applied. Total rules applied 22214 place count 818 transition count 2209
Drop transitions (Redundant composition of simpler transitions.) removed 1591 transitions
Redundant transition composition rules discarded 1591 transitions
Iterating global reduction 2 with 1591 rules applied. Total rules applied 23805 place count 818 transition count 618
Discarding 191 places :
Implicit places reduction removed 191 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 2 with 573 rules applied. Total rules applied 24378 place count 627 transition count 236
Reduce places removed 573 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 3 with 764 rules applied. Total rules applied 25142 place count 54 transition count 45
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 25151 place count 54 transition count 45
Applied a total of 25151 rules in 335 ms. Remains 54 /8841 variables (removed 8787) and now considering 45/16400 (removed 16355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 54/8841 places, 45/16400 transitions.
// Phase 1: matrix 45 rows 54 cols
[2025-06-03 14:28:25] [INFO ] Computed 27 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1142 ms. (874 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 491 ms. (2032 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-03 14:28:27] [INFO ] Flatten gal took : 28 ms
[2025-06-03 14:28:27] [INFO ] Flatten gal took : 7 ms
[2025-06-03 14:28:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16776992218980985242.gal : 5 ms
[2025-06-03 14:28:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14299644948310993311.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/ReachabilityCardinality16776992218980985242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14299644948310993311.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 49807 ms.

BK_STOP 1748960907810

--------------------
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="ServersAndClients-PT-200040"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ServersAndClients-PT-200040, 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 r198-tall-174894532000045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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