fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699300598
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-19

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.770 34953.00 56936.00 500.60 FTTTFTFFTTFFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699300598.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 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 189K 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 BusinessProcesses-PT-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589258830566

[2020-05-12 04:47:12] [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-12 04:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:47:12] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2020-05-12 04:47:12] [INFO ] Transformed 772 places.
[2020-05-12 04:47:12] [INFO ] Transformed 685 transitions.
[2020-05-12 04:47:12] [INFO ] Found NUPN structural information;
[2020-05-12 04:47:12] [INFO ] Parsed PT model containing 772 places and 685 transitions in 229 ms.
Deduced a syphon composed of 15 places in 25 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 670 rows 757 cols
[2020-05-12 04:47:13] [INFO ] Computed 125 place invariants in 56 ms
[2020-05-12 04:47:13] [INFO ] [Real]Absence check using 78 positive place invariants in 110 ms returned sat
[2020-05-12 04:47:13] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 46 ms returned sat
[2020-05-12 04:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:15] [INFO ] [Real]Absence check using state equation in 1331 ms returned sat
[2020-05-12 04:47:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:47:15] [INFO ] [Nat]Absence check using 78 positive place invariants in 63 ms returned sat
[2020-05-12 04:47:15] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2020-05-12 04:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:16] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2020-05-12 04:47:17] [INFO ] Deduced a trap composed of 15 places in 1111 ms
[2020-05-12 04:47:19] [INFO ] Deduced a trap composed of 13 places in 2016 ms
[2020-05-12 04:47:20] [INFO ] Deduced a trap composed of 15 places in 810 ms
[2020-05-12 04:47:20] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s281 s384 s385 s386 s714 s715) 0)") while checking expression at index 0
[2020-05-12 04:47:20] [INFO ] [Real]Absence check using 78 positive place invariants in 107 ms returned sat
[2020-05-12 04:47:21] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 54 ms returned sat
[2020-05-12 04:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:22] [INFO ] [Real]Absence check using state equation in 1670 ms returned sat
[2020-05-12 04:47:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:47:23] [INFO ] [Nat]Absence check using 78 positive place invariants in 551 ms returned sat
[2020-05-12 04:47:23] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2020-05-12 04:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:27] [INFO ] [Nat]Absence check using state equation in 4285 ms returned (error "Solver has unexpectedly terminated")
[2020-05-12 04:47:28] [INFO ] [Real]Absence check using 78 positive place invariants in 494 ms returned sat
[2020-05-12 04:47:28] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 34 ms returned sat
[2020-05-12 04:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:32] [INFO ] [Real]Absence check using state equation in 4373 ms returned (error "Solver has unexpectedly terminated")
[2020-05-12 04:47:32] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned sat
[2020-05-12 04:47:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2020-05-12 04:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:34] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2020-05-12 04:47:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:47:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 54 ms returned unsat
[2020-05-12 04:47:34] [INFO ] [Real]Absence check using 78 positive place invariants in 132 ms returned sat
[2020-05-12 04:47:34] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 69 ms returned sat
[2020-05-12 04:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:38] [INFO ] [Real]Absence check using state equation in 3720 ms returned sat
[2020-05-12 04:47:38] [INFO ] Deduced a trap composed of 13 places in 231 ms
[2020-05-12 04:47:38] [INFO ] Deduced a trap composed of 146 places in 278 ms
[2020-05-12 04:47:39] [INFO ] Deduced a trap composed of 17 places in 410 ms
[2020-05-12 04:47:39] [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: Broken pipe (> (+ s0 s1 s2 s37 s38 s39 s300 s303 s349 s350 s351 s390 s405 s565 s566 s718 s719) 0)") while checking expression at index 4
[2020-05-12 04:47:39] [INFO ] [Real]Absence check using 78 positive place invariants in 89 ms returned sat
[2020-05-12 04:47:39] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 61 ms returned sat
[2020-05-12 04:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:47:40] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2020-05-12 04:47:41] [INFO ] Deduced a trap composed of 8 places in 473 ms
[2020-05-12 04:47:42] [INFO ] Deduced a trap composed of 15 places in 552 ms
[2020-05-12 04:47:42] [INFO ] Deduced a trap composed of 17 places in 415 ms
[2020-05-12 04:47:43] [INFO ] Deduced a trap composed of 30 places in 650 ms
[2020-05-12 04:47:43] [INFO ] Deduced a trap composed of 15 places in 456 ms
[2020-05-12 04:47:44] [INFO ] Deduced a trap composed of 33 places in 471 ms
[2020-05-12 04:47:44] [INFO ] Deduced a trap composed of 33 places in 624 ms
[2020-05-12 04:47:44] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s73 s78 s79 s281 s284 s285 s286 s345 s355 s385 s526 s527 s528 s531 s532 s533 s536 s537 s538 s542 s694 s695 s710 s711) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 424 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 742 transition count 493
Reduce places removed 168 places and 0 transitions.
Iterating post reduction 1 with 168 rules applied. Total rules applied 346 place count 574 transition count 493
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 346 place count 574 transition count 380
Deduced a syphon composed of 113 places in 5 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 596 place count 437 transition count 380
Symmetric choice reduction at 2 with 94 rule applications. Total rules 690 place count 437 transition count 380
Deduced a syphon composed of 94 places in 4 ms
Reduce places removed 94 places and 94 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 878 place count 343 transition count 286
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 878 place count 343 transition count 277
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 899 place count 331 transition count 277
Symmetric choice reduction at 2 with 1 rule applications. Total rules 900 place count 331 transition count 277
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 902 place count 330 transition count 276
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 1140 place count 210 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1142 place count 209 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1144 place count 209 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1146 place count 207 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1147 place count 207 transition count 159
Applied a total of 1147 rules in 225 ms. Remains 207 /757 variables (removed 550) and now considering 159/670 (removed 511) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/757 places, 159/670 transitions.
Finished random walk after 1165 steps, including 52 resets, run visited all 5 properties in 11 ms. (steps per millisecond=105 )
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589258865519

--------------------
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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r021-oct2-158897699300598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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