Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025600654.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 569K May 10 09:34 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 ShieldPPPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654275295718

Running Version 202205111006
[2022-06-03 16:54:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 16:54:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:54:57] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2022-06-03 16:54:57] [INFO ] Transformed 2343 places.
[2022-06-03 16:54:57] [INFO ] Transformed 2133 transitions.
[2022-06-03 16:54:57] [INFO ] Found NUPN structural information;
[2022-06-03 16:54:57] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2022-06-03 16:54:58] [INFO ] Computed 331 place invariants in 41 ms
[2022-06-03 16:54:59] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 16:54:59] [INFO ] [Nat]Absence check using 331 positive place invariants in 108 ms returned sat
[2022-06-03 16:55:01] [INFO ] After 1614ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-06-03 16:55:02] [INFO ] Deduced a trap composed of 20 places in 569 ms of which 7 ms to minimize.
[2022-06-03 16:55:03] [INFO ] Deduced a trap composed of 23 places in 579 ms of which 3 ms to minimize.
[2022-06-03 16:55:03] [INFO ] Deduced a trap composed of 36 places in 503 ms of which 2 ms to minimize.
[2022-06-03 16:55:04] [INFO ] Deduced a trap composed of 27 places in 522 ms of which 3 ms to minimize.
[2022-06-03 16:55:05] [INFO ] Deduced a trap composed of 25 places in 530 ms of which 2 ms to minimize.
[2022-06-03 16:55:05] [INFO ] Deduced a trap composed of 23 places in 540 ms of which 1 ms to minimize.
[2022-06-03 16:55:06] [INFO ] Deduced a trap composed of 25 places in 519 ms of which 2 ms to minimize.
[2022-06-03 16:55:07] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 1 ms to minimize.
[2022-06-03 16:55:07] [INFO ] Deduced a trap composed of 22 places in 493 ms of which 2 ms to minimize.
[2022-06-03 16:55:08] [INFO ] Deduced a trap composed of 35 places in 500 ms of which 1 ms to minimize.
[2022-06-03 16:55:08] [INFO ] Deduced a trap composed of 33 places in 491 ms of which 1 ms to minimize.
[2022-06-03 16:55:09] [INFO ] Deduced a trap composed of 46 places in 487 ms of which 1 ms to minimize.
[2022-06-03 16:55:10] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 1 ms to minimize.
[2022-06-03 16:55:10] [INFO ] Deduced a trap composed of 29 places in 494 ms of which 1 ms to minimize.
[2022-06-03 16:55:11] [INFO ] Deduced a trap composed of 30 places in 485 ms of which 2 ms to minimize.
[2022-06-03 16:55:11] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 1 ms to minimize.
[2022-06-03 16:55:12] [INFO ] Deduced a trap composed of 26 places in 477 ms of which 2 ms to minimize.
[2022-06-03 16:55:13] [INFO ] Deduced a trap composed of 43 places in 438 ms of which 1 ms to minimize.
[2022-06-03 16:55:13] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 2 ms to minimize.
[2022-06-03 16:55:14] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 1 ms to minimize.
[2022-06-03 16:55:14] [INFO ] Deduced a trap composed of 37 places in 418 ms of which 1 ms to minimize.
[2022-06-03 16:55:15] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 2 ms to minimize.
[2022-06-03 16:55:15] [INFO ] Deduced a trap composed of 26 places in 435 ms of which 1 ms to minimize.
[2022-06-03 16:55:16] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 1 ms to minimize.
[2022-06-03 16:55:16] [INFO ] Deduced a trap composed of 30 places in 423 ms of which 2 ms to minimize.
[2022-06-03 16:55:17] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 1 ms to minimize.
[2022-06-03 16:55:17] [INFO ] Deduced a trap composed of 56 places in 409 ms of which 1 ms to minimize.
[2022-06-03 16:55:18] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 2 ms to minimize.
[2022-06-03 16:55:18] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 1 ms to minimize.
[2022-06-03 16:55:19] [INFO ] Deduced a trap composed of 34 places in 381 ms of which 1 ms to minimize.
[2022-06-03 16:55:19] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 1 ms to minimize.
[2022-06-03 16:55:20] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 1 ms to minimize.
[2022-06-03 16:55:20] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 1 ms to minimize.
[2022-06-03 16:55:21] [INFO ] Deduced a trap composed of 40 places in 383 ms of which 1 ms to minimize.
[2022-06-03 16:55:21] [INFO ] Deduced a trap composed of 41 places in 381 ms of which 1 ms to minimize.
[2022-06-03 16:55:22] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 1 ms to minimize.
[2022-06-03 16:55:22] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 1 ms to minimize.
[2022-06-03 16:55:23] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2022-06-03 16:55:23] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 2 ms to minimize.
[2022-06-03 16:55:24] [INFO ] Deduced a trap composed of 43 places in 340 ms of which 2 ms to minimize.
[2022-06-03 16:55:24] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2022-06-03 16:55:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:55:24] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5387 ms.
Support contains 81 out of 2343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 513 place count 2343 transition count 1620
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 515 rules applied. Total rules applied 1028 place count 1830 transition count 1618
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 20 rules applied. Total rules applied 1048 place count 1829 transition count 1599
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1067 place count 1810 transition count 1599
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 1067 place count 1810 transition count 1474
Deduced a syphon composed of 125 places in 3 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1317 place count 1685 transition count 1474
Discarding 187 places :
Symmetric choice reduction at 4 with 187 rule applications. Total rules 1504 place count 1498 transition count 1287
Iterating global reduction 4 with 187 rules applied. Total rules applied 1691 place count 1498 transition count 1287
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1691 place count 1498 transition count 1212
Deduced a syphon composed of 75 places in 7 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 1841 place count 1423 transition count 1212
Performed 472 Post agglomeration using F-continuation condition.Transition count delta: 472
Deduced a syphon composed of 472 places in 2 ms
Reduce places removed 472 places and 0 transitions.
Iterating global reduction 4 with 944 rules applied. Total rules applied 2785 place count 951 transition count 740
Renaming transitions due to excessive name length > 1024 char.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 2945 place count 871 transition count 740
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 2950 place count 871 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2955 place count 866 transition count 735
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 5 with 85 rules applied. Total rules applied 3040 place count 866 transition count 735
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3041 place count 865 transition count 734
Applied a total of 3041 rules in 765 ms. Remains 865 /2343 variables (removed 1478) and now considering 734/2133 (removed 1399) transitions.
Finished structural reductions, in 1 iterations. Remains : 865/2343 places, 734/2133 transitions.
Finished random walk after 119623 steps, including 0 resets, run visited all 3 properties in 1003 ms. (steps per millisecond=119 )
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34827 ms.

BK_STOP 1654275331729

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030B, 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 r222-tall-165286025600654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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