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.r223-tall-171649611300390.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 LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716550004185

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 11:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 11:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:26:46] [INFO ] Load time of PNML (sax parser for PT used): 712 ms
[2024-05-24 11:26:46] [INFO ] Transformed 21462 places.
[2024-05-24 11:26:46] [INFO ] Transformed 21129 transitions.
[2024-05-24 11:26:46] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 916 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2200 resets) in 3311 ms. (12 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (99 resets) in 311 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (99 resets) in 640 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (100 resets) in 203 ms. (196 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (98 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (99 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 11:26:51] [INFO ] Computed 333 invariants in 2589 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 19966/20137 variables, 126/126 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20137/42591 variables, and 126 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 126/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 19997/20125 variables, 114/114 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20125/42591 variables, and 114 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 114/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 12982ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 2120 are kept as prefixes of interest. Removing 19342 places using SCC suffix rule.31 ms
Discarding 19342 places :
Also discarding 10863 output transitions
Drop transitions (Output transitions of discarded places.) removed 10863 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4157 transitions
Reduce isomorphic transitions removed 4157 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 850 transitions
Trivial Post-agglo rules discarded 850 transitions
Performed 850 trivial Post agglomeration. Transition count delta: 850
Iterating post reduction 0 with 5007 rules applied. Total rules applied 5008 place count 2120 transition count 5259
Reduce places removed 852 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 876 rules applied. Total rules applied 5884 place count 1268 transition count 5235
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 5909 place count 1244 transition count 5234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5910 place count 1243 transition count 5234
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 5910 place count 1243 transition count 5201
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 5976 place count 1210 transition count 5201
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 6005 place count 1181 transition count 5172
Iterating global reduction 4 with 29 rules applied. Total rules applied 6034 place count 1181 transition count 5172
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 6051 place count 1181 transition count 5155
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 6068 place count 1164 transition count 5155
Partial Free-agglomeration rule applied 681 times.
Drop transitions (Partial Free agglomeration) removed 681 transitions
Iterating global reduction 5 with 681 rules applied. Total rules applied 6749 place count 1164 transition count 5155
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 5 with 20 rules applied. Total rules applied 6769 place count 1144 transition count 5155
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 6780 place count 1144 transition count 5144
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 6791 place count 1133 transition count 5144
Applied a total of 6791 rules in 1278 ms. Remains 1133 /21462 variables (removed 20329) and now considering 5144/21129 (removed 15985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 1133/21462 places, 5144/21129 transitions.
RANDOM walk for 40000 steps (6828 resets) in 1249 ms. (32 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (198 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (200 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (198 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (200 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
[2024-05-24 11:27:03] [INFO ] Flow matrix only has 1929 transitions (discarded 3215 similar events)
// Phase 1: matrix 1929 rows 1133 cols
[2024-05-24 11:27:03] [INFO ] Computed 3 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 279/299 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1297/1596 variables, 331/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1596 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 1461/3057 variables, 778/1130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3057 variables, 2/1132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3057 variables, 0/1132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/3062 variables, 4/1136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3062 variables, 0/1136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3062 variables, 0/1136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3062/3062 variables, and 1136 constraints, problems are : Problem set: 2 solved, 2 unsolved in 809 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1133/1133 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/17 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/260 variables, 17/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1254/1514 variables, 297/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1514 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1543/3057 variables, 815/1131 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3057 variables, 2/1133 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3057 variables, 1/1134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3057 variables, 0/1134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/3062 variables, 4/1138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3062 variables, 0/1138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3062 variables, 0/1138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3062/3062 variables, and 1138 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1133/1133 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1890ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 19 ms.
All properties solved without resorting to model-checking.
Total runtime 19835 ms.
ITS solved all properties within timeout

BK_STOP 1716550025210

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="ReachabilityCardinality"
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 LeafsetExtension-PT-S64C2, 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 r223-tall-171649611300390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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