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.r329-tall-167889201900359.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 Raft-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201900359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K Feb 26 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:23 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 Raft-PT-10-ReachabilityFireability-00
FORMULA_NAME Raft-PT-10-ReachabilityFireability-01
FORMULA_NAME Raft-PT-10-ReachabilityFireability-02
FORMULA_NAME Raft-PT-10-ReachabilityFireability-03
FORMULA_NAME Raft-PT-10-ReachabilityFireability-04
FORMULA_NAME Raft-PT-10-ReachabilityFireability-05
FORMULA_NAME Raft-PT-10-ReachabilityFireability-06
FORMULA_NAME Raft-PT-10-ReachabilityFireability-07
FORMULA_NAME Raft-PT-10-ReachabilityFireability-08
FORMULA_NAME Raft-PT-10-ReachabilityFireability-09
FORMULA_NAME Raft-PT-10-ReachabilityFireability-10
FORMULA_NAME Raft-PT-10-ReachabilityFireability-11
FORMULA_NAME Raft-PT-10-ReachabilityFireability-12
FORMULA_NAME Raft-PT-10-ReachabilityFireability-13
FORMULA_NAME Raft-PT-10-ReachabilityFireability-14
FORMULA_NAME Raft-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679120892909

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Raft-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 06:28:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 06:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:28:14] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-18 06:28:14] [INFO ] Transformed 508 places.
[2023-03-18 06:28:14] [INFO ] Transformed 868 transitions.
[2023-03-18 06:28:14] [INFO ] Found NUPN structural information;
[2023-03-18 06:28:14] [INFO ] Parsed PT model containing 508 places and 868 transitions and 3359 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 42 transitions
Reduce redundant transitions removed 42 transitions.
FORMULA Raft-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 11) seen :10
FORMULA Raft-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-10-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:28:15] [INFO ] Flow matrix only has 780 transitions (discarded 46 similar events)
// Phase 1: matrix 780 rows 508 cols
[2023-03-18 06:28:15] [INFO ] Computed 100 place invariants in 21 ms
[2023-03-18 06:28:15] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:28:15] [INFO ] [Nat]Absence check using 100 positive place invariants in 26 ms returned sat
[2023-03-18 06:28:15] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:15] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-03-18 06:28:16] [INFO ] After 191ms SMT Verify possible using 454 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:16] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-18 06:28:16] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 42 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 826/826 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 508 transition count 815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 508 transition count 814
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 13 place count 507 transition count 814
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 498 transition count 796
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 498 transition count 796
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 498 transition count 786
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 59 place count 489 transition count 777
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 133 place count 415 transition count 703
Iterating global reduction 1 with 74 rules applied. Total rules applied 207 place count 415 transition count 703
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 281 place count 415 transition count 629
Applied a total of 281 rules in 205 ms. Remains 415 /508 variables (removed 93) and now considering 629/826 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 415/508 places, 629/826 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 572626 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572626 steps, saw 480612 distinct states, run finished after 3002 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:28:19] [INFO ] Flow matrix only has 601 transitions (discarded 28 similar events)
// Phase 1: matrix 601 rows 415 cols
[2023-03-18 06:28:19] [INFO ] Computed 101 place invariants in 11 ms
[2023-03-18 06:28:19] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:28:20] [INFO ] [Nat]Absence check using 101 positive place invariants in 19 ms returned sat
[2023-03-18 06:28:20] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:20] [INFO ] State equation strengthened by 379 read => feed constraints.
[2023-03-18 06:28:20] [INFO ] After 134ms SMT Verify possible using 379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:20] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-18 06:28:20] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 42 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 629/629 transitions.
Applied a total of 0 rules in 32 ms. Remains 415 /415 variables (removed 0) and now considering 629/629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 415/415 places, 629/629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 629/629 transitions.
Applied a total of 0 rules in 24 ms. Remains 415 /415 variables (removed 0) and now considering 629/629 (removed 0) transitions.
[2023-03-18 06:28:20] [INFO ] Flow matrix only has 601 transitions (discarded 28 similar events)
[2023-03-18 06:28:20] [INFO ] Invariant cache hit.
[2023-03-18 06:28:20] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-18 06:28:20] [INFO ] Flow matrix only has 601 transitions (discarded 28 similar events)
[2023-03-18 06:28:20] [INFO ] Invariant cache hit.
[2023-03-18 06:28:21] [INFO ] State equation strengthened by 379 read => feed constraints.
[2023-03-18 06:28:21] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2023-03-18 06:28:21] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-18 06:28:21] [INFO ] Flow matrix only has 601 transitions (discarded 28 similar events)
[2023-03-18 06:28:21] [INFO ] Invariant cache hit.
[2023-03-18 06:28:22] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1345 ms. Remains : 415/415 places, 629/629 transitions.
Graph (trivial) has 310 edges and 415 vertex of which 148 / 415 are part of one of the 74 SCC in 3 ms
Free SCC test removed 74 places
Drop transitions removed 148 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 331 transition count 443
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 331 transition count 443
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 107 place count 245 transition count 357
Iterating global reduction 0 with 86 rules applied. Total rules applied 193 place count 245 transition count 357
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 279 place count 245 transition count 271
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 279 place count 245 transition count 211
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 1 with 120 rules applied. Total rules applied 399 place count 185 transition count 211
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 450 place count 134 transition count 160
Iterating global reduction 1 with 51 rules applied. Total rules applied 501 place count 134 transition count 160
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 509 place count 130 transition count 175
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 528 place count 130 transition count 156
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 547 place count 111 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 548 place count 110 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 549 place count 110 transition count 154
Applied a total of 549 rules in 90 ms. Remains 110 /415 variables (removed 305) and now considering 154/629 (removed 475) transitions.
Running SMT prover for 1 properties.
[2023-03-18 06:28:22] [INFO ] Flow matrix only has 131 transitions (discarded 23 similar events)
// Phase 1: matrix 131 rows 110 cols
[2023-03-18 06:28:22] [INFO ] Computed 49 place invariants in 2 ms
[2023-03-18 06:28:22] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:28:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 6 ms returned sat
[2023-03-18 06:28:22] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-18 06:28:22] [INFO ] After 52ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:22] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-18 06:28:22] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:28:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-18 06:28:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 415 places, 629 transitions and 2568 arcs took 5 ms.
[2023-03-18 06:28:22] [INFO ] Flatten gal took : 76 ms
Total runtime 8298 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/489/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 16025340 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093676 kB
Could not compute solution for formula : Raft-PT-10-ReachabilityFireability-05

BK_STOP 1679124474894

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name Raft-PT-10-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/489/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 415 places, 629 transitions and 2568 arcs
pnml2lts-sym: Petri net Raft_PT_10 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 629->608 groups
pnml2lts-sym: Regrouping took 0.360 real 0.360 user 0.000 sys
pnml2lts-sym: state vector length is 415; there are 608 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
Killing (15) : 495
Killing (9) : 495

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="Raft-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
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 Raft-PT-10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201900359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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