fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r052-oct2-162038307500196
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CloudDeployment-PT-5a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2221.500 25412.00 43404.00 194.70 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r052-oct2-162038307500196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 CloudDeployment-PT-5a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-oct2-162038307500196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 230K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1620843182491

Running Version 0
[2021-05-12 18:13:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-12 18:13:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:13:06] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2021-05-12 18:13:06] [INFO ] Transformed 180 places.
[2021-05-12 18:13:06] [INFO ] Transformed 675 transitions.
[2021-05-12 18:13:06] [INFO ] Found NUPN structural information;
[2021-05-12 18:13:06] [INFO ] Parsed PT model containing 180 places and 675 transitions in 153 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.17339KB memory used
Starting structural reductions, iteration 0 : 180/180 places, 595/595 transitions.
Graph (trivial) has 201 edges and 180 vertex of which 50 / 180 are part of one of the 15 SCC in 23 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1567 edges and 145 vertex of which 134 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 126 transition count 457
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 126 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 124 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 124 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 454
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 54 place count 108 transition count 499
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 0 with 130 rules applied. Total rules applied 184 place count 108 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 185 place count 107 transition count 368
Applied a total of 185 rules in 152 ms. Remains 107 /180 variables (removed 73) and now considering 368/595 (removed 227) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/180 places, 368/595 transitions.
Random walk for 1250000 steps, including 24488 resets, run took 2197 ms (no deadlock found). (steps per millisecond=568 )
Random directed walk for 1250005 steps, including 7520 resets, run took 1963 ms (no deadlock found). (steps per millisecond=636 )
[2021-05-12 18:13:10] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2021-05-12 18:13:10] [INFO ] Computed 19 place invariants in 7 ms
[2021-05-12 18:13:10] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 9 ms returned sat
[2021-05-12 18:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:10] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-12 18:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:13:10] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 3 ms returned sat
[2021-05-12 18:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:10] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-12 18:13:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-12 18:13:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2021-05-12 18:13:10] [INFO ] Computed and/alt/rep : 114/207/114 causal constraints (skipped 13 transitions) in 36 ms.
[2021-05-12 18:13:11] [INFO ] Added : 70 causal constraints over 14 iterations in 255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
Parikh directed walk for 7500 steps, including 138 resets, run took 25 ms. (steps per millisecond=300 )
Random directed walk for 500009 steps, including 3008 resets, run took 840 ms (no deadlock found). (steps per millisecond=595 )
Random walk for 500000 steps, including 9818 resets, run took 792 ms (no deadlock found). (steps per millisecond=631 )
Random directed walk for 500002 steps, including 3016 resets, run took 791 ms (no deadlock found). (steps per millisecond=632 )
Random walk for 500000 steps, including 9771 resets, run took 651 ms (no deadlock found). (steps per millisecond=768 )
Starting structural reductions, iteration 0 : 107/107 places, 368/368 transitions.
Applied a total of 0 rules in 18 ms. Remains 107 /107 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2021-05-12 18:13:14] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2021-05-12 18:13:14] [INFO ] Computed 19 place invariants in 8 ms
[2021-05-12 18:13:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2021-05-12 18:13:14] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2021-05-12 18:13:14] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-12 18:13:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-12 18:13:14] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2021-05-12 18:13:15] [INFO ] Redundant transitions in 1203 ms returned []
[2021-05-12 18:13:15] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2021-05-12 18:13:15] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 18:13:16] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 368/368 transitions.
Random walk for 1250000 steps, including 24525 resets, run took 2616 ms (no deadlock found). (steps per millisecond=477 )
Random directed walk for 1250000 steps, including 7520 resets, run took 2170 ms (no deadlock found). (steps per millisecond=576 )
[2021-05-12 18:13:20] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2021-05-12 18:13:20] [INFO ] Computed 19 place invariants in 8 ms
[2021-05-12 18:13:21] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 4 ms returned sat
[2021-05-12 18:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:21] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-12 18:13:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:13:21] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 76 ms returned sat
[2021-05-12 18:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-12 18:13:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-12 18:13:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 12 ms returned sat
[2021-05-12 18:13:21] [INFO ] Computed and/alt/rep : 114/207/114 causal constraints (skipped 13 transitions) in 11 ms.
[2021-05-12 18:13:21] [INFO ] Added : 70 causal constraints over 14 iterations in 158 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Parikh directed walk for 7500 steps, including 137 resets, run took 26 ms. (steps per millisecond=288 )
Random directed walk for 500012 steps, including 3004 resets, run took 744 ms (no deadlock found). (steps per millisecond=672 )
Random walk for 500000 steps, including 9776 resets, run took 741 ms (no deadlock found). (steps per millisecond=674 )
Random directed walk for 500015 steps, including 2998 resets, run took 764 ms (no deadlock found). (steps per millisecond=654 )
Random walk for 500000 steps, including 9765 resets, run took 715 ms (no deadlock found). (steps per millisecond=699 )
[2021-05-12 18:13:25] [INFO ] Flatten gal took : 259 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6568205866335737449
[2021-05-12 18:13:25] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2021-05-12 18:13:25] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 18:13:25] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2021-05-12 18:13:25] [INFO ] Applying decomposition
[2021-05-12 18:13:25] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 18:13:25] [INFO ] Flatten gal took : 80 ms
[2021-05-12 18:13:25] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2021-05-12 18:13:25] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 18:13:25] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6568205866335737449
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6568205866335737449]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12364265552354564189.txt, -o, /tmp/graph12364265552354564189.bin, -w, /tmp/graph12364265552354564189.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12364265552354564189.bin, -l, -1, -v, -w, /tmp/graph12364265552354564189.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:13:26] [INFO ] Decomposing Gal with order
[2021-05-12 18:13:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:13:26] [INFO ] Removed a total of 615 redundant transitions.
[2021-05-12 18:13:26] [INFO ] Flatten gal took : 310 ms
[2021-05-12 18:13:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 32 ms.
[2021-05-12 18:13:26] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9566366980314192892.gal : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock9566366980314192892.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock9566366980314192892.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4883e+08,0.29238,8336,256,119,7065,719,796,9433,247,1616,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,2,0.354444,8336,62,61,7065,753,2100,9433,1136,1616,6116

System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ i9={[ u34={[ ]
} u33={[ ]
} u32={[ ]
} u30={[ ]
} u31={[ ]
} ]
} i8={[ u45={[ ]
} u36={[ p140=1 ]
} u35={[ ]
} u29={[ ]
} ]
} i7={[ u28={[ p112=1 ]
} u27={[ ]
} u26={[ ]
} ]
} i6={[ u25={[ ]
} u24={[ ]
} u22={[ ]
} u23={[ ]
} ]
} i10={[ i1={[ u42={[ p85=1 p87=1 p59=1 p113=1 p57=1 p115=1 p31=1 p141=1 p29=1 p3=1 p1=1 ]
} u41={[ ]
} u40={[ ]
} u39={[ ]
} u38={[ ]
} ]
} i0={[ u48={[ ]
} u37={[ ]
} ]
} ]
} i5={[ u46={[ ]
} u21={[ p84=1 ]
} u20={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} i3={[ u14={[ p56=1 ]
} u13={[ ]
} u12={[ ]
} ]
} i1={[ u47={[ ]
} u44={[ ]
} u43={[ ]
} u7={[ p28=1 ]
} u6={[ ]
} u0={[ ]
} ]
} i2={[ u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} i0={[ u5={[ ]
} u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
[ i9={[ u34={[ ]
} u33={[ ]
} u32={[ ]
} u30={[ ]
} u31={[ ]
} ]
} i8={[ u45={[ ]
} u36={[ ]
} u35={[ ]
} u29={[ ]
} ]
} i7={[ u28={[ ]
} u27={[ ]
} u26={[ ]
} ]
} i6={[ u25={[ ]
} u24={[ ]
} u22={[ ]
} u23={[ ]
} ]
} i10={[ i1={[ u42={[ ]
} u41={[ ]
} u40={[ ]
} u39={[ ]
} u38={[ ]
} ]
} i0={[ u48={[ ]
} u37={[ ]
} ]
} ]
} i5={[ u46={[ ]
} u21={[ ]
} u20={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} i3={[ u14={[ ]
} u13={[ ]
} u12={[ ]
} ]
} i1={[ u47={[ ]
} u44={[ ]
} u43={[ ]
} u7={[ ]
} u6={[ ]
} u0={[ ]
} ]
} i2={[ u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} i0={[ u5={[ ]
} u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620843207903

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CloudDeployment-PT-5a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-5a, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r052-oct2-162038307500196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5a.tgz
mv CloudDeployment-PT-5a execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;