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.r311-tall-171662335800078.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 QuasiCertifProtocol-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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 QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716656083203

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:54:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:54:44] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-25 16:54:44] [INFO ] Transformed 550 places.
[2024-05-25 16:54:44] [INFO ] Transformed 176 transitions.
[2024-05-25 16:54:44] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2767 resets) in 1956 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 161 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 154 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 159 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (40 resets) in 87 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 192 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 435862 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :3 out of 15
Probabilistic random walk after 435862 steps, saw 63610 distinct states, run finished after 3014 ms. (steps per millisecond=144 ) properties seen :3
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 176 rows 550 cols
[2024-05-25 16:54:48] [INFO ] Computed 375 invariants in 22 ms
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-25 16:54:54] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 17 ms to minimize.
[2024-05-25 16:54:54] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-25 16:54:55] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 9/384 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 0/384 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 934 constraints, problems are : Problem set: 11 solved, 1 unsolved in 3515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 9/9 constraints]
After SMT, in 8941ms problems are : Problem set: 11 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 515 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 549 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 549 /550 variables (removed 1) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 549/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2767 resets) in 519 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (196 resets) in 849 ms. (47 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1042613 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1042613 steps, saw 137776 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 176 rows 549 cols
[2024-05-25 16:55:01] [INFO ] Computed 374 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 362/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 23/538 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 176/725 variables, 549/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 362/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 23/538 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 725/725 variables, and 923 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4120ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 20814 ms.
ITS solved all properties within timeout

BK_STOP 1716656105134

--------------------
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="QuasiCertifProtocol-PT-10"
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 QuasiCertifProtocol-PT-10, 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 r311-tall-171662335800078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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