fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649611400406
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1011.764 21879.00 43611.00 100.90 TFTFFTTTFFFFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:50 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-S64C4-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716552953286

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-S64C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 12:15:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 12:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:15:55] [INFO ] Load time of PNML (sax parser for PT used): 679 ms
[2024-05-24 12:15:55] [INFO ] Transformed 21462 places.
[2024-05-24 12:15:55] [INFO ] Transformed 21129 transitions.
[2024-05-24 12:15:55] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 887 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1201 resets) in 2781 ms. (14 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (38 resets) in 493 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 244 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 457 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (37 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 12:15:59] [INFO ] Computed 333 invariants in 2637 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20141/20381 variables, 147/148 constraints. Problems are: Problem set: 1 solved, 10 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 Real declared 20381/42591 variables, and 148 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/67 constraints, Generalized P Invariants (flows): 147/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19975/20174 variables, 132/133 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20174/42591 variables, and 133 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/67 constraints, Generalized P Invariants (flows): 132/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 12970ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 198 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 6240 are kept as prefixes of interest. Removing 15222 places using SCC suffix rule.38 ms
Discarding 15222 places :
Also discarding 6982 output transitions
Drop transitions (Output transitions of discarded places.) removed 6982 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4017 transitions
Reduce isomorphic transitions removed 4017 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2643 transitions
Trivial Post-agglo rules discarded 2643 transitions
Performed 2643 trivial Post agglomeration. Transition count delta: 2643
Iterating post reduction 0 with 6660 rules applied. Total rules applied 6661 place count 6240 transition count 7487
Reduce places removed 2645 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 1 with 2729 rules applied. Total rules applied 9390 place count 3595 transition count 7403
Reduce places removed 84 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 102 rules applied. Total rules applied 9492 place count 3511 transition count 7385
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 9510 place count 3493 transition count 7385
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 109 Pre rules applied. Total rules applied 9510 place count 3493 transition count 7276
Deduced a syphon composed of 109 places in 4 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 9728 place count 3384 transition count 7276
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 9759 place count 3353 transition count 7245
Iterating global reduction 4 with 31 rules applied. Total rules applied 9790 place count 3353 transition count 7245
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 9855 place count 3353 transition count 7180
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 9920 place count 3288 transition count 7180
Partial Free-agglomeration rule applied 1743 times.
Drop transitions (Partial Free agglomeration) removed 1743 transitions
Iterating global reduction 5 with 1743 rules applied. Total rules applied 11663 place count 3288 transition count 7180
Discarding 38 places :
Implicit places reduction removed 38 places
Iterating post reduction 5 with 38 rules applied. Total rules applied 11701 place count 3250 transition count 7180
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 11726 place count 3250 transition count 7155
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 11751 place count 3225 transition count 7155
Applied a total of 11751 rules in 2616 ms. Remains 3225 /21462 variables (removed 18237) and now considering 7155/21129 (removed 13974) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2633 ms. Remains : 3225/21462 places, 7155/21129 transitions.
RANDOM walk for 40000 steps (3695 resets) in 1300 ms. (30 steps per ms) remains 7/10 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (49 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (49 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (49 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (49 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
[2024-05-24 12:16:13] [INFO ] Flow matrix only has 5811 transitions (discarded 1344 similar events)
// Phase 1: matrix 5811 rows 3225 cols
[2024-05-24 12:16:13] [INFO ] Computed 4 invariants in 65 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 67/200 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1462/1663 variables, 201/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1663 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 7413/9036 variables, and 1634 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1630/3225 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1457ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 20733 ms.
ITS solved all properties within timeout

BK_STOP 1716552975165

--------------------
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-S64C4"
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-S64C4, 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-171649611400406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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