fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r305-smll-165463878400097
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for StigmergyElection-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
241.107 13232.00 24001.00 312.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878400097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is StigmergyElection-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K May 30 14:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 30 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 30 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 71K May 29 12:20 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654730451631

Running Version 0
[2022-06-08 23:20:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2022-06-08 23:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:20:54] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-06-08 23:20:54] [INFO ] Transformed 291 places.
[2022-06-08 23:20:54] [INFO ] Transformed 332 transitions.
[2022-06-08 23:20:54] [INFO ] Found NUPN structural information;
[2022-06-08 23:20:54] [INFO ] Parsed PT model containing 291 places and 332 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 332 rows 291 cols
[2022-06-08 23:20:54] [INFO ] Computed 3 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :11
FORMULA StigmergyElection-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
FORMULA StigmergyElection-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
FORMULA StigmergyElection-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 332 rows 291 cols
[2022-06-08 23:20:55] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-08 23:20:55] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-06-08 23:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:55] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-06-08 23:20:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2022-06-08 23:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:56] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2022-06-08 23:20:56] [INFO ] Deduced a trap composed of 159 places in 227 ms of which 5 ms to minimize.
[2022-06-08 23:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2022-06-08 23:20:56] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 67 ms.
[2022-06-08 23:20:58] [INFO ] Added : 214 causal constraints over 43 iterations in 1771 ms. Result :sat
Minimization took 140 ms.
[2022-06-08 23:20:58] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-06-08 23:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:58] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-08 23:20:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-06-08 23:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:59] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-06-08 23:20:59] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 3 ms to minimize.
[2022-06-08 23:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-06-08 23:20:59] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 33 ms.
[2022-06-08 23:21:00] [INFO ] Added : 196 causal constraints over 40 iterations in 1426 ms. Result :sat
Minimization took 103 ms.
[2022-06-08 23:21:01] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-06-08 23:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:01] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-08 23:21:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-06-08 23:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:01] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-06-08 23:21:01] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 31 ms.
[2022-06-08 23:21:02] [INFO ] Added : 179 causal constraints over 36 iterations in 1272 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 25700 steps, including 663 resets, run finished after 97 ms. (steps per millisecond=264 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 212 resets, run finished after 54 ms. (steps per millisecond=272 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA StigmergyElection-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 57800 steps, including 1002 resets, run finished after 103 ms. (steps per millisecond=561 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 332/332 transitions.
Graph (trivial) has 293 edges and 291 vertex of which 42 / 291 are part of one of the 6 SCC in 9 ms
Free SCC test removed 36 places
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 349 edges and 255 vertex of which 251 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 251 transition count 100
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 194 rules applied. Total rules applied 380 place count 69 transition count 88
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 388 place count 63 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 390 place count 61 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 390 place count 61 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 398 place count 57 transition count 82
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 416 place count 39 transition count 64
Iterating global reduction 4 with 18 rules applied. Total rules applied 434 place count 39 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 434 place count 39 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 438 place count 37 transition count 62
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 445 place count 30 transition count 46
Iterating global reduction 4 with 7 rules applied. Total rules applied 452 place count 30 transition count 46
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 457 place count 30 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 467 place count 25 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 468 place count 25 transition count 35
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 469 place count 24 transition count 34
Iterating global reduction 6 with 1 rules applied. Total rules applied 470 place count 24 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 472 place count 23 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 474 place count 23 transition count 32
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 485 place count 23 transition count 21
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 501 place count 12 transition count 16
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 503 place count 10 transition count 14
Iterating global reduction 7 with 2 rules applied. Total rules applied 505 place count 10 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 506 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 507 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 508 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 509 place count 8 transition count 11
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 514 place count 5 transition count 8
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 517 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 517 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 519 place count 4 transition count 4
Applied a total of 519 rules in 90 ms. Remains 4 /291 variables (removed 287) and now considering 4/332 (removed 328) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/291 places, 4/332 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-06-08 23:21:03] [INFO ] Computed 1 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 2) seen :2
FORMULA StigmergyElection-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654730464863

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -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 3600 -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="StigmergyElection-PT-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is StigmergyElection-PT-02b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878400097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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