Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481000315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678275189973

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 11:33:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 11:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:33:11] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-08 11:33:11] [INFO ] Transformed 4763 places.
[2023-03-08 11:33:11] [INFO ] Transformed 2478 transitions.
[2023-03-08 11:33:11] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 634 place count 748 transition count 1211
Iterating global reduction 1 with 389 rules applied. Total rules applied 1023 place count 748 transition count 1211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1032 place count 748 transition count 1202
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1348 place count 432 transition count 886
Iterating global reduction 2 with 316 rules applied. Total rules applied 1664 place count 432 transition count 886
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1675 place count 432 transition count 875
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1914 place count 193 transition count 537
Iterating global reduction 3 with 239 rules applied. Total rules applied 2153 place count 193 transition count 537
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2364 place count 193 transition count 326
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2388 place count 169 transition count 282
Iterating global reduction 4 with 24 rules applied. Total rules applied 2412 place count 169 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2417 place count 169 transition count 277
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2433 place count 153 transition count 261
Iterating global reduction 5 with 16 rules applied. Total rules applied 2449 place count 153 transition count 261
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2453 place count 153 transition count 257
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2466 place count 140 transition count 244
Iterating global reduction 6 with 13 rules applied. Total rules applied 2479 place count 140 transition count 244
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2490 place count 140 transition count 233
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2497 place count 133 transition count 197
Iterating global reduction 7 with 7 rules applied. Total rules applied 2504 place count 133 transition count 197
Applied a total of 2504 rules in 205 ms. Remains 133 /1183 variables (removed 1050) and now considering 197/2478 (removed 2281) transitions.
// Phase 1: matrix 197 rows 133 cols
[2023-03-08 11:33:12] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-08 11:33:12] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-08 11:33:12] [INFO ] Invariant cache hit.
[2023-03-08 11:33:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 11:33:13] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-08 11:33:13] [INFO ] Invariant cache hit.
[2023-03-08 11:33:13] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/1183 places, 197/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1330 ms. Remains : 133/1183 places, 197/2478 transitions.
Support contains 4 out of 133 places after structural reductions.
[2023-03-08 11:33:13] [INFO ] Flatten gal took : 38 ms
[2023-03-08 11:33:13] [INFO ] Flatten gal took : 19 ms
[2023-03-08 11:33:13] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:33:14] [INFO ] Invariant cache hit.
[2023-03-08 11:33:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 11:33:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:33:14] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-08 11:33:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 11:33:14] [INFO ] After 19ms SMT Verify possible using 66 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 11:33:14] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 11:33:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 11:33:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:33:14] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 11:33:14] [INFO ] After 35ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 11:33:14] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:33:14] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 197/197 transitions.
Graph (complete) has 456 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 132 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 130 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 130 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 128 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 128 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 128 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 126 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 126 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 126 transition count 174
Applied a total of 21 rules in 26 ms. Remains 126 /133 variables (removed 7) and now considering 174/197 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 126/133 places, 174/197 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21002 steps, run visited all 1 properties in 98 ms. (steps per millisecond=214 )
Probabilistic random walk after 21002 steps, saw 10340 distinct states, run finished after 98 ms. (steps per millisecond=214 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 487 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 197/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 129 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 129 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 129 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 127 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 127 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 127 transition count 178
Applied a total of 16 rules in 5 ms. Remains 127 /133 variables (removed 6) and now considering 178/197 (removed 19) transitions.
// Phase 1: matrix 178 rows 127 cols
[2023-03-08 11:33:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 11:33:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 11:33:15] [INFO ] Invariant cache hit.
[2023-03-08 11:33:15] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 11:33:15] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-08 11:33:15] [INFO ] Invariant cache hit.
[2023-03-08 11:33:15] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/133 places, 178/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 127/133 places, 178/197 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLCardinality-07 finished in 739 ms.
All properties solved by simple procedures.
Total runtime 4191 ms.
ITS solved all properties within timeout

BK_STOP 1678275196759

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481000315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m07.tgz
mv DBSingleClientW-PT-d2m07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;