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.r312-tall-165472282700765.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 itstools
Input is RingSingleMessageInMbox-PT-d1m020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282700765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 17K Jun 7 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 7 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 5.8M Jun 6 12:11 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 RingSingleMessageInMbox-PT-d1m020-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654930398780

Running Version 202205111006
[2022-06-11 06:53:19] [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-11 06:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 06:53:20] [INFO ] Load time of PNML (sax parser for PT used): 519 ms
[2022-06-11 06:53:20] [INFO ] Transformed 6690 places.
[2022-06-11 06:53:20] [INFO ] Transformed 11934 transitions.
[2022-06-11 06:53:20] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 677 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 4305 places in 40 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 11934 rows 2385 cols
[2022-06-11 06:53:21] [INFO ] Computed 5 place invariants in 966 ms
Incomplete random walk after 10000 steps, including 1530 resets, run finished after 907 ms. (steps per millisecond=11 ) properties (out of 7) seen :3
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 11934 rows 2385 cols
[2022-06-11 06:53:26] [INFO ] Computed 5 place invariants in 743 ms
[2022-06-11 06:53:26] [INFO ] [Real]Absence check using 2 positive place invariants in 39 ms returned sat
[2022-06-11 06:53:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 45 ms returned sat
[2022-06-11 06:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 06:53:30] [INFO ] [Real]Absence check using state equation in 3812 ms returned sat
[2022-06-11 06:53:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 06:53:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 36 ms returned sat
[2022-06-11 06:53:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 40 ms returned sat
[2022-06-11 06:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 06:53:34] [INFO ] [Nat]Absence check using state equation in 3851 ms returned sat
[2022-06-11 06:53:36] [INFO ] State equation strengthened by 9690 read => feed constraints.
[2022-06-11 06:53:36] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 06:53:36] [INFO ] [Real]Absence check using 2 positive place invariants in 34 ms returned sat
[2022-06-11 06:53:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 37 ms returned sat
[2022-06-11 06:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 06:53:39] [INFO ] [Real]Absence check using state equation in 2636 ms returned sat
[2022-06-11 06:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 06:53:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 32 ms returned sat
[2022-06-11 06:53:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 32 ms returned sat
[2022-06-11 06:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 06:53:42] [INFO ] [Nat]Absence check using state equation in 2549 ms returned sat
[2022-06-11 06:53: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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2385 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Graph (complete) has 16557 edges and 2385 vertex of which 2367 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.37 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 2367 transition count 11823
Discarding 1105 places :
Symmetric choice reduction at 1 with 1105 rule applications. Total rules 1217 place count 1262 transition count 2414
Iterating global reduction 1 with 1105 rules applied. Total rules applied 2322 place count 1262 transition count 2414
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2394 place count 1262 transition count 2342
Discarding 941 places :
Symmetric choice reduction at 2 with 941 rule applications. Total rules 3335 place count 321 transition count 1401
Iterating global reduction 2 with 941 rules applied. Total rules applied 4276 place count 321 transition count 1401
Ensure Unique test removed 894 transitions
Reduce isomorphic transitions removed 894 transitions.
Iterating post reduction 2 with 894 rules applied. Total rules applied 5170 place count 321 transition count 507
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5300 place count 191 transition count 377
Iterating global reduction 3 with 130 rules applied. Total rules applied 5430 place count 191 transition count 377
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5528 place count 191 transition count 279
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 5537 place count 182 transition count 258
Iterating global reduction 4 with 9 rules applied. Total rules applied 5546 place count 182 transition count 258
Applied a total of 5546 rules in 515 ms. Remains 182 /2385 variables (removed 2203) and now considering 258/11934 (removed 11676) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/2385 places, 258/11934 transitions.
// Phase 1: matrix 258 rows 182 cols
[2022-06-11 06:53:45] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 182982 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 2) seen :2
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d1m020-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26956 ms.

BK_STOP 1654930426997

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="RingSingleMessageInMbox-PT-d1m020"
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 RingSingleMessageInMbox-PT-d1m020, 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 r312-tall-165472282700765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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