fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257500342
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for NoC3x3-PT-1B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.620 55156.00 68975.00 69.20 FTFTTFTTFFFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257500342.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-1B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257500342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 18:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 18:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 362K Mar 24 05:37 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 NoC3x3-PT-1B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589883493808

[2020-05-19 10:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 10:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 10:18:16] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2020-05-19 10:18:16] [INFO ] Transformed 1416 places.
[2020-05-19 10:18:16] [INFO ] Transformed 1640 transitions.
[2020-05-19 10:18:16] [INFO ] Found NUPN structural information;
[2020-05-19 10:18:16] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 295 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 81 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 1, 1, 1, 0, 0]
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1640 rows 1416 cols
[2020-05-19 10:18:16] [INFO ] Computed 40 place invariants in 46 ms
[2020-05-19 10:18:17] [INFO ] [Real]Absence check using 40 positive place invariants in 132 ms returned sat
[2020-05-19 10:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:18:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 10:18:21] [INFO ] [Real]Absence check using state equation in 4530 ms returned (error "Failed to check-sat")
[2020-05-19 10:18:21] [INFO ] [Real]Absence check using 40 positive place invariants in 84 ms returned sat
[2020-05-19 10:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:18:26] [INFO ] [Real]Absence check using state equation in 4588 ms returned sat
[2020-05-19 10:18:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 10:18:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 10:18:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 4798 ms returned unknown
[2020-05-19 10:18:31] [INFO ] [Real]Absence check using 40 positive place invariants in 86 ms returned sat
[2020-05-19 10:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:18:36] [INFO ] [Real]Absence check using state equation in 4417 ms returned sat
[2020-05-19 10:18:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 10:18:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 10:18:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 4847 ms returned unknown
[2020-05-19 10:18:41] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned unsat
[2020-05-19 10:18:42] [INFO ] [Real]Absence check using 40 positive place invariants in 89 ms returned sat
[2020-05-19 10:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:18:46] [INFO ] [Real]Absence check using state equation in 4492 ms returned sat
[2020-05-19 10:18:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 10:18:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 10:18:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 4810 ms returned unknown
[2020-05-19 10:18:51] [INFO ] [Real]Absence check using 40 positive place invariants in 87 ms returned sat
[2020-05-19 10:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:18:56] [INFO ] [Real]Absence check using state equation in 4701 ms returned sat
[2020-05-19 10:18:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 10:19:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 10:19:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 4841 ms returned (error "Solver has unexpectedly terminated")
[2020-05-19 10:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 10:19:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 34 out of 1416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1377 edges and 1416 vertex of which 711 / 1416 are part of one of the 19 SCC in 23 ms
Free SCC test removed 692 places
Drop transitions removed 829 transitions
Reduce isomorphic transitions removed 829 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 0 with 982 rules applied. Total rules applied 983 place count 724 transition count 658
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 176 rules applied. Total rules applied 1159 place count 571 transition count 635
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1166 place count 566 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1167 place count 565 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1167 place count 565 transition count 632
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1169 place count 564 transition count 632
Symmetric choice reduction at 4 with 160 rule applications. Total rules 1329 place count 564 transition count 632
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 160 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 1649 place count 404 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 1655 place count 404 transition count 466
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1657 place count 402 transition count 466
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 1657 place count 402 transition count 440
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1709 place count 376 transition count 440
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1724 place count 376 transition count 440
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 1754 place count 361 transition count 425
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 6 with 182 rules applied. Total rules applied 1936 place count 270 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1940 place count 270 transition count 330
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1954 place count 263 transition count 404
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1964 place count 263 transition count 394
Free-agglomeration rule applied 92 times.
Iterating global reduction 8 with 92 rules applied. Total rules applied 2056 place count 263 transition count 302
Reduce places removed 92 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Discarding 14 places :
Also discarding 0 output transitions
Graph (complete) has 509 edges and 171 vertex of which 157 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.26 ms
Iterating post reduction 8 with 121 rules applied. Total rules applied 2177 place count 157 transition count 274
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2192 place count 157 transition count 259
Symmetric choice reduction at 10 with 7 rule applications. Total rules 2199 place count 157 transition count 259
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 9 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2213 place count 150 transition count 250
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2217 place count 150 transition count 250
Applied a total of 2217 rules in 348 ms. Remains 150 /1416 variables (removed 1266) and now considering 250/1640 (removed 1390) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/1416 places, 250/1640 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1918 ms. (steps per millisecond=521 ) properties seen :[0, 0, 0, 0, 1]
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties seen :[1, 0, 0, 1]
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 250 rows 150 cols
[2020-05-19 10:19:06] [INFO ] Computed 36 place invariants in 2 ms
[2020-05-19 10:19:06] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-19 10:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 10:19:06] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-19 10:19:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 10:19:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2020-05-19 10:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 10:19:06] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-05-19 10:19:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2020-05-19 10:19:06] [INFO ] [Nat]Added 74 Read/Feed constraints in 14 ms returned sat
[2020-05-19 10:19:07] [INFO ] Deduced a trap composed of 13 places in 84 ms
[2020-05-19 10:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-19 10:19:07] [INFO ] Computed and/alt/rep : 245/2061/245 causal constraints in 25 ms.
[2020-05-19 10:19:08] [INFO ] Added : 232 causal constraints over 47 iterations in 1537 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
Finished Parikh walk after 4481 steps, including 39 resets, run visited all 1 properties in 33 ms. (steps per millisecond=135 )
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589883548964

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="NoC3x3-PT-1B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1B, 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 r111-csrt-158961257500342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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