fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r135-smll-167819413900269
Last Updated
May 14, 2023

About the Execution of LoLa+red for Diffusion2D-PT-D50N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
543.140 87571.00 102590.00 633.30 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 normal

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.r135-smll-167819413900269.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 Diffusion2D-PT-D50N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413900269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 7.3K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 Diffusion2D-PT-D50N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D50N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678310003646

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=Diffusion2D-PT-D50N100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 21:13:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 21:13:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:13:28] [INFO ] Load time of PNML (sax parser for PT used): 987 ms
[2023-03-08 21:13:28] [INFO ] Transformed 2500 places.
[2023-03-08 21:13:28] [INFO ] Transformed 19404 transitions.
[2023-03-08 21:13:28] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 1255 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-08 21:13:28] [INFO ] Computed 1 place invariants in 229 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
[2023-03-08 21:13:29] [INFO ] Invariant cache hit.
[2023-03-08 21:13:30] [INFO ] [Real]Absence check using 1 positive place invariants in 66 ms returned sat
[2023-03-08 21:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:34] [INFO ] [Real]Absence check using state equation in 3971 ms returned unknown
[2023-03-08 21:13:34] [INFO ] [Real]Absence check using 1 positive place invariants in 61 ms returned sat
[2023-03-08 21:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:39] [INFO ] [Real]Absence check using state equation in 4457 ms returned unknown
[2023-03-08 21:13:39] [INFO ] [Real]Absence check using 1 positive place invariants in 46 ms returned sat
[2023-03-08 21:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:44] [INFO ] [Real]Absence check using state equation in 4558 ms returned unknown
[2023-03-08 21:13:44] [INFO ] [Real]Absence check using 1 positive place invariants in 61 ms returned sat
[2023-03-08 21:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:49] [INFO ] [Real]Absence check using state equation in 4393 ms returned unknown
[2023-03-08 21:13:49] [INFO ] [Real]Absence check using 1 positive place invariants in 57 ms returned sat
[2023-03-08 21:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:54] [INFO ] [Real]Absence check using state equation in 4509 ms returned unknown
[2023-03-08 21:13:54] [INFO ] [Real]Absence check using 1 positive place invariants in 56 ms returned sat
[2023-03-08 21:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:13:59] [INFO ] [Real]Absence check using state equation in 4518 ms returned unknown
[2023-03-08 21:13:59] [INFO ] [Real]Absence check using 1 positive place invariants in 61 ms returned sat
[2023-03-08 21:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:04] [INFO ] [Real]Absence check using state equation in 4410 ms returned unknown
[2023-03-08 21:14:04] [INFO ] [Real]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:09] [INFO ] [Real]Absence check using state equation in 4646 ms returned unknown
[2023-03-08 21:14:09] [INFO ] [Real]Absence check using 1 positive place invariants in 62 ms returned sat
[2023-03-08 21:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:14] [INFO ] [Real]Absence check using state equation in 4466 ms returned unknown
[2023-03-08 21:14:14] [INFO ] [Real]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:19] [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 9
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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 21:14:19] [INFO ] [Real]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:24] [INFO ] [Real]Absence check using state equation in 4638 ms returned unknown
[2023-03-08 21:14:24] [INFO ] [Real]Absence check using 1 positive place invariants in 60 ms returned sat
[2023-03-08 21:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:29] [INFO ] [Real]Absence check using state equation in 4470 ms returned unknown
[2023-03-08 21:14:29] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2023-03-08 21:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:34] [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 12
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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 21:14:34] [INFO ] [Real]Absence check using 1 positive place invariants in 51 ms returned sat
[2023-03-08 21:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:39] [INFO ] [Real]Absence check using state equation in 4464 ms returned unknown
[2023-03-08 21:14:39] [INFO ] [Real]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:44] [INFO ] [Real]Absence check using state equation in 4642 ms returned unknown
[2023-03-08 21:14:44] [INFO ] [Real]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:14:49] [INFO ] [Real]Absence check using state equation in 4646 ms returned unknown
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19148 edges and 2500 vertex of which 2484 / 2500 are part of one of the 1 SCC in 55 ms
Free SCC test removed 2483 places
Drop transitions removed 19148 transitions
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 19372 transitions.
Applied a total of 1 rules in 169 ms. Remains 17 /2500 variables (removed 2483) and now considering 32/19404 (removed 19372) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 17/2500 places, 32/19404 transitions.
// Phase 1: matrix 32 rows 17 cols
[2023-03-08 21:14:49] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000058 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=3773 ) properties (out of 16) seen :1600
FORMULA Diffusion2D-PT-D50N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 82991 ms.
ITS solved all properties within timeout

BK_STOP 1678310091217

--------------------
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="Diffusion2D-PT-D50N100"
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 Diffusion2D-PT-D50N100, 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 r135-smll-167819413900269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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