fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889202800054
Last Updated
May 14, 2023

About the Execution of Marcie+red for RERS17pb113-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5681.775 3600000.00 3664417.00 9106.60 FT??T??F?F?T?FFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889202800054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RERS17pb113-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889202800054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 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 RERS17pb113-PT-7-ReachabilityCardinality-00
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-01
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-02
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-03
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-04
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-05
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-06
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-07
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-08
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-09
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-10
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-11
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-12
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-13
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-14
FORMULA_NAME RERS17pb113-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679027688103

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 04:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 04:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 04:34:50] [INFO ] Load time of PNML (sax parser for PT used): 598 ms
[2023-03-17 04:34:50] [INFO ] Transformed 639 places.
[2023-03-17 04:34:50] [INFO ] Transformed 31353 transitions.
[2023-03-17 04:34:50] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 804 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 16) seen :9
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-7-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 04:34:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2023-03-17 04:34:51] [INFO ] Computed 25 place invariants in 96 ms
[2023-03-17 04:34:52] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 04:34:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-17 04:34:52] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-17 04:35:14] [INFO ] After 22094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 04:35:15] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-17 04:35:17] [INFO ] After 2398ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 04:35:17] [INFO ] After 2400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 04:35:17] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 78 ms.
Support contains 133 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 633 transition count 31353
Applied a total of 6 rules in 502 ms. Remains 633 /639 variables (removed 6) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 633/639 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 25333 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25333 steps, saw 22901 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-17 04:35:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 633 cols
[2023-03-17 04:35:21] [INFO ] Computed 19 place invariants in 69 ms
[2023-03-17 04:35:22] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 04:35:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 04:35:22] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-17 04:35:35] [INFO ] After 12684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 04:35:35] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-17 04:35:47] [INFO ] After 11765ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 04:35:47] [INFO ] After 11766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-17 04:35:47] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 30 ms.
Support contains 133 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 31353/31353 transitions.
Applied a total of 0 rules in 236 ms. Remains 633 /633 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 633/633 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 31353/31353 transitions.
Applied a total of 0 rules in 216 ms. Remains 633 /633 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-17 04:35:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 04:35:48] [INFO ] Invariant cache hit.
[2023-03-17 04:35:49] [INFO ] Implicit Places using invariants in 1512 ms returned []
Implicit Place search using SMT only with invariants took 1514 ms to find 0 implicit places.
[2023-03-17 04:35:49] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 04:35:49] [INFO ] Invariant cache hit.
[2023-03-17 04:35:58] [INFO ] Dead Transitions using invariants and state equation in 8911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10648 ms. Remains : 633/633 places, 31353/31353 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 633 transition count 18326
Applied a total of 13027 rules in 646 ms. Remains 633 /633 variables (removed 0) and now considering 18326/31353 (removed 13027) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 18326 rows 633 cols
[2023-03-17 04:35:59] [INFO ] Computed 19 place invariants in 60 ms
[2023-03-17 04:35:59] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 04:35:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 04:35:59] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 04:36:19] [INFO ] After 19776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 04:36:23] [INFO ] After 23906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2705 ms.
[2023-03-17 04:36:26] [INFO ] After 26822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-17 04:36:26] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-17 04:36:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 633 places, 31353 transitions and 125412 arcs took 125 ms.
[2023-03-17 04:36:28] [INFO ] Flatten gal took : 1162 ms
Total runtime 98700 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS17pb113_PT_7
(NrP: 633 NrTr: 31353 NrArc: 125412)

parse formulas
formulas created successfully
place and transition orderings generation:0m 3.373sec

net check time: 0m 0.026sec

init dd package: 0m 2.799sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10432252 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16066688 kB

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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 6.137sec

2160 2523 3618 3614 5269 6284 8306 9857 7575 8340 9397 8340 9797 13525 12532 12812 15035 14663 15667 17250 17953 16744 17274 17011 16530 16561 14346 12637 14057 16499 15206 16647 16061 17334 18777 19308 17685 17779 17947 17148 16879 17176 17107 18605 15411 14618 12966 14056 14853 18296 17349 19675 20878 22782 23223 22008 20131 19349 20696 20785 21229 24130 23265 23265 24185 23039 21993 21775 23737 23320 25499 24868 24219 19862 20501 20877 22008 22989 24532 24667 23341 23405 22186 21169 19888 20627 22704 22246 25011 26459 28821 29424 28326 25939 24757 25881 25960 26396 29624 29592 28579 29525 28160 26830 27108 29335 28757 31102 29954 29486 23788 24421 24832 25910 26334 27743 27126 25208 25496 23880 21466 20986 21170 21366 22509 23281 25166 25687 24859 21864 23261 21550 23645 24830 26083 25617 24516 21654 22510 20216 21625 21070 19354 22903 22586 24193 23866 22932 21877 23121 21054 23544 23193 24135 23673 22078 21558 21027 20499 20118 21739 22406 24863 20794 30199 30055 30935 30574 34356 32570 31785 30235 30353 29691 26519 26786 25809 19937 19937 20093 22963 24087 25872 27871 29329 28533 28635 28680 28710 30200 29503 27086

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="RERS17pb113-PT-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is RERS17pb113-PT-7, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889202800054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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