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

About the Execution of GreatSPN+red for PhilosophersDyn-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16200.563 1800000.00 6805923.00 275.90 [undef] Time out reached

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.r298-tajo-171654454700040.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 greatspnxred
Input is PhilosophersDyn-PT-20, examination is OneSafe
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454700040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 93M
-rw-r--r-- 1 mcc users 145K Apr 11 16:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 604K Apr 11 16:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 11 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 306K Apr 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3M Apr 11 18:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45M Apr 11 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K 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 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 OneSafe

=== Now, execution of the tool begins

BK_START 1717103286982

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=OneSafe
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PhilosophersDyn-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:08:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, OneSafe, -timeout, 180, -rebuildPNML]
[2024-05-30 21:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:08:09] [INFO ] Load time of PNML (sax parser for PT used): 1193 ms
[2024-05-30 21:08:10] [INFO ] Transformed 540 places.
[2024-05-30 21:08:10] [INFO ] Transformed 17220 transitions.
[2024-05-30 21:08:10] [INFO ] Parsed PT model containing 540 places and 17220 transitions and 140780 arcs in 1677 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Normalized transition count is 15510 out of 17030 initially.
// Phase 1: matrix 15510 rows 540 cols
[2024-05-30 21:08:12] [INFO ] Computed 79 invariants in 1422 ms
[2024-05-30 21:08:12] [INFO ] Rough structural analysis with invariants proved 340 places are one safe in 1490 ms (including invariant computation).
[2024-05-30 21:08:14] [INFO ] [Real]Absence check using 53 positive place invariants in 1342 ms proved 0 places are One-Safe.
[2024-05-30 21:08:14] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 255 ms proved 180 places are One-Safe.
[2024-05-30 21:08:14] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
[2024-05-30 21:08:32] [INFO ] [Real] State equation constraints in 18430 ms proved 0 places are One-Safe.
RANDOM walk for 40000 steps (4569 resets) in 6805 ms. (5 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 19 ms. (20 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 20 ms. (19 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 200/200 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 200/200 properties
Interrupted probabilistic random walk after 34965 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :0 out of 200
Probabilistic random walk after 34965 steps, saw 9833 distinct states, run finished after 6010 ms. (steps per millisecond=5 ) properties seen :0
[2024-05-30 21:08:41] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2024-05-30 21:08:42] [INFO ] Computed 79 invariants in 1154 ms
[2024-05-30 21:08:43] [INFO ] State equation strengthened by 8060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Problem osplace_1 is UNSAT
Problem osplace_3 is UNSAT
Problem osplace_5 is UNSAT
Problem osplace_6 is UNSAT
Problem osplace_10 is UNSAT
Problem osplace_11 is UNSAT
Problem osplace_13 is UNSAT
Problem osplace_14 is UNSAT
Problem osplace_17 is UNSAT
Problem osplace_20 is UNSAT
Problem osplace_22 is UNSAT
Problem osplace_23 is UNSAT
Problem osplace_24 is UNSAT
Problem osplace_27 is UNSAT
Problem osplace_37 is UNSAT
Problem osplace_43 is UNSAT
Problem osplace_48 is UNSAT
Problem osplace_52 is UNSAT
Problem osplace_54 is UNSAT
Problem osplace_61 is UNSAT
Problem osplace_63 is UNSAT
Problem osplace_68 is UNSAT
Problem osplace_75 is UNSAT
Problem osplace_77 is UNSAT
Problem osplace_78 is UNSAT
Problem osplace_80 is UNSAT
Problem osplace_81 is UNSAT
Problem osplace_86 is UNSAT
Problem osplace_93 is UNSAT
Problem osplace_98 is UNSAT
Problem osplace_99 is UNSAT
Problem osplace_100 is UNSAT
Problem osplace_101 is UNSAT
Problem osplace_103 is UNSAT
Problem osplace_104 is UNSAT
Problem osplace_105 is UNSAT
Problem osplace_106 is UNSAT
Problem osplace_107 is UNSAT
Problem osplace_110 is UNSAT
Problem osplace_122 is UNSAT
Problem osplace_125 is UNSAT
Problem osplace_132 is UNSAT
Problem osplace_146 is UNSAT
Problem osplace_148 is UNSAT
Problem osplace_153 is UNSAT
Problem osplace_155 is UNSAT
Problem osplace_161 is UNSAT
Problem osplace_162 is UNSAT
Problem osplace_164 is UNSAT
Problem osplace_165 is UNSAT
Problem osplace_171 is UNSAT
Problem osplace_172 is UNSAT
Problem osplace_175 is UNSAT
Problem osplace_176 is UNSAT
Problem osplace_181 is UNSAT
Problem osplace_189 is UNSAT
Problem osplace_194 is UNSAT
Problem osplace_195 is UNSAT
Problem osplace_196 is UNSAT
Problem osplace_197 is UNSAT
Problem osplace_202 is UNSAT
Problem osplace_203 is UNSAT
Problem osplace_211 is UNSAT
Problem osplace_219 is UNSAT
Problem osplace_220 is UNSAT
Problem osplace_221 is UNSAT
Problem osplace_226 is UNSAT
Problem osplace_230 is UNSAT
Problem osplace_233 is UNSAT
Problem osplace_238 is UNSAT
Problem osplace_252 is UNSAT
Problem osplace_254 is UNSAT
Problem osplace_264 is UNSAT
Problem osplace_265 is UNSAT
Problem osplace_266 is UNSAT
Problem osplace_267 is UNSAT
Problem osplace_269 is UNSAT
Problem osplace_271 is UNSAT
Problem osplace_276 is UNSAT
Problem osplace_278 is UNSAT
Problem osplace_280 is UNSAT
Problem osplace_284 is UNSAT
Problem osplace_287 is UNSAT
Problem osplace_288 is UNSAT
Problem osplace_289 is UNSAT
Problem osplace_290 is UNSAT
Problem osplace_298 is UNSAT
Problem osplace_299 is UNSAT
Problem osplace_301 is UNSAT
Problem osplace_303 is UNSAT
Problem osplace_305 is UNSAT
Problem osplace_312 is UNSAT
Problem osplace_316 is UNSAT
Problem osplace_320 is UNSAT
Problem osplace_328 is UNSAT
Problem osplace_329 is UNSAT
Problem osplace_334 is UNSAT
Problem osplace_335 is UNSAT
Problem osplace_342 is UNSAT
Problem osplace_344 is UNSAT
Problem osplace_346 is UNSAT
Problem osplace_351 is UNSAT
Problem osplace_354 is UNSAT
Problem osplace_358 is UNSAT
Problem osplace_364 is UNSAT
Problem osplace_365 is UNSAT
Problem osplace_378 is UNSAT
Problem osplace_383 is UNSAT
Problem osplace_386 is UNSAT
Problem osplace_388 is UNSAT
Problem osplace_389 is UNSAT
Problem osplace_398 is UNSAT
Problem osplace_405 is UNSAT
Problem osplace_406 is UNSAT
Problem osplace_407 is UNSAT
Problem osplace_410 is UNSAT
Problem osplace_413 is UNSAT
Problem osplace_417 is UNSAT
Problem osplace_419 is UNSAT
Problem osplace_422 is UNSAT
Problem osplace_424 is UNSAT
Problem osplace_428 is UNSAT
Problem osplace_431 is UNSAT
Problem osplace_437 is UNSAT
Problem osplace_438 is UNSAT
Problem osplace_440 is UNSAT
Problem osplace_441 is UNSAT
Problem osplace_444 is UNSAT
Problem osplace_446 is UNSAT
Problem osplace_449 is UNSAT
Problem osplace_450 is UNSAT
Problem osplace_453 is UNSAT
Problem osplace_467 is UNSAT
Problem osplace_472 is UNSAT
Problem osplace_473 is UNSAT
Problem osplace_480 is UNSAT
Problem osplace_483 is UNSAT
Problem osplace_485 is UNSAT
Problem osplace_487 is UNSAT
Problem osplace_488 is UNSAT
Problem osplace_490 is UNSAT
Problem osplace_492 is UNSAT
Problem osplace_498 is UNSAT
Problem osplace_502 is UNSAT
Problem osplace_509 is UNSAT
Problem osplace_510 is UNSAT
Problem osplace_514 is UNSAT
Problem osplace_517 is UNSAT
Problem osplace_525 is UNSAT
Problem osplace_533 is UNSAT
Problem osplace_537 is UNSAT
Problem osplace_538 is UNSAT
At refinement iteration 1 (OVERLAPS) 220/420 variables, 26/26 constraints. Problems are: Problem set: 152 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/26 constraints. Problems are: Problem set: 152 solved, 48 unsolved
Problem osplace_7 is UNSAT
Problem osplace_41 is UNSAT
Problem osplace_66 is UNSAT
Problem osplace_82 is UNSAT
Problem osplace_109 is UNSAT
Problem osplace_120 is UNSAT
Problem osplace_127 is UNSAT
Problem osplace_135 is UNSAT
Problem osplace_139 is UNSAT
Problem osplace_179 is UNSAT
Problem osplace_183 is UNSAT
Problem osplace_210 is UNSAT
Problem osplace_229 is UNSAT
Problem osplace_231 is UNSAT
Problem osplace_235 is UNSAT
Problem osplace_236 is UNSAT
Problem osplace_293 is UNSAT
Problem osplace_296 is UNSAT
Problem osplace_302 is UNSAT
Problem osplace_333 is UNSAT
Problem osplace_357 is UNSAT
Problem osplace_374 is UNSAT
Problem osplace_375 is UNSAT
Problem osplace_455 is UNSAT
Problem osplace_460 is UNSAT
Problem osplace_513 is UNSAT
Problem osplace_524 is UNSAT
Problem osplace_531 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 85/505 variables, 39/65 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 0/65 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 35/540 variables, 14/79 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/79 constraints. Problems are: Problem set: 180 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16050/16050 variables, and 619 constraints, problems are : Problem set: 180 solved, 20 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 540/540 constraints, ReadFeed: 0/8060 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 180 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 8250/8270 variables, 20/20 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8270 variables, 0/20 constraints. Problems are: Problem set: 180 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 7780/16050 variables, 520/540 constraints. Problems are: Problem set: 180 solved, 20 unsolved
SMT process timed out in 13375ms, After SMT, problems are : Problem set: 180 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 4632 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
Running 16840 sub problems to find dead transitions.
[2024-05-30 21:08:59] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
[2024-05-30 21:08:59] [INFO ] Invariant cache hit.
[2024-05-30 21:09:00] [INFO ] State equation strengthened by 8060 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 540
TRANSITIONS: 17220
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.895s, Sys 0.056s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.167s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 551
MODEL NAME: /home/mcc/execution/model
540 places, 17220 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination OneSafe -timeout 180 -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="PhilosophersDyn-PT-20"
export BK_EXAMINATION="OneSafe"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PhilosophersDyn-PT-20, examination is OneSafe"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654454700040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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