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.r103-tall-167814479101077.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 lolaxred
Input is DatabaseWithMutex-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479101077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 78K Feb 25 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 372K Feb 25 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 742K Feb 25 13:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 42K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 157K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 718K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 840K Mar 5 18:22 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 DatabaseWithMutex-PT-10-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678315755182

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:49:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 22:49:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:49:16] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-08 22:49:16] [INFO ] Transformed 830 places.
[2023-03-08 22:49:16] [INFO ] Transformed 800 transitions.
[2023-03-08 22:49:16] [INFO ] Found NUPN structural information;
[2023-03-08 22:49:16] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA DatabaseWithMutex-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:49:16] [INFO ] Computed 130 place invariants in 50 ms
FORMULA DatabaseWithMutex-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :88
FORMULA DatabaseWithMutex-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :93
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :80
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :82
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :79
[2023-03-08 22:49:17] [INFO ] Invariant cache hit.
[2023-03-08 22:49:17] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2023-03-08 22:49:17] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 52 ms returned sat
[2023-03-08 22:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:18] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-08 22:49:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:49:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2023-03-08 22:49:18] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 55 ms returned sat
[2023-03-08 22:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:19] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-08 22:49:19] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 62 ms.
[2023-03-08 22:49:21] [INFO ] Added : 187 causal constraints over 38 iterations in 2005 ms. Result :sat
Minimization took 221 ms.
[2023-03-08 22:49:21] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-08 22:49:21] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 45 ms returned sat
[2023-03-08 22:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:21] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-08 22:49:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:49:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-08 22:49:22] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 42 ms returned sat
[2023-03-08 22:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:22] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-08 22:49:22] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 40 ms.
[2023-03-08 22:49:26] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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-03-08 22:49:27] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-08 22:49:27] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 56 ms returned sat
[2023-03-08 22:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:27] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-08 22:49:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:49:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-08 22:49:27] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 50 ms returned sat
[2023-03-08 22:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:27] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-08 22:49:28] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 50 ms.
[2023-03-08 22:49:32] [INFO ] Added : 410 causal constraints over 82 iterations in 4484 ms. Result :unknown
[2023-03-08 22:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 147 ms returned sat
[2023-03-08 22:49:32] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 77 ms returned unsat
[2023-03-08 22:49:33] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-08 22:49:33] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 26 ms returned unsat
[2023-03-08 22:49:33] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned unsat
[2023-03-08 22:49:33] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [3629, -1, -1, 10, 10, 10, 10] Max seen :[6, 63, 8, 10, 10, 10, 10]
FORMULA DatabaseWithMutex-PT-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 200 rules applied. Total rules applied 510 place count 620 transition count 500
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 610 place count 520 transition count 500
Free-agglomeration rule applied 100 times.
Iterating global reduction 4 with 100 rules applied. Total rules applied 710 place count 520 transition count 400
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 810 place count 420 transition count 400
Applied a total of 810 rules in 167 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 420/830 places, 400/800 transitions.
// Phase 1: matrix 400 rows 420 cols
[2023-03-08 22:49:38] [INFO ] Computed 120 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12358 ms. (steps per millisecond=80 ) properties (out of 3) seen :79
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2347 ms. (steps per millisecond=426 ) properties (out of 3) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3678 ms. (steps per millisecond=271 ) properties (out of 3) seen :101
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4998 ms. (steps per millisecond=200 ) properties (out of 3) seen :81
[2023-03-08 22:50:01] [INFO ] Invariant cache hit.
[2023-03-08 22:50:01] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-08 22:50:01] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 5 ms returned unsat
[2023-03-08 22:50:01] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-08 22:50:02] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 59 ms returned unsat
[2023-03-08 22:50:02] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-08 22:50:02] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 33 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 90, 10] Max seen :[10, 90, 10]
FORMULA DatabaseWithMutex-PT-10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-01 90 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 45619 ms.
ITS solved all properties within timeout

BK_STOP 1678315803094

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DatabaseWithMutex-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DatabaseWithMutex-PT-10, 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 r103-tall-167814479101077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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