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

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
818.188 222105.00 287120.00 721.80 T 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.r248-tall-167856435400468.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 marciexred
Input is MultiCrashLeafsetExtension-PT-S16C02, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-tall-167856435400468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678729921566

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 17:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:52:03] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-13 17:52:03] [INFO ] Transformed 2952 places.
[2023-03-13 17:52:03] [INFO ] Transformed 4255 transitions.
[2023-03-13 17:52:03] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 303 ms.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 2952) seen :1928
Running SMT prover for 1024 properties.
[2023-03-13 17:52:05] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-13 17:52:05] [INFO ] Computed 421 place invariants in 176 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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 17:52:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:52:31] [INFO ] After 25070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1024 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1024 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.13 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 2928 transition count 3863
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 785 place count 2536 transition count 3863
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 785 place count 2536 transition count 3795
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 921 place count 2468 transition count 3795
Discarding 324 places :
Symmetric choice reduction at 2 with 324 rule applications. Total rules 1245 place count 2144 transition count 3471
Iterating global reduction 2 with 324 rules applied. Total rules applied 1569 place count 2144 transition count 3471
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 1667 place count 2046 transition count 3275
Iterating global reduction 2 with 98 rules applied. Total rules applied 1765 place count 2046 transition count 3275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1769 place count 2044 transition count 3273
Free-agglomeration rule (complex) applied 175 times.
Iterating global reduction 2 with 175 rules applied. Total rules applied 1944 place count 2044 transition count 3196
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 2 with 175 rules applied. Total rules applied 2119 place count 1869 transition count 3196
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 2187 place count 1869 transition count 3196
Applied a total of 2187 rules in 884 ms. Remains 1869 /2952 variables (removed 1083) and now considering 3196/4255 (removed 1059) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 900 ms. Remains : 1869/2952 places, 3196/4255 transitions.
Interrupted random walk after 389624 steps, including 27953 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 379
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Running SMT prover for 645 properties.
[2023-03-13 17:53:03] [INFO ] Flow matrix only has 2911 transitions (discarded 285 similar events)
// Phase 1: matrix 2911 rows 1869 cols
[2023-03-13 17:53:03] [INFO ] Computed 397 place invariants in 126 ms
[2023-03-13 17:53:25] [INFO ] After 21772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:645
[2023-03-13 17:53:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 75 ms returned sat
[2023-03-13 17:53:42] [INFO ] [Nat]Absence check using 33 positive and 364 generalized place invariants in 78 ms returned sat
[2023-03-13 17:54:56] [INFO ] After 54309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :645
[2023-03-13 17:54:56] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-13 17:55:10] [INFO ] After 13780ms SMT Verify possible using 1090 Read/Feed constraints in natural domain returned unsat :590 sat :55
[2023-03-13 17:55:11] [INFO ] Deduced a trap composed of 394 places in 1269 ms of which 9 ms to minimize.
[2023-03-13 17:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1450 ms
[2023-03-13 17:55:13] [INFO ] Deduced a trap composed of 276 places in 1169 ms of which 2 ms to minimize.
[2023-03-13 17:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1359 ms
[2023-03-13 17:55:16] [INFO ] Deduced a trap composed of 263 places in 1167 ms of which 2 ms to minimize.
[2023-03-13 17:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1364 ms
[2023-03-13 17:55:20] [INFO ] Deduced a trap composed of 323 places in 1150 ms of which 3 ms to minimize.
[2023-03-13 17:55:22] [INFO ] Deduced a trap composed of 255 places in 1112 ms of which 2 ms to minimize.
[2023-03-13 17:55:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2842 ms
[2023-03-13 17:55:23] [INFO ] Deduced a trap composed of 265 places in 1126 ms of which 2 ms to minimize.
[2023-03-13 17:55:24] [INFO ] Deduced a trap composed of 463 places in 1051 ms of which 2 ms to minimize.
[2023-03-13 17:55:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2465 ms
[2023-03-13 17:55:28] [INFO ] Deduced a trap composed of 253 places in 1095 ms of which 2 ms to minimize.
[2023-03-13 17:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1268 ms
[2023-03-13 17:55:30] [INFO ] Deduced a trap composed of 459 places in 1007 ms of which 3 ms to minimize.
[2023-03-13 17:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1189 ms
[2023-03-13 17:55:31] [INFO ] Deduced a trap composed of 266 places in 1132 ms of which 2 ms to minimize.
[2023-03-13 17:55:33] [INFO ] Deduced a trap composed of 427 places in 1072 ms of which 2 ms to minimize.
[2023-03-13 17:55:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2479 ms
[2023-03-13 17:55:34] [INFO ] After 38228ms SMT Verify possible using trap constraints in natural domain returned unsat :590 sat :55
Attempting to minimize the solution found.
Minimization took 8058 ms.
[2023-03-13 17:55:42] [INFO ] After 137504ms SMT Verify possible using all constraints in natural domain returned unsat :590 sat :55
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 219389 ms.
ITS solved all properties within timeout

BK_STOP 1678730143671

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -timeout 180 -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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 MultiCrashLeafsetExtension-PT-S16C02, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r248-tall-167856435400468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C02.tgz
mv MultiCrashLeafsetExtension-PT-S16C02 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;