fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r299-tajo-171654455700139
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1082.623 104968.00 133514.00 70.60 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r299-tajo-171654455700139.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717141525527

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-31 07:45:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:45:26] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-31 07:45:26] [INFO ] Transformed 476 places.
[2024-05-31 07:45:26] [INFO ] Transformed 920 transitions.
[2024-05-31 07:45:26] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 210 ms.
Discarding 96 transitions out of 920. Remains 824
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.21463KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 54 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-31 07:45:27] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-31 07:45:27] [INFO ] Computed 46 invariants in 50 ms
[2024-05-31 07:45:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:45:33] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 16 ms to minimize.
[2024-05-31 07:45:33] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-31 07:45:33] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-31 07:45:34] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-31 07:45:34] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-31 07:45:34] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-05-31 07:45:34] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-31 07:45:34] [INFO ] Deduced a trap composed of 282 places in 178 ms of which 3 ms to minimize.
[2024-05-31 07:45:35] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-31 07:45:35] [INFO ] Deduced a trap composed of 322 places in 181 ms of which 3 ms to minimize.
[2024-05-31 07:45:35] [INFO ] Deduced a trap composed of 229 places in 182 ms of which 3 ms to minimize.
[2024-05-31 07:45:35] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-31 07:45:36] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 3 ms to minimize.
[2024-05-31 07:45:36] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 4 ms to minimize.
[2024-05-31 07:45:37] [INFO ] Deduced a trap composed of 269 places in 250 ms of which 3 ms to minimize.
[2024-05-31 07:45:40] [INFO ] Deduced a trap composed of 318 places in 272 ms of which 3 ms to minimize.
[2024-05-31 07:45:40] [INFO ] Deduced a trap composed of 242 places in 216 ms of which 3 ms to minimize.
[2024-05-31 07:45:41] [INFO ] Deduced a trap composed of 223 places in 284 ms of which 3 ms to minimize.
[2024-05-31 07:45:41] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 55 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20071 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:45:55] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 4 ms to minimize.
[2024-05-31 07:45:55] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-05-31 07:45:55] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 4 ms to minimize.
[2024-05-31 07:45:56] [INFO ] Deduced a trap composed of 251 places in 169 ms of which 2 ms to minimize.
[2024-05-31 07:45:56] [INFO ] Deduced a trap composed of 193 places in 173 ms of which 3 ms to minimize.
[2024-05-31 07:45:56] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 3 ms to minimize.
[2024-05-31 07:45:56] [INFO ] Deduced a trap composed of 271 places in 186 ms of which 3 ms to minimize.
[2024-05-31 07:45:57] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-05-31 07:45:57] [INFO ] Deduced a trap composed of 275 places in 183 ms of which 3 ms to minimize.
[2024-05-31 07:45:57] [INFO ] Deduced a trap composed of 272 places in 202 ms of which 3 ms to minimize.
[2024-05-31 07:45:57] [INFO ] Deduced a trap composed of 260 places in 199 ms of which 3 ms to minimize.
[2024-05-31 07:45:58] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 2 ms to minimize.
[2024-05-31 07:45:58] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 2 ms to minimize.
[2024-05-31 07:45:58] [INFO ] Deduced a trap composed of 274 places in 186 ms of which 3 ms to minimize.
[2024-05-31 07:45:59] [INFO ] Deduced a trap composed of 159 places in 222 ms of which 4 ms to minimize.
[2024-05-31 07:45:59] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 11 ms to minimize.
[2024-05-31 07:45:59] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 2 ms to minimize.
[2024-05-31 07:46:00] [INFO ] Deduced a trap composed of 282 places in 178 ms of which 3 ms to minimize.
[2024-05-31 07:46:00] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 2 ms to minimize.
[2024-05-31 07:46:00] [INFO ] Deduced a trap composed of 297 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:46:05] [INFO ] Deduced a trap composed of 269 places in 258 ms of which 4 ms to minimize.
[2024-05-31 07:46:07] [INFO ] Deduced a trap composed of 279 places in 250 ms of which 4 ms to minimize.
[2024-05-31 07:46:07] [INFO ] Deduced a trap composed of 304 places in 251 ms of which 4 ms to minimize.
[2024-05-31 07:46:07] [INFO ] Deduced a trap composed of 275 places in 229 ms of which 4 ms to minimize.
[2024-05-31 07:46:07] [INFO ] Deduced a trap composed of 285 places in 187 ms of which 2 ms to minimize.
[2024-05-31 07:46:08] [INFO ] Deduced a trap composed of 252 places in 213 ms of which 3 ms to minimize.
[2024-05-31 07:46:08] [INFO ] Deduced a trap composed of 272 places in 207 ms of which 3 ms to minimize.
SMT process timed out in 41228ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41269ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41370 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 29 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-05-31 07:46:08] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:46:08] [INFO ] Invariant cache hit.
[2024-05-31 07:46:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 07:46:08] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:46:08] [INFO ] Invariant cache hit.
[2024-05-31 07:46:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 07:46:09] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-31 07:46:09] [INFO ] Redundant transitions in 41 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 07:46:09] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:46:09] [INFO ] Invariant cache hit.
[2024-05-31 07:46:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:46:14] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 0 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 2 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 277 places in 238 ms of which 3 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 3 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 3 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 12 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 223 places in 217 ms of which 4 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 290 places in 244 ms of which 3 ms to minimize.
[2024-05-31 07:46:18] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 4 ms to minimize.
[2024-05-31 07:46:18] [INFO ] Deduced a trap composed of 262 places in 210 ms of which 4 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 3 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 215 places in 206 ms of which 4 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:46:30] [INFO ] Deduced a trap composed of 265 places in 215 ms of which 3 ms to minimize.
[2024-05-31 07:46:30] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 56 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:46:50] [INFO ] Deduced a trap composed of 279 places in 247 ms of which 3 ms to minimize.
[2024-05-31 07:46:52] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 3 ms to minimize.
[2024-05-31 07:46:52] [INFO ] Deduced a trap composed of 222 places in 233 ms of which 4 ms to minimize.
[2024-05-31 07:46:52] [INFO ] Deduced a trap composed of 226 places in 179 ms of which 3 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 264 places in 209 ms of which 3 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 261 places in 180 ms of which 3 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 260 places in 170 ms of which 4 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 255 places in 175 ms of which 3 ms to minimize.
[2024-05-31 07:46:54] [INFO ] Deduced a trap composed of 287 places in 182 ms of which 3 ms to minimize.
[2024-05-31 07:46:54] [INFO ] Deduced a trap composed of 264 places in 210 ms of which 2 ms to minimize.
[2024-05-31 07:46:54] [INFO ] Deduced a trap composed of 268 places in 185 ms of which 3 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 275 places in 232 ms of which 4 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 238 places in 230 ms of which 3 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 286 places in 223 ms of which 4 ms to minimize.
[2024-05-31 07:46:59] [INFO ] Deduced a trap composed of 265 places in 204 ms of which 3 ms to minimize.
[2024-05-31 07:47:00] [INFO ] Deduced a trap composed of 276 places in 360 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 72 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 36/36 constraints]
After SMT, in 61010ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 61023ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61826 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 9831 steps, including 0 resets, run found a deadlock after 112 ms. (steps per millisecond=87 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 103703 ms.

BK_STOP 1717141630495

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is PolyORBLF-PT-S02J04T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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