fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r532-smll-171683810700063
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
496.508 16189.00 36379.00 115.00 TTTFTTFTTTFTTFFT normal

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.r532-smll-171683810700063.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 SieveSingleMsgMbox-PT-d1m06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717243224967

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:00:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:00:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:00:27] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2024-06-01 12:00:27] [INFO ] Transformed 1295 places.
[2024-06-01 12:00:27] [INFO ] Transformed 749 transitions.
[2024-06-01 12:00:27] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 663 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 22 ms
Reduce places removed 1036 places and 0 transitions.
RANDOM walk for 40000 steps (8902 resets) in 3988 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (203 resets) in 86 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (193 resets) in 134 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (184 resets) in 165 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (175 resets) in 269 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (169 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (182 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (186 resets) in 177 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (198 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (190 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (180 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (183 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (189 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (386 resets) in 134 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (183 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (204 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 327998 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :11 out of 16
Probabilistic random walk after 327998 steps, saw 119796 distinct states, run finished after 3008 ms. (steps per millisecond=109 ) properties seen :11
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:00:32] [INFO ] Computed 6 invariants in 34 ms
[2024-06-01 12:00:32] [INFO ] State equation strengthened by 587 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/142 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-14 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 117/259 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 12:00:33] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 18 ms to minimize.
[2024-06-01 12:00:33] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 749/1008 variables, 259/267 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 587/854 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1008 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 854 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1817 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/110 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/137 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 122/259 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 12:00:35] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 4 ms to minimize.
[2024-06-01 12:00:35] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 749/1008 variables, 259/269 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 587/856 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 4/860 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 12:00:37] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-06-01 12:00:37] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 6 ms to minimize.
[2024-06-01 12:00:37] [INFO ] Deduced a trap composed of 156 places in 306 ms of which 4 ms to minimize.
[2024-06-01 12:00:38] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 3 ms to minimize.
[2024-06-01 12:00:38] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1008 variables, 5/865 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1008 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 865 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 7105ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 296 place count 188 transition count 334
Iterating global reduction 1 with 53 rules applied. Total rules applied 349 place count 188 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 188 transition count 328
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 392 place count 151 transition count 291
Iterating global reduction 2 with 37 rules applied. Total rules applied 429 place count 151 transition count 291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 439 place count 151 transition count 281
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 460 place count 130 transition count 258
Iterating global reduction 3 with 21 rules applied. Total rules applied 481 place count 130 transition count 258
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 525 place count 130 transition count 214
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 530 place count 125 transition count 206
Iterating global reduction 4 with 5 rules applied. Total rules applied 535 place count 125 transition count 206
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 540 place count 120 transition count 201
Iterating global reduction 4 with 5 rules applied. Total rules applied 545 place count 120 transition count 201
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 548 place count 117 transition count 197
Iterating global reduction 4 with 3 rules applied. Total rules applied 551 place count 117 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 554 place count 114 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 557 place count 114 transition count 194
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 560 place count 111 transition count 191
Iterating global reduction 4 with 3 rules applied. Total rules applied 563 place count 111 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 564 place count 110 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 565 place count 110 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 566 place count 109 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 567 place count 109 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 568 place count 108 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 569 place count 108 transition count 187
Applied a total of 569 rules in 237 ms. Remains 108 /259 variables (removed 151) and now considering 187/749 (removed 562) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 108/259 places, 187/749 transitions.
RANDOM walk for 40000 steps (9040 resets) in 460 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1938 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 46675 steps, run visited all 4 properties in 555 ms. (steps per millisecond=84 )
Probabilistic random walk after 46675 steps, saw 20665 distinct states, run finished after 578 ms. (steps per millisecond=80 ) properties seen :4
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m06-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 13978 ms.
ITS solved all properties within timeout

BK_STOP 1717243241156

--------------------
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 ReachabilityFireability -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="SieveSingleMsgMbox-PT-d1m06"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r532-smll-171683810700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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