## About the Execution of ITS-Tools for HealthRecord-PT-01

Execution Summary | |||||

Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |

225.760 | 35034.00 | 13893.00 | 16521.90 | 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/mcc2021-input.r292-tall-162124156200259.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off

Waiting for the VM to be ready (probing ssh)

...............................

=====================================================================

Generated by BenchKit 2-4028

Executing tool itstools

Input is HealthRecord-PT-01, examination is UpperBounds

Time confinement is 3600 seconds

Memory confinement is 16384 MBytes

Number of cores is 4

Run identifier is r292-tall-162124156200259

=====================================================================

--------------------

preparation of the directory to be used:

/home/mcc/execution

total 376K

-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt

-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.xml

-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt

-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml

-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt

-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml

-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt

-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml

-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel

-rw-r--r-- 1 mcc users 2.8K May 11 18:36 ReachabilityCardinality.txt

-rw-r--r-- 1 mcc users 16K May 11 18:36 ReachabilityCardinality.xml

-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt

-rw-r--r-- 1 mcc users 14K May 11 15:46 ReachabilityFireability.xml

-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt

-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col

-rw-r--r-- 1 mcc users 3 May 12 08:13 instance

-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored

-rw-r--r-- 1 mcc users 33K May 12 08:13 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 net-UpperBounds-00

FORMULA_NAME net-UpperBounds-01

FORMULA_NAME net-UpperBounds-02

FORMULA_NAME net-UpperBounds-03

FORMULA_NAME net-UpperBounds-04

FORMULA_NAME net-UpperBounds-05

FORMULA_NAME net-UpperBounds-06

FORMULA_NAME net-UpperBounds-07

FORMULA_NAME net-UpperBounds-08

FORMULA_NAME net-UpperBounds-09

FORMULA_NAME net-UpperBounds-10

FORMULA_NAME net-UpperBounds-11

FORMULA_NAME net-UpperBounds-12

FORMULA_NAME net-UpperBounds-13

FORMULA_NAME net-UpperBounds-14

FORMULA_NAME net-UpperBounds-15

=== Now, execution of the tool begins

**BK_START 1621280873064
**

Running Version 0

[2021-05-17 19:48:06] [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]

[2021-05-17 19:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml

[2021-05-17 19:48:06] [INFO ] Load time of PNML (sax parser for PT used): 45 ms

[2021-05-17 19:48:06] [INFO ] Transformed 117 places.

[2021-05-17 19:48:06] [INFO ] Transformed 218 transitions.

[2021-05-17 19:48:06] [INFO ] Found NUPN structural information;

[2021-05-17 19:48:06] [INFO ] Parsed PT model containing 117 places and 218 transitions in 88 ms.

Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.

Ensure Unique test removed 5 transitions

Reduce redundant transitions removed 5 transitions.

Normalized transition count is 205 out of 213 initially.

// Phase 1: matrix 205 rows 117 cols

[2021-05-17 19:48:06] [INFO ] Computed 14 place invariants in 17 ms

Incomplete random walk after 10000 steps, including 512 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :12
**FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
**

Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0

Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0

Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0

Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0

[2021-05-17 19:48:07] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)

// Phase 1: matrix 205 rows 117 cols

[2021-05-17 19:48:07] [INFO ] Computed 14 place invariants in 8 ms

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat

[2021-05-17 19:48:07] [INFO ] Solution in real domain found non-integer solution.

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat

