Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600470.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225048410

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:30] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-01 06:57:30] [INFO ] Transformed 274 places.
[2024-06-01 06:57:30] [INFO ] Transformed 237 transitions.
[2024-06-01 06:57:30] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:30] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (475 resets) in 1630 ms. (24 steps per ms) remains 6/13 properties
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (89 resets) in 337 ms. (118 steps per ms) remains 4/6 properties
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (9 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/4 properties
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 236 rows 273 cols
[2024-06-01 06:57:31] [INFO ] Computed 43 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 206/242 variables, 31/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 206/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-03-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 31/273 variables, 12/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 31/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/509 variables, 273/589 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/589 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/509 variables, 0/589 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 589 constraints, problems are : Problem set: 1 solved, 1 unsolved in 513 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 175/194 variables, 19/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 175/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 9 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 5 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 5/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/239 variables, 12/230 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 45/275 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 4/279 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/273 variables, 12/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 34/325 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/326 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 236/509 variables, 273/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 1/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 8 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 8/608 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/509 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 608 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2251 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 2859ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 19 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 146 edges and 273 vertex of which 4 / 273 are part of one of the 1 SCC in 9 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 518 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 267 transition count 177
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 214 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 210 transition count 172
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 118 place count 210 transition count 138
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 194 place count 168 transition count 138
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 226 place count 136 transition count 106
Iterating global reduction 3 with 32 rules applied. Total rules applied 258 place count 136 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 258 place count 136 transition count 105
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 134 transition count 105
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 13 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 343 place count 93 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 92 transition count 63
Applied a total of 344 rules in 183 ms. Remains 92 /273 variables (removed 181) and now considering 63/236 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 92/273 places, 63/236 transitions.
RANDOM walk for 40000 steps (8 resets) in 643 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Probably explored full state space saw : 7816 states, properties seen :0
Probabilistic random walk after 42399 steps, saw 7816 distinct states, run finished after 135 ms. (steps per millisecond=314 ) properties seen :0
Explored full state space saw : 7816 states, properties seen :0
Exhaustive walk after 42399 steps, saw 7816 distinct states, run finished after 53 ms. (steps per millisecond=799 ) properties seen :0
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 5011 ms.
ITS solved all properties within timeout

BK_STOP 1717225054970

--------------------
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.202405141337.jar
+ 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="BusinessProcesses-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-03, 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 r472-tajo-171620399600470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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