Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901200213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FireWire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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

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

=== Now, execution of the tool begins

BK_START 1717354229107

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:50:30] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:50:30] [INFO ] Transformed 116 places.
[2024-06-02 18:50:30] [INFO ] Transformed 368 transitions.
[2024-06-02 18:50:30] [INFO ] Found NUPN structural information;
[2024-06-02 18:50:30] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 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]
[2024-06-02 18:50:30] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:50:30] [INFO ] Computed 9 invariants in 21 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 (510 resets) in 40 ms. (243 steps per ms)
FORMULA FireWire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (889 resets) in 76 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:50:30] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 18:50:30] [INFO ] Invariant cache hit.
[2024-06-02 18:50:30] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 18:50:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 18:50:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:50:31] [INFO ] [Real]Added 41 Read/Feed constraints in 15 ms returned sat
[2024-06-02 18:50:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-06-02 18:50:31] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 43 ms.
[2024-06-02 18:50:31] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Minimization took 93 ms.
[2024-06-02 18:50:31] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:50:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 18:50:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-06-02 18:50:31] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 31 ms.
[2024-06-02 18:50:31] [INFO ] Added : 34 causal constraints over 7 iterations in 153 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 18:50:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Real]Added 41 Read/Feed constraints in 21 ms returned sat
[2024-06-02 18:50:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:50:32] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 26 ms.
[2024-06-02 18:50:32] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 12 ms to minimize.
[2024-06-02 18:50:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:50:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2024-06-02 18:50:32] [INFO ] Added : 31 causal constraints over 9 iterations in 405 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 18:50:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:50:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 18:50:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:50:32] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 30 ms.
[2024-06-02 18:50:33] [INFO ] Added : 12 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 18:50:33] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Real]Added 41 Read/Feed constraints in 8 ms returned sat
[2024-06-02 18:50:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-06-02 18:50:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-02 18:50:33] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 26 ms.
[2024-06-02 18:50:33] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 18:50:33] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Real]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-06-02 18:50:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:50:33] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:50:33] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 20 ms.
[2024-06-02 18:50:34] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 18:50:34] [INFO ] Added : 45 causal constraints over 10 iterations in 302 ms. Result :sat
Minimization took 116 ms.
[2024-06-02 18:50:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:34] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:50:34] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:50:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:50:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:50:34] [INFO ] [Nat]Added 41 Read/Feed constraints in 20 ms returned sat
[2024-06-02 18:50:34] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 19 ms.
[2024-06-02 18:50:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:50:34] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:50:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-06-02 18:50:34] [INFO ] Added : 41 causal constraints over 10 iterations in 346 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 116 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p21) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 310/310 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 306
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 112 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 109 transition count 309
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 109 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 34 place count 109 transition count 292
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 109 transition count 294
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 108 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 108 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 106 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 106 transition count 288
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 105 transition count 288
Applied a total of 44 rules in 114 ms. Remains 105 /116 variables (removed 11) and now considering 288/310 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 105/116 places, 288/310 transitions.
[2024-06-02 18:50:35] [INFO ] Flow matrix only has 260 transitions (discarded 28 similar events)
// Phase 1: matrix 260 rows 105 cols
[2024-06-02 18:50:35] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (60697 resets) in 1105 ms. (904 steps per ms)
FORMULA FireWire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (15088 resets) in 408 ms. (2444 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 6775 ms.
ITS solved all properties within timeout

BK_STOP 1717354237116

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FireWire-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-06, 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 r553-tall-171734901200213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-06.tgz
mv FireWire-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;