Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246100045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Anderson-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 927K Mar 31 16:48 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 Anderson-PT-09-UpperBounds-00
FORMULA_NAME Anderson-PT-09-UpperBounds-01
FORMULA_NAME Anderson-PT-09-UpperBounds-02
FORMULA_NAME Anderson-PT-09-UpperBounds-03
FORMULA_NAME Anderson-PT-09-UpperBounds-04
FORMULA_NAME Anderson-PT-09-UpperBounds-05
FORMULA_NAME Anderson-PT-09-UpperBounds-06
FORMULA_NAME Anderson-PT-09-UpperBounds-07
FORMULA_NAME Anderson-PT-09-UpperBounds-08
FORMULA_NAME Anderson-PT-09-UpperBounds-09
FORMULA_NAME Anderson-PT-09-UpperBounds-10
FORMULA_NAME Anderson-PT-09-UpperBounds-11
FORMULA_NAME Anderson-PT-09-UpperBounds-12
FORMULA_NAME Anderson-PT-09-UpperBounds-13
FORMULA_NAME Anderson-PT-09-UpperBounds-14
FORMULA_NAME Anderson-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680864077502

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 10:41:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 10:41:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 10:41:20] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-04-07 10:41:20] [INFO ] Transformed 505 places.
[2023-04-07 10:41:20] [INFO ] Transformed 1845 transitions.
[2023-04-07 10:41:20] [INFO ] Found NUPN structural information;
[2023-04-07 10:41:20] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1845 rows 505 cols
[2023-04-07 10:41:20] [INFO ] Computed 21 invariants in 64 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 16) seen :13
FORMULA Anderson-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
[2023-04-07 10:41:20] [INFO ] Invariant cache hit.
[2023-04-07 10:41:21] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned sat
[2023-04-07 10:41:21] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 10:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:21] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2023-04-07 10:41:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 10:41:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-04-07 10:41:22] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 23 ms returned sat
[2023-04-07 10:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:23] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2023-04-07 10:41:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:41:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 101 ms returned sat
[2023-04-07 10:41:23] [INFO ] Computed and/alt/rep : 234/1395/234 causal constraints (skipped 1602 transitions) in 344 ms.
[2023-04-07 10:41:26] [INFO ] Deduced a trap composed of 255 places in 426 ms of which 9 ms to minimize.
[2023-04-07 10:41:27] [INFO ] Deduced a trap composed of 179 places in 413 ms of which 1 ms to minimize.
[2023-04-07 10:41:27] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 10:41:27] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-04-07 10:41:27] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 10:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:28] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-04-07 10:41:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 10:41:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-04-07 10:41:28] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 7 ms returned sat
[2023-04-07 10:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:28] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2023-04-07 10:41:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 696 ms returned sat
[2023-04-07 10:41:29] [INFO ] Computed and/alt/rep : 234/1395/234 causal constraints (skipped 1602 transitions) in 144 ms.
[2023-04-07 10:41:30] [INFO ] Added : 12 causal constraints over 3 iterations in 717 ms. Result :sat
Minimization took 416 ms.
[2023-04-07 10:41:30] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-04-07 10:41:30] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 10:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:31] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-04-07 10:41:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 10:41:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-04-07 10:41:31] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 10:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:31] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-04-07 10:41:32] [INFO ] [Nat]Added 72 Read/Feed constraints in 448 ms returned sat
[2023-04-07 10:41:32] [INFO ] Computed and/alt/rep : 234/1395/234 causal constraints (skipped 1602 transitions) in 199 ms.
[2023-04-07 10:41:34] [INFO ] Added : 68 causal constraints over 15 iterations in 2298 ms. Result :sat
Minimization took 931 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA Anderson-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 505 transition count 1774
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 434 transition count 1774
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 285 place count 291 transition count 479
Iterating global reduction 0 with 143 rules applied. Total rules applied 428 place count 291 transition count 479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 430 place count 290 transition count 478
Applied a total of 430 rules in 139 ms. Remains 290 /505 variables (removed 215) and now considering 478/1845 (removed 1367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 290/505 places, 478/1845 transitions.
// Phase 1: matrix 478 rows 290 cols
[2023-04-07 10:41:36] [INFO ] Computed 21 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1610 ms. (steps per millisecond=621 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 2) seen :0
[2023-04-07 10:41:40] [INFO ] Invariant cache hit.
[2023-04-07 10:41:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 10:41:40] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 10:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:40] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-04-07 10:41:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 10:41:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 10:41:40] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 10:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:40] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-04-07 10:41:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:41:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 59 ms returned sat
[2023-04-07 10:41:40] [INFO ] Computed and/alt/rep : 91/676/91 causal constraints (skipped 378 transitions) in 46 ms.
[2023-04-07 10:41:41] [INFO ] Added : 56 causal constraints over 12 iterations in 548 ms. Result :sat
Minimization took 225 ms.
[2023-04-07 10:41:41] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 10:41:41] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 10:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:41] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-04-07 10:41:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 10:41:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 10:41:41] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 10:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 10:41:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-07 10:41:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 77 ms returned sat
[2023-04-07 10:41:41] [INFO ] Computed and/alt/rep : 91/676/91 causal constraints (skipped 378 transitions) in 26 ms.
[2023-04-07 10:41:42] [INFO ] Added : 40 causal constraints over 8 iterations in 339 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA Anderson-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Anderson-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 23114 ms.
ITS solved all properties within timeout

BK_STOP 1680864103784

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="Anderson-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-09, 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 r521-tall-167987246100045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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