fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814500535
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Diffusion2D-PT-D40N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.310 78433.00 89000.00 58.40 TFFTTTFTTTTTFTTF 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/mcc2020-input.r066-tajo-158922814500535.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D40N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814500535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 4.2K Mar 31 06:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 29 22:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 27 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 24 05:37 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 Diffusion2D-PT-D40N050-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590124098451

[2020-05-22 05:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 05:08:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 05:08:20] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2020-05-22 05:08:20] [INFO ] Transformed 1600 places.
[2020-05-22 05:08:20] [INFO ] Transformed 12324 transitions.
[2020-05-22 05:08:20] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 359 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10004 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 12324 rows 1600 cols
[2020-05-22 05:08:20] [INFO ] Computed 1 place invariants in 113 ms
[2020-05-22 05:08:21] [INFO ] [Real]Absence check using 1 positive place invariants in 34 ms returned sat
[2020-05-22 05:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:26] [INFO ] [Real]Absence check using state equation in 4745 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 05:08:26] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-05-22 05:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:31] [INFO ] [Real]Absence check using state equation in 4801 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:31] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-05-22 05:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:36] [INFO ] [Real]Absence check using state equation in 4830 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:36] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-05-22 05:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:41] [INFO ] [Real]Absence check using state equation in 4831 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:41] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-05-22 05:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:46] [INFO ] [Real]Absence check using state equation in 4782 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:46] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-05-22 05:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:51] [INFO ] [Real]Absence check using state equation in 4840 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:51] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-05-22 05:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:08:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:08:56] [INFO ] [Real]Absence check using state equation in 4812 ms returned (error "Failed to check-sat")
[2020-05-22 05:08:56] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-05-22 05:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:01] [INFO ] [Real]Absence check using state equation in 4848 ms returned (error "Failed to check-sat")
[2020-05-22 05:09:01] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-05-22 05:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:06] [INFO ] [Real]Absence check using state equation in 4799 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 05:09:06] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-05-22 05:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:11] [INFO ] [Real]Absence check using state equation in 4820 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 05:09:11] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-05-22 05:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:16] [INFO ] [Real]Absence check using state equation in 4852 ms returned (error "Failed to check-sat")
[2020-05-22 05:09:16] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-05-22 05:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:21] [INFO ] [Real]Absence check using state equation in 4795 ms returned (error "Failed to check-sat")
[2020-05-22 05:09:21] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-05-22 05:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:26] [INFO ] [Real]Absence check using state equation in 4848 ms returned (error "Failed to check-sat")
[2020-05-22 05:09:26] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-05-22 05:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:31] [INFO ] [Real]Absence check using state equation in 4887 ms returned (error "Failed to check-sat")
[2020-05-22 05:09:31] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-05-22 05:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 05:09:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 05:09:36] [INFO ] [Real]Absence check using state equation in 4850 ms returned (error "Failed to check-sat")
Support contains 72 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 11220 edges and 1600 vertex of which 1528 / 1600 are part of one of the 1 SCC in 41 ms
Free SCC test removed 1527 places
Drop transitions removed 11220 transitions
Ensure Unique test removed 930 transitions
Reduce isomorphic transitions removed 12150 transitions.
Iterating post reduction 0 with 12150 rules applied. Total rules applied 12151 place count 73 transition count 174
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 12193 place count 73 transition count 132
Applied a total of 12193 rules in 127 ms. Remains 73 /1600 variables (removed 1527) and now considering 132/12324 (removed 12192) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/1600 places, 132/12324 transitions.
Incomplete random walk after 1000004 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=3787 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 5022 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=717 )
FORMULA Diffusion2D-PT-D40N050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590124176884

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Diffusion2D-PT-D40N050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D40N050, 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 r066-tajo-158922814500535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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