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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.370 30236.00 45121.00 86.50 TTTFFFFTFFFFTTFF 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-158961257500374.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-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257500374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 3.9K Apr 8 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 18:32 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.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 6 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 6 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:58 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 581K 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-3B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589952822709

[2020-05-20 05:33:44] [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-20 05:33:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 05:33:45] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2020-05-20 05:33:45] [INFO ] Transformed 2117 places.
[2020-05-20 05:33:45] [INFO ] Transformed 2435 transitions.
[2020-05-20 05:33:45] [INFO ] Found NUPN structural information;
[2020-05-20 05:33:45] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 91 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2435 rows 2117 cols
[2020-05-20 05:33:45] [INFO ] Computed 66 place invariants in 64 ms
[2020-05-20 05:33:46] [INFO ] [Real]Absence check using 66 positive place invariants in 188 ms returned sat
[2020-05-20 05:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:33:50] [INFO ] [Real]Absence check using state equation in 4174 ms returned (error "Failed to check-sat")
[2020-05-20 05:33:51] [INFO ] [Real]Absence check using 66 positive place invariants in 191 ms returned sat
[2020-05-20 05:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:33:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:33:55] [INFO ] [Real]Absence check using state equation in 4202 ms returned (error "Failed to check-sat")
[2020-05-20 05:33:56] [INFO ] [Real]Absence check using 66 positive place invariants in 150 ms returned sat
[2020-05-20 05:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s1045 (- t2250 t989))") while checking expression at index 2
[2020-05-20 05:34:01] [INFO ] [Real]Absence check using 66 positive place invariants in 174 ms returned sat
[2020-05-20 05:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:05] [INFO ] [Real]Absence check using state equation in 4590 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:06] [INFO ] [Real]Absence check using 66 positive place invariants in 158 ms returned sat
[2020-05-20 05:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s1126 (- t1853 t126))") while checking expression at index 4
Support contains 15 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1724 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 32 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 435 Post agglomeration using F-continuation condition.Transition count delta: 435
Iterating post reduction 0 with 512 rules applied. Total rules applied 513 place count 2049 transition count 1928
Reduce places removed 435 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 441 rules applied. Total rules applied 954 place count 1614 transition count 1922
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 957 place count 1611 transition count 1922
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 957 place count 1611 transition count 1898
Deduced a syphon composed of 24 places in 8 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1005 place count 1587 transition count 1898
Symmetric choice reduction at 3 with 362 rule applications. Total rules 1367 place count 1587 transition count 1898
Deduced a syphon composed of 362 places in 12 ms
Reduce places removed 362 places and 362 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2091 place count 1225 transition count 1536
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 2091 place count 1225 transition count 1498
Deduced a syphon composed of 38 places in 11 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 2167 place count 1187 transition count 1498
Symmetric choice reduction at 3 with 113 rule applications. Total rules 2280 place count 1187 transition count 1498
Deduced a syphon composed of 113 places in 6 ms
Reduce places removed 113 places and 113 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 2506 place count 1074 transition count 1385
Symmetric choice reduction at 3 with 135 rule applications. Total rules 2641 place count 1074 transition count 1385
Deduced a syphon composed of 135 places in 4 ms
Reduce places removed 135 places and 149 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 2911 place count 939 transition count 1236
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2963 place count 939 transition count 1236
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 95 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 3067 place count 887 transition count 1141
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 3084 place count 885 transition count 1126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3086 place count 883 transition count 1126
Symmetric choice reduction at 5 with 37 rule applications. Total rules 3123 place count 883 transition count 1126
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 3197 place count 846 transition count 1089
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 3205 place count 842 transition count 1085
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3209 place count 838 transition count 1085
Symmetric choice reduction at 7 with 27 rule applications. Total rules 3236 place count 838 transition count 1085
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 54 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 3290 place count 811 transition count 1031
Symmetric choice reduction at 7 with 27 rule applications. Total rules 3317 place count 811 transition count 1031
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 3371 place count 784 transition count 1004
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 7 with 37 rules applied. Total rules applied 3408 place count 779 transition count 972
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 3413 place count 774 transition count 972
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 9 with 588 rules applied. Total rules applied 4001 place count 480 transition count 678
Symmetric choice reduction at 9 with 15 rule applications. Total rules 4016 place count 480 transition count 678
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 4046 place count 465 transition count 663
Symmetric choice reduction at 9 with 11 rule applications. Total rules 4057 place count 465 transition count 663
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 22 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 4079 place count 454 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4081 place count 454 transition count 639
Symmetric choice reduction at 10 with 2 rule applications. Total rules 4083 place count 454 transition count 639
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 10 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4087 place count 452 transition count 629
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 4145 place count 423 transition count 757
Free-agglomeration rule applied 28 times.
Iterating global reduction 10 with 28 rules applied. Total rules applied 4173 place count 423 transition count 729
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 33 rules applied. Total rules applied 4206 place count 395 transition count 724
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 4209 place count 395 transition count 721
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 4212 place count 392 transition count 721
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 4217 place count 392 transition count 721
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 4222 place count 392 transition count 716
Applied a total of 4222 rules in 1363 ms. Remains 392 /2117 variables (removed 1725) and now considering 716/2435 (removed 1719) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/2117 places, 716/2435 transitions.
Finished random walk after 8415 steps, including 104 resets, run visited all 5 properties in 79 ms. (steps per millisecond=106 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589952852945

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

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