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.r508-tall-171654351900581.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 NoC3x3-PT-2B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351900581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K May 18 16:43 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 NoC3x3-PT-2B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717240572143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:16:13] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 11:16:13] [INFO ] Transformed 2003 places.
[2024-06-01 11:16:13] [INFO ] Transformed 2292 transitions.
[2024-06-01 11:16:13] [INFO ] Found NUPN structural information;
[2024-06-01 11:16:13] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 295 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 2292 rows 2003 cols
[2024-06-01 11:16:13] [INFO ] Computed 66 invariants in 47 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 (17 resets) in 67 ms. (147 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 11:16:13] [INFO ] Invariant cache hit.
[2024-06-01 11:16:14] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2024-06-01 11:16:15] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2024-06-01 11:16:15] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 52 ms to minimize.
[2024-06-01 11:16:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:16:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-06-01 11:16:17] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2024-06-01 11:16:17] [INFO ] Deduced a trap composed of 28 places in 364 ms of which 14 ms to minimize.
[2024-06-01 11:16:17] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 5 ms to minimize.
[2024-06-01 11:16:18] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 5 ms to minimize.
[2024-06-01 11:16:18] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 5 ms to minimize.
[2024-06-01 11:16:18] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 4 ms to minimize.
[2024-06-01 11:16:19] [INFO ] Deduced a trap composed of 80 places in 307 ms of which 4 ms to minimize.
[2024-06-01 11:16:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2312 ms
[2024-06-01 11:16:19] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 191 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 11:16:21] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2024-06-01 11:16:22] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2024-06-01 11:16:22] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 6 ms to minimize.
[2024-06-01 11:16:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:16:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2024-06-01 11:16:23] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-06-01 11:16:24] [INFO ] Deduced a trap composed of 75 places in 299 ms of which 6 ms to minimize.
[2024-06-01 11:16:24] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 5 ms to minimize.
[2024-06-01 11:16:24] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 5 ms to minimize.
[2024-06-01 11:16:25] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 4 ms to minimize.
[2024-06-01 11:16:25] [INFO ] Deduced a trap composed of 98 places in 184 ms of which 4 ms to minimize.
[2024-06-01 11:16:25] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-06-01 11:16:25] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 3 ms to minimize.
[2024-06-01 11:16:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2006 ms
[2024-06-01 11:16:25] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 121 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 11:16:28] [INFO ] [Real]Absence check using 66 positive place invariants in 61 ms returned sat
[2024-06-01 11:16:28] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-06-01 11:16:29] [INFO ] Deduced a trap composed of 84 places in 469 ms of which 29 ms to minimize.
[2024-06-01 11:16:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:16:29] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-06-01 11:16:30] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-06-01 11:16:31] [INFO ] Deduced a trap composed of 84 places in 435 ms of which 7 ms to minimize.
[2024-06-01 11:16:31] [INFO ] Deduced a trap composed of 53 places in 371 ms of which 7 ms to minimize.
[2024-06-01 11:16:31] [INFO ] Deduced a trap composed of 104 places in 343 ms of which 6 ms to minimize.
[2024-06-01 11:16:32] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 3 ms to minimize.
[2024-06-01 11:16:32] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 4 ms to minimize.
[2024-06-01 11:16:32] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 3 ms to minimize.
[2024-06-01 11:16:32] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-06-01 11:16:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2305 ms
[2024-06-01 11:16:32] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 110 ms.
[2024-06-01 11:16:34] [INFO ] Added : 85 causal constraints over 17 iterations in 1641 ms. Result :unknown
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, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1631 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 8 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 405 transitions
Trivial Post-agglo rules discarded 405 transitions
Performed 405 trivial Post agglomeration. Transition count delta: 405
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 1931 transition count 1815
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 1 with 405 rules applied. Total rules applied 820 place count 1526 transition count 1815
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1791
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1791
Discarding 348 places :
Symmetric choice reduction at 2 with 348 rule applications. Total rules 1216 place count 1154 transition count 1443
Iterating global reduction 2 with 348 rules applied. Total rules applied 1564 place count 1154 transition count 1443
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 1564 place count 1154 transition count 1402
Deduced a syphon composed of 41 places in 8 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1646 place count 1113 transition count 1402
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 1777 place count 982 transition count 1231
Iterating global reduction 2 with 131 rules applied. Total rules applied 1908 place count 982 transition count 1231
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 2031 place count 859 transition count 1094
Iterating global reduction 2 with 123 rules applied. Total rules applied 2154 place count 859 transition count 1094
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2202 place count 811 transition count 1010
Iterating global reduction 2 with 48 rules applied. Total rules applied 2250 place count 811 transition count 1010
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 2268 place count 809 transition count 994
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2270 place count 807 transition count 994
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 2304 place count 773 transition count 960
Iterating global reduction 4 with 34 rules applied. Total rules applied 2338 place count 773 transition count 960
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 2342 place count 771 transition count 958
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2344 place count 769 transition count 958
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2367 place count 746 transition count 912
Iterating global reduction 6 with 23 rules applied. Total rules applied 2390 place count 746 transition count 912
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2413 place count 723 transition count 889
Iterating global reduction 6 with 23 rules applied. Total rules applied 2436 place count 723 transition count 889
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 29 rules applied. Total rules applied 2465 place count 720 transition count 863
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2468 place count 717 transition count 863
Performed 301 Post agglomeration using F-continuation condition.Transition count delta: 301
Deduced a syphon composed of 301 places in 1 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 8 with 602 rules applied. Total rules applied 3070 place count 416 transition count 562
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3082 place count 404 transition count 550
Iterating global reduction 8 with 12 rules applied. Total rules applied 3094 place count 404 transition count 550
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3103 place count 395 transition count 532
Iterating global reduction 8 with 9 rules applied. Total rules applied 3112 place count 395 transition count 532
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3114 place count 393 transition count 528
Iterating global reduction 8 with 2 rules applied. Total rules applied 3116 place count 393 transition count 528
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 3148 place count 377 transition count 551
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 3171 place count 377 transition count 528
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 3201 place count 354 transition count 521
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3202 place count 354 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3203 place count 353 transition count 520
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3204 place count 353 transition count 520
Applied a total of 3204 rules in 825 ms. Remains 353 /2003 variables (removed 1650) and now considering 520/2292 (removed 1772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 837 ms. Remains : 353/2003 places, 520/2292 transitions.
// Phase 1: matrix 520 rows 353 cols
[2024-06-01 11:16:35] [INFO ] Computed 53 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA NoC3x3-PT-2B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (13926 resets) in 3924 ms. (254 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (781 resets) in 1227 ms. (814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 27618 ms.
ITS solved all properties within timeout

BK_STOP 1717240600916

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

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