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.r504-tall-171649612700390.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 ltsminxred
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 r504-tall-171649612700390
=====================================================================

--------------------
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 1717228832178

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:00:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:00:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:00:34] [INFO ] Load time of PNML (sax parser for PT used): 787 ms
[2024-06-01 08:00:34] [INFO ] Transformed 21462 places.
[2024-06-01 08:00:34] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:00:34] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1019 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2194 resets) in 3143 ms. (12 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14 FALSE 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
BEST_FIRST walk for 40004 steps (100 resets) in 442 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 372 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (101 resets) in 177 ms. (224 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (99 resets) in 154 ms. (258 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-06-01 08:00:39] [INFO ] Computed 333 invariants in 2738 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 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) 19662/19804 variables, 113/113 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19804/42591 variables, and 113 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 113/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/99 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
At refinement iteration 1 (OVERLAPS) 19691/19790 variables, 99/99 constraints. Problems are: Problem set: 3 solved, 6 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 19790/42591 variables, and 99 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 99/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 13090ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 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 3310 are kept as prefixes of interest. Removing 18152 places using SCC suffix rule.32 ms
Discarding 18152 places :
Also discarding 9773 output transitions
Drop transitions (Output transitions of discarded places.) removed 9773 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4080 transitions
Reduce isomorphic transitions removed 4080 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1384 transitions
Trivial Post-agglo rules discarded 1384 transitions
Performed 1384 trivial Post agglomeration. Transition count delta: 1384
Iterating post reduction 0 with 5464 rules applied. Total rules applied 5465 place count 3310 transition count 5892
Reduce places removed 1386 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 1427 rules applied. Total rules applied 6892 place count 1924 transition count 5851
Reduce places removed 41 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 45 rules applied. Total rules applied 6937 place count 1883 transition count 5847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 6941 place count 1879 transition count 5847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 6941 place count 1879 transition count 5790
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 7055 place count 1822 transition count 5790
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 7086 place count 1791 transition count 5759
Iterating global reduction 4 with 31 rules applied. Total rules applied 7117 place count 1791 transition count 5759
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 7138 place count 1791 transition count 5738
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 7159 place count 1770 transition count 5738
Partial Free-agglomeration rule applied 1143 times.
Drop transitions (Partial Free agglomeration) removed 1143 transitions
Iterating global reduction 5 with 1143 rules applied. Total rules applied 8302 place count 1770 transition count 5738
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 5 with 33 rules applied. Total rules applied 8335 place count 1737 transition count 5738
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 8357 place count 1737 transition count 5716
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 8379 place count 1715 transition count 5716
Applied a total of 8379 rules in 1658 ms. Remains 1715 /21462 variables (removed 19747) and now considering 5716/21129 (removed 15413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1670 ms. Remains : 1715/21462 places, 5716/21129 transitions.
RANDOM walk for 40000 steps (7092 resets) in 1305 ms. (30 steps per ms) remains 5/6 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (172 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (172 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (172 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (170 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (172 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
[2024-06-01 08:00:51] [INFO ] Flow matrix only has 3055 transitions (discarded 2661 similar events)
// Phase 1: matrix 3055 rows 1715 cols
[2024-06-01 08:00:51] [INFO ] Computed 3 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1282/1362 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1362 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2838/4200 variables, 1293/1374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4200 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 5 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) 570/4770 variables, 342/1716 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4770 variables, 2/1718 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4770 variables, 0/1718 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4770 variables, 0/1718 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4770/4770 variables, and 1718 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1767 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1715/1715 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1246/1323 variables, 77/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2809/4132 variables, 1259/1337 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4132 variables, 1/1338 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4132 variables, 0/1338 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 638/4770 variables, 379/1717 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4770 variables, 2/1719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4770 variables, 1/1720 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4770 variables, 0/1720 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4770 variables, 0/1720 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4770/4770 variables, and 1720 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1693 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1715/1715 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3620ms problems are : Problem set: 3 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 2 ms. (steps per millisecond=3 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 22070 ms.
ITS solved all properties within timeout

BK_STOP 1717228855504

--------------------
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="LeafsetExtension-PT-S64C2"
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 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 r504-tall-171649612700390"
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 ;