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.r013-tall-174853743100091.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 AutonomousCar-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743100091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 517K 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 AutonomousCar-PT-08b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748541195192

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:53:16] [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-05-29 17:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:53:16] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2025-05-29 17:53:16] [INFO ] Transformed 357 places.
[2025-05-29 17:53:16] [INFO ] Transformed 1128 transitions.
[2025-05-29 17:53:16] [INFO ] Found NUPN structural information;
[2025-05-29 17:53:16] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1128 rows 357 cols
[2025-05-29 17:53:16] [INFO ] Computed 13 invariants in 39 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 (87 resets) in 62 ms. (158 steps per ms)
FORMULA AutonomousCar-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (42 resets) in 55 ms. (535 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:53:16] [INFO ] Invariant cache hit.
[2025-05-29 17:53:17] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2025-05-29 17:53:17] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-05-29 17:53:17] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 24 ms to minimize.
[2025-05-29 17:53:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:18] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-29 17:53:18] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 2 ms to minimize.
[2025-05-29 17:53:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2025-05-29 17:53:18] [INFO ] Computed and/alt/rep : 289/332/289 causal constraints (skipped 838 transitions) in 217 ms.
[2025-05-29 17:53:20] [INFO ] Added : 135 causal constraints over 27 iterations in 1590 ms. Result :sat
Minimization took 690 ms.
[2025-05-29 17:53:20] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:21] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-29 17:53:21] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 2 ms to minimize.
[2025-05-29 17:53:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:21] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2025-05-29 17:53:22] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 2 ms to minimize.
[2025-05-29 17:53:22] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 3 ms to minimize.
[2025-05-29 17:53:22] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 3 ms to minimize.
[2025-05-29 17:53:23] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2025-05-29 17:53:23] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 2 ms to minimize.
[2025-05-29 17:53:23] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 1 ms to minimize.
[2025-05-29 17:53:23] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2025-05-29 17:53:24] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2025-05-29 17:53:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2286 ms
[2025-05-29 17:53:24] [INFO ] Computed and/alt/rep : 289/332/289 causal constraints (skipped 838 transitions) in 413 ms.
[2025-05-29 17:53:25] [INFO ] Added : 144 causal constraints over 30 iterations in 1735 ms. Result :sat
Minimization took 685 ms.
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-29 17:53:27] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 2 ms to minimize.
[2025-05-29 17:53:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:27] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-29 17:53:27] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 3 ms to minimize.
[2025-05-29 17:53:28] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 2 ms to minimize.
[2025-05-29 17:53:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2025-05-29 17:53:28] [INFO ] Computed and/alt/rep : 289/332/289 causal constraints (skipped 838 transitions) in 125 ms.
[2025-05-29 17:53:29] [INFO ] Added : 104 causal constraints over 21 iterations in 1057 ms. Result :sat
Minimization took 683 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 339 edges and 357 vertex of which 2 / 357 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 353 transition count 964
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 203 rules applied. Total rules applied 365 place count 194 transition count 920
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 391 place count 169 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 168 transition count 919
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 392 place count 168 transition count 912
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 406 place count 161 transition count 912
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 437 place count 130 transition count 881
Iterating global reduction 4 with 31 rules applied. Total rules applied 468 place count 130 transition count 881
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 724 place count 130 transition count 625
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 724 place count 130 transition count 623
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 728 place count 128 transition count 623
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 737 place count 119 transition count 558
Iterating global reduction 5 with 9 rules applied. Total rules applied 746 place count 119 transition count 558
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 16 rules applied. Total rules applied 762 place count 119 transition count 542
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 770 place count 111 transition count 542
Performed 40 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 850 place count 71 transition count 501
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 858 place count 63 transition count 429
Iterating global reduction 7 with 8 rules applied. Total rules applied 866 place count 63 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 867 place count 63 transition count 428
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 875 place count 63 transition count 420
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 883 place count 55 transition count 420
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 884 place count 55 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 885 place count 54 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 886 place count 53 transition count 419
Applied a total of 886 rules in 302 ms. Remains 53 /357 variables (removed 304) and now considering 419/1128 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 53/357 places, 419/1128 transitions.
// Phase 1: matrix 419 rows 53 cols
[2025-05-29 17:53:30] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (5 resets) in 770 ms. (1297 steps per ms)
FORMULA AutonomousCar-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (4 resets) in 667 ms. (1497 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-05-29 17:53:32] [INFO ] Flatten gal took : 153 ms
[2025-05-29 17:53:32] [INFO ] Flatten gal took : 76 ms
[2025-05-29 17:53:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality772093857395538942.gal : 30 ms
[2025-05-29 17:53:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10401905783107069043.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/ReachabilityCardinality772093857395538942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10401905783107069043.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 15821 ms.

BK_STOP 1748541212275

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

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