fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530800642
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Sudoku-PT-AN10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12115.684 3600000.00 13649698.00 1947.40 [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 '/data/fkordon/mcc2024-input.r399-tall-171690530800642.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 greatspnxred
Input is Sudoku-PT-AN10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530800642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 502K Apr 12 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 12 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Apr 12 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 182K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 425K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 620K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 564K 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 Sudoku-PT-AN10-CTLFireability-2024-00
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-01
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-02
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-03
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-04
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-05
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-06
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-07
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-08
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-09
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-10
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-11
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-12
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-13
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-14
FORMULA_NAME Sudoku-PT-AN10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717068407224

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 11:26:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 11:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:26:48] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-30 11:26:48] [INFO ] Transformed 1300 places.
[2024-05-30 11:26:48] [INFO ] Transformed 1000 transitions.
[2024-05-30 11:26:48] [INFO ] Found NUPN structural information;
[2024-05-30 11:26:48] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 153 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 56 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 11:26:51] [INFO ] Computed 29 invariants in 59 ms
[2024-05-30 11:26:52] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-30 11:26:52] [INFO ] Invariant cache hit.
[2024-05-30 11:26:52] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 16ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 769 ms. Remains : 300/1300 places, 1000/1000 transitions.
Support contains 300 out of 300 places after structural reductions.
[2024-05-30 11:26:53] [INFO ] Flatten gal took : 520 ms
[2024-05-30 11:26:59] [INFO ] Flatten gal took : 510 ms
[2024-05-30 11:27:03] [INFO ] Input system was already deterministic with 1000 transitions.
Reduction of identical properties reduced properties to check from 86 to 81
RANDOM walk for 40000 steps (456 resets) in 3793 ms. (10 steps per ms) remains 2/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16401 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15411 ms. (2 steps per ms) remains 2/2 properties
[2024-05-30 11:27:13] [INFO ] Invariant cache hit.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 300/1300 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 405 ms.
Refiners :[Domain max(s): 0/300 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8430ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-30 11:27:23] [INFO ] Flatten gal took : 293 ms
[2024-05-30 11:27:28] [INFO ] Flatten gal took : 442 ms
[2024-05-30 11:27:32] [INFO ] Input system was already deterministic with 1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:33] [INFO ] Flatten gal took : 121 ms
[2024-05-30 11:27:34] [INFO ] Flatten gal took : 182 ms
[2024-05-30 11:27:34] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:34] [INFO ] Flatten gal took : 45 ms
[2024-05-30 11:27:34] [INFO ] Flatten gal took : 57 ms
[2024-05-30 11:27:35] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:35] [INFO ] Flatten gal took : 41 ms
[2024-05-30 11:27:35] [INFO ] Flatten gal took : 53 ms
[2024-05-30 11:27:35] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:35] [INFO ] Flatten gal took : 41 ms
[2024-05-30 11:27:35] [INFO ] Flatten gal took : 53 ms
[2024-05-30 11:27:35] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:35] [INFO ] Flatten gal took : 56 ms
[2024-05-30 11:27:36] [INFO ] Flatten gal took : 80 ms
[2024-05-30 11:27:36] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:36] [INFO ] Flatten gal took : 37 ms
[2024-05-30 11:27:36] [INFO ] Flatten gal took : 49 ms
[2024-05-30 11:27:36] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:36] [INFO ] Flatten gal took : 49 ms
[2024-05-30 11:27:36] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:27:36] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 78 ms
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 112 ms
[2024-05-30 11:27:37] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 49 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 28 ms
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 29 ms
[2024-05-30 11:27:37] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 26 ms
[2024-05-30 11:27:37] [INFO ] Flatten gal took : 30 ms
[2024-05-30 11:27:37] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 27 ms
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 29 ms
[2024-05-30 11:27:38] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 28 ms
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 33 ms
[2024-05-30 11:27:38] [INFO ] Input system was already deterministic with 1000 transitions.
Support contains 18 out of 300 places (down from 35) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 28 ms
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 30 ms
[2024-05-30 11:27:38] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 27 ms
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 31 ms
[2024-05-30 11:27:38] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 29 ms
[2024-05-30 11:27:38] [INFO ] Flatten gal took : 31 ms
[2024-05-30 11:27:39] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 300/300 places, 1000/1000 transitions.
[2024-05-30 11:27:39] [INFO ] Flatten gal took : 26 ms
[2024-05-30 11:27:39] [INFO ] Flatten gal took : 28 ms
[2024-05-30 11:27:39] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-05-30 11:27:40] [INFO ] Flatten gal took : 401 ms
[2024-05-30 11:27:44] [INFO ] Flatten gal took : 399 ms
[2024-05-30 11:27:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 203 ms.
[2024-05-30 11:27:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 1000 transitions and 3000 arcs took 4 ms.
Total runtime 60358 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 300
TRANSITIONS: 1000
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 563
MODEL NAME: /home/mcc/execution/410/model
300 places, 1000 transitions.

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:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="Sudoku-PT-AN10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-PT-AN10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530800642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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