Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100677.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100677
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 CANConstruction-PT-080-UpperBounds-00
FORMULA_NAME CANConstruction-PT-080-UpperBounds-01
FORMULA_NAME CANConstruction-PT-080-UpperBounds-02
FORMULA_NAME CANConstruction-PT-080-UpperBounds-03
FORMULA_NAME CANConstruction-PT-080-UpperBounds-04
FORMULA_NAME CANConstruction-PT-080-UpperBounds-05
FORMULA_NAME CANConstruction-PT-080-UpperBounds-06
FORMULA_NAME CANConstruction-PT-080-UpperBounds-07
FORMULA_NAME CANConstruction-PT-080-UpperBounds-08
FORMULA_NAME CANConstruction-PT-080-UpperBounds-09
FORMULA_NAME CANConstruction-PT-080-UpperBounds-10
FORMULA_NAME CANConstruction-PT-080-UpperBounds-11
FORMULA_NAME CANConstruction-PT-080-UpperBounds-12
FORMULA_NAME CANConstruction-PT-080-UpperBounds-13
FORMULA_NAME CANConstruction-PT-080-UpperBounds-14
FORMULA_NAME CANConstruction-PT-080-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678740018993

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:40:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:40:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:40:21] [INFO ] Load time of PNML (sax parser for PT used): 553 ms
[2023-03-13 20:40:21] [INFO ] Transformed 13762 places.
[2023-03-13 20:40:21] [INFO ] Transformed 26240 transitions.
[2023-03-13 20:40:21] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 777 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-13 20:40:22] [INFO ] Computed 161 place invariants in 477 ms
FORMULA CANConstruction-PT-080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 15) seen :1
FORMULA CANConstruction-PT-080-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) 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 14) seen :0
[2023-03-13 20:40:22] [INFO ] Invariant cache hit.
[2023-03-13 20:40:24] [INFO ] [Real]Absence check using 81 positive place invariants in 428 ms returned sat
[2023-03-13 20:40:24] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 63 ms returned sat
[2023-03-13 20:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: 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-13 20:40:29] [INFO ] [Real]Absence check using 81 positive place invariants in 382 ms returned sat
[2023-03-13 20:40:29] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 73 ms returned sat
[2023-03-13 20:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:32] [INFO ] [Real]Absence check using state equation in 3203 ms returned unknown
[2023-03-13 20:40:34] [INFO ] [Real]Absence check using 81 positive place invariants in 485 ms returned sat
[2023-03-13 20:40:35] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 98 ms returned sat
[2023-03-13 20:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:37] [INFO ] [Real]Absence check using state equation in 2959 ms returned unknown
[2023-03-13 20:40:39] [INFO ] [Real]Absence check using 81 positive place invariants in 348 ms returned sat
[2023-03-13 20:40:39] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 60 ms returned sat
[2023-03-13 20:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:43] [INFO ] [Real]Absence check using state equation in 3263 ms returned unknown
[2023-03-13 20:40:44] [INFO ] [Real]Absence check using 81 positive place invariants in 373 ms returned sat
[2023-03-13 20:40:44] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 63 ms returned sat
[2023-03-13 20:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:48] [INFO ] [Real]Absence check using state equation in 3316 ms returned unknown
[2023-03-13 20:40:49] [INFO ] [Real]Absence check using 81 positive place invariants in 366 ms returned sat
[2023-03-13 20:40:49] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 108 ms returned sat
[2023-03-13 20:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:53] [INFO ] [Real]Absence check using state equation in 3100 ms returned unknown
[2023-03-13 20:40:54] [INFO ] [Real]Absence check using 81 positive place invariants in 351 ms returned sat
[2023-03-13 20:40:54] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 71 ms returned sat
[2023-03-13 20:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:40:58] [INFO ] [Real]Absence check using state equation in 3148 ms returned unknown
[2023-03-13 20:40:59] [INFO ] [Real]Absence check using 81 positive place invariants in 359 ms returned sat
[2023-03-13 20:40:59] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 114 ms returned sat
[2023-03-13 20:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:03] [INFO ] [Real]Absence check using state equation in 3344 ms returned unknown
[2023-03-13 20:41:04] [INFO ] [Real]Absence check using 81 positive place invariants in 357 ms returned sat
[2023-03-13 20:41:04] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 64 ms returned sat
[2023-03-13 20:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:08] [INFO ] [Real]Absence check using state equation in 3343 ms returned unknown
[2023-03-13 20:41:09] [INFO ] [Real]Absence check using 81 positive place invariants in 343 ms returned sat
[2023-03-13 20:41:09] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 104 ms returned sat
[2023-03-13 20:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:13] [INFO ] [Real]Absence check using state equation in 3529 ms returned unknown
[2023-03-13 20:41:14] [INFO ] [Real]Absence check using 81 positive place invariants in 359 ms returned sat
[2023-03-13 20:41:14] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 105 ms returned sat
[2023-03-13 20:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:18] [INFO ] [Real]Absence check using state equation in 3385 ms returned unknown
[2023-03-13 20:41:19] [INFO ] [Real]Absence check using 81 positive place invariants in 354 ms returned sat
[2023-03-13 20:41:19] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 67 ms returned sat
[2023-03-13 20:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:23] [INFO ] [Real]Absence check using state equation in 3379 ms returned unknown
[2023-03-13 20:41:25] [INFO ] [Real]Absence check using 81 positive place invariants in 379 ms returned sat
[2023-03-13 20:41:25] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2023-03-13 20:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:28] [INFO ] [Real]Absence check using state equation in 3050 ms returned unknown
[2023-03-13 20:41:29] [INFO ] [Real]Absence check using 81 positive place invariants in 342 ms returned sat
[2023-03-13 20:41:29] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2023-03-13 20:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:41:33] [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 13
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13762 transition count 25680
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13202 transition count 25680
Discarding 6234 places :
Symmetric choice reduction at 2 with 6234 rule applications. Total rules 7354 place count 6968 transition count 13212
Iterating global reduction 2 with 6234 rules applied. Total rules applied 13588 place count 6968 transition count 13212
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 13748 place count 6888 transition count 13132
Free-agglomeration rule applied 148 times.
Iterating global reduction 2 with 148 rules applied. Total rules applied 13896 place count 6888 transition count 12984
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 14044 place count 6740 transition count 12984
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 14056 place count 6740 transition count 12984
Applied a total of 14056 rules in 10149 ms. Remains 6740 /13762 variables (removed 7022) and now considering 12984/26240 (removed 13256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10151 ms. Remains : 6740/13762 places, 12984/26240 transitions.
// Phase 1: matrix 12984 rows 6740 cols
[2023-03-13 20:41:43] [INFO ] Computed 161 place invariants in 89 ms
Incomplete random walk after 1000000 steps, including 1800 resets, run finished after 20551 ms. (steps per millisecond=48 ) properties (out of 14) seen :14
FORMULA CANConstruction-PT-080-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 103479 ms.
ITS solved all properties within timeout

BK_STOP 1678740124338

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-080"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANConstruction-PT-080, 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 r042-tajo-167813696100677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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