[2021-05-17 19:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.

[2021-05-17 19:48:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat

[2021-05-17 19:48:07] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 29 ms.

[2021-05-17 19:48:07] [INFO ] Added : 45 causal constraints over 9 iterations in 144 ms. Result :sat

Minimization took 22 ms.

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat

[2021-05-17 19:48:07] [INFO ] Solution in real domain found non-integer solution.

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat

[2021-05-17 19:48:07] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 17 ms.

[2021-05-17 19:48:07] [INFO ] Added : 45 causal constraints over 9 iterations in 110 ms. Result :sat

Minimization took 21 ms.

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:07] [INFO ] [Real]Absence check using state equation in 52 ms returned sat

[2021-05-17 19:48:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat

[2021-05-17 19:48:07] [INFO ] Solution in real domain found non-integer solution.

[2021-05-17 19:48:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat

[2021-05-17 19:48:08] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 15 ms.

[2021-05-17 19:48:08] [INFO ] Added : 56 causal constraints over 12 iterations in 139 ms. Result :sat

Minimization took 23 ms.

[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:08] [INFO ] [Real]Absence check using state equation in 45 ms returned sat

[2021-05-17 19:48:08] [INFO ] Solution in real domain found non-integer solution.

[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat

[2021-05-17 19:48:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat

[2021-05-17 19:48:08] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 18 ms.

[2021-05-17 19:48:08] [INFO ] Added : 46 causal constraints over 10 iterations in 118 ms. Result :sat

Minimization took 21 ms.

Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]

Incomplete Parikh walk after 8300 steps, including 1002 resets, run finished after 34 ms. (steps per millisecond=244 ) properties (out of 4) seen :3 could not realise parikh vector
**FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
****FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
****FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
**

Incomplete Parikh walk after 9300 steps, including 825 resets, run finished after 32 ms. (steps per millisecond=290 ) properties (out of 1) seen :0 could not realise parikh vector

Incomplete Parikh walk after 8100 steps, including 466 resets, run finished after 31 ms. (steps per millisecond=261 ) properties (out of 1) seen :0 could not realise parikh vector

Incomplete Parikh walk after 8200 steps, including 316 resets, run finished after 24 ms. (steps per millisecond=341 ) properties (out of 1) seen :0 could not realise parikh vector

Support contains 1 out of 117 places. Attempting structural reductions.

Drop transitions removed 1 transitions

Starting structural reductions, iteration 0 : 117/117 places, 212/212 transitions.

Graph (trivial) has 172 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 4 ms

Free SCC test removed 7 places

Drop transitions removed 22 transitions

Reduce isomorphic transitions removed 22 transitions.

Graph (complete) has 401 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms

Discarding 7 places :

Also discarding 0 output transitions

Drop transitions removed 7 transitions

Trivial Post-agglo rules discarded 7 transitions

Performed 7 trivial Post agglomeration. Transition count delta: 7

Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 103 transition count 183

Reduce places removed 7 places and 0 transitions.

Ensure Unique test removed 7 transitions

Reduce isomorphic transitions removed 7 transitions.

Drop transitions removed 2 transitions

Trivial Post-agglo rules discarded 2 transitions

Performed 2 trivial Post agglomeration. Transition count delta: 2

Iterating post reduction 1 with 16 rules applied. Total rules applied 25 place count 96 transition count 174

Reduce places removed 2 places and 0 transitions.

Ensure Unique test removed 1 transitions

Reduce isomorphic transitions removed 1 transitions.

Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 94 transition count 173

Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..

Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 28 place count 94 transition count 169

Deduced a syphon composed of 4 places in 0 ms

Ensure Unique test removed 3 places

Reduce places removed 7 places and 0 transitions.

Iterating global reduction 3 with 11 rules applied. Total rules applied 39 place count 87 transition count 169

Discarding 46 places :

Symmetric choice reduction at 3 with 46 rule applications. Total rules 85 place count 41 transition count 77

Iterating global reduction 3 with 46 rules applied. Total rules applied 131 place count 41 transition count 77

Discarding 10 places :

Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 31 transition count 57

Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 31 transition count 57

Ensure Unique test removed 4 transitions

Reduce isomorphic transitions removed 4 transitions.

Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 31 transition count 53

Discarding 3 places :

Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 28 transition count 44

Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 28 transition count 44

Discarding 3 places :

Symmetric choice reduction at 4 with 3 rule applications. Total rules 164 place count 25 transition count 38

Iterating global reduction 4 with 3 rules applied. Total rules applied 167 place count 25 transition count 38

Ensure Unique test removed 3 transitions

Reduce isomorphic transitions removed 3 transitions.

Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 25 transition count 35

Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1

Deduced a syphon composed of 1 places in 0 ms

Reduce places removed 1 places and 0 transitions.

Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 24 transition count 34

Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16

Deduced a syphon composed of 4 places in 0 ms

Reduce places removed 4 places and 0 transitions.

Iterating global reduction 5 with 8 rules applied. Total rules applied 180 place count 20 transition count 50

Drop transitions removed 2 transitions

Redundant transition composition rules discarded 2 transitions

Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 20 transition count 48

Partial Free-agglomeration rule applied 9 times.

Drop transitions removed 9 transitions

Iterating global reduction 5 with 9 rules applied. Total rules applied 191 place count 20 transition count 48

Partial Free-agglomeration rule applied 8 times.

Drop transitions removed 8 transitions

Iterating global reduction 5 with 8 rules applied. Total rules applied 199 place count 20 transition count 48

Applied a total of 199 rules in 40 ms. Remains 20 /117 variables (removed 97) and now considering 48/212 (removed 164) transitions.

[2021-05-17 19:48:08] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)

// Phase 1: matrix 47 rows 20 cols

[2021-05-17 19:48:08] [INFO ] Computed 4 place invariants in 1 ms

[2021-05-17 19:48:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []

Finished structural reductions, in 1 iterations. Remains : 20/117 places, 48/212 transitions.

Normalized transition count is 47 out of 48 initially.

// Phase 1: matrix 47 rows 20 cols

[2021-05-17 19:48:08] [INFO ] Computed 4 place invariants in 1 ms

Incomplete random walk after 1000000 steps, including 342597 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 1) seen :1
**FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
**

All properties solved without resorting to model-checking.

**BK_STOP 1621280908098
**

--------------------

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="HealthRecord-PT-01"

export BK_EXAMINATION="UpperBounds"

export BK_TOOL="itstools"

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 itstools"

echo " Input is HealthRecord-PT-01, 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 r292-tall-162124156200259"

echo "====================================================================="

echo

echo "--------------------"

echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz

mv HealthRecord-PT-01 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 '

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 ;