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

About the Execution of Marcie+red for BugTracking-PT-q8m256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5562.224 3600000.00 3653662.00 772.80 ?TFTFTTTF???TFTT normal

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-167813695800446.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 BugTracking-PT-q8m256, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 06:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 06:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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 16M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678725433592

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:37:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:37:16] [INFO ] Load time of PNML (sax parser for PT used): 889 ms
[2023-03-13 16:37:16] [INFO ] Transformed 754 places.
[2023-03-13 16:37:16] [INFO ] Transformed 27370 transitions.
[2023-03-13 16:37:16] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1101 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 176 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10066 steps, including 4 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 8) seen :2
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 16:37:17] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 16:37:17] [INFO ] Computed 10 place invariants in 63 ms
[2023-03-13 16:37:18] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 16:37:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 16:37:19] [INFO ] After 1224ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-13 16:37:19] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:37:20] [INFO ] After 680ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-13 16:37:21] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 25 ms to minimize.
[2023-03-13 16:37:22] [INFO ] Deduced a trap composed of 24 places in 452 ms of which 1 ms to minimize.
[2023-03-13 16:37:22] [INFO ] Deduced a trap composed of 21 places in 658 ms of which 26 ms to minimize.
[2023-03-13 16:37:23] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 1 ms to minimize.
[2023-03-13 16:37:23] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 1 ms to minimize.
[2023-03-13 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2866 ms
[2023-03-13 16:37:24] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 0 ms to minimize.
[2023-03-13 16:37:24] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 1 ms to minimize.
[2023-03-13 16:37:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2023-03-13 16:37:25] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 1 ms to minimize.
[2023-03-13 16:37:25] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2023-03-13 16:37:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 752 ms
[2023-03-13 16:37:25] [INFO ] After 5680ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 439 ms.
[2023-03-13 16:37:25] [INFO ] After 7590ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m256-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 539 ms.
Support contains 9 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 301 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 269/280 places, 3871/3904 transitions.
Incomplete random walk after 10089 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=531 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 97622 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97622 steps, saw 42284 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:37:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:37:30] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-13 16:37:30] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:37:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:37:31] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:37:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:37:32] [INFO ] After 861ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:37:33] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 1 ms to minimize.
[2023-03-13 16:37:33] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 0 ms to minimize.
[2023-03-13 16:37:33] [INFO ] Deduced a trap composed of 37 places in 357 ms of which 1 ms to minimize.
[2023-03-13 16:37:34] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 0 ms to minimize.
[2023-03-13 16:37:34] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 0 ms to minimize.
[2023-03-13 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1934 ms
[2023-03-13 16:37:34] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2023-03-13 16:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-13 16:37:35] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 0 ms to minimize.
[2023-03-13 16:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-13 16:37:35] [INFO ] After 4044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 460 ms.
[2023-03-13 16:37:35] [INFO ] After 5577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 9 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 93 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:37:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:37:36] [INFO ] Invariant cache hit.
[2023-03-13 16:37:37] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-13 16:37:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:37:37] [INFO ] Invariant cache hit.
[2023-03-13 16:37:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:37:39] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
[2023-03-13 16:37:39] [INFO ] Redundant transitions in 256 ms returned []
[2023-03-13 16:37:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:37:39] [INFO ] Invariant cache hit.
[2023-03-13 16:37:40] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4532 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 282 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-13 16:37:40] [INFO ] Computed 9 place invariants in 15 ms
[2023-03-13 16:37:41] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:37:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 16:37:42] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:37:43] [INFO ] After 1913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-13 16:37:43] [INFO ] After 2496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:37:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-13 16:37:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 58 ms.
[2023-03-13 16:37:44] [INFO ] Flatten gal took : 574 ms
Total runtime 29355 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q8
(NrP: 269 NrTr: 3871 NrArc: 19045)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.088sec

net check time: 0m 0.003sec

init dd package: 0m 3.034sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10564912 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16079512 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.052sec

6285 14012 20445 27783 33446 38092 43141 46913 50880 52766 55472 58396 61796 62048 65414 69185 74044 78079 76600 105363 130116 137074 150265 150791 166302 162768 163265 164213 161653 159180

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="BugTracking-PT-q8m256"
export BK_EXAMINATION="ReachabilityCardinality"
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 BugTracking-PT-q8m256, examination is ReachabilityCardinality"
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-167813695800446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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