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.r298-tall-167873952300838.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 QuasiCertifProtocol-COL-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300838
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:23 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 QuasiCertifProtocol-COL-22-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679684089028

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=QuasiCertifProtocol-COL-22
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 18:54:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 18:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 18:54:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 18:54:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 18:54:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2023-03-24 18:54:51] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 18:54:51] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 18:54:51] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
[2023-03-24 18:54:51] [INFO ] Flatten gal took : 17 ms
[2023-03-24 18:54:51] [INFO ] Flatten gal took : 5 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-24 18:54:51] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 30 ms.
[2023-03-24 18:54:51] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 304645 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{0=1, 4=1, 8=1, 10=1, 11=1}
Probabilistic random walk after 304645 steps, saw 52438 distinct states, run finished after 3009 ms. (steps per millisecond=101 ) properties seen :5
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 356 rows 1966 cols
[2023-03-24 18:54:55] [INFO ] Computed 1611 place invariants in 89 ms
[2023-03-24 18:54:57] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-24 18:54:57] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 351 ms returned sat
[2023-03-24 18:54:57] [INFO ] After 1214ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-24 18:54:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-24 18:54:58] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 303 ms returned sat
[2023-03-24 18:55:08] [INFO ] After 11106ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1363 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1963 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1963 transition count 354
Applied a total of 3 rules in 116 ms. Remains 1963 /1966 variables (removed 3) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1963/1966 places, 354/356 transitions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651264 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651264 steps, saw 95678 distinct states, run finished after 3002 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 1963 cols
[2023-03-24 18:55:12] [INFO ] Computed 1610 place invariants in 42 ms
[2023-03-24 18:55:12] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:55:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-24 18:55:13] [INFO ] [Nat]Absence check using 1 positive and 1609 generalized place invariants in 262 ms returned sat
[2023-03-24 18:55:22] [INFO ] After 9734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1363 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 354/354 transitions.
Applied a total of 0 rules in 34 ms. Remains 1963 /1963 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1963/1963 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 354/354 transitions.
Applied a total of 0 rules in 43 ms. Remains 1963 /1963 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-24 18:55:22] [INFO ] Invariant cache hit.
[2023-03-24 18:55:23] [INFO ] Implicit Places using invariants in 1013 ms returned [1936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1962/1963 places, 354/354 transitions.
Applied a total of 0 rules in 39 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1100 ms. Remains : 1962/1963 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662775 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662775 steps, saw 97226 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 1962 cols
[2023-03-24 18:55:27] [INFO ] Computed 1609 place invariants in 25 ms
[2023-03-24 18:55:27] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:55:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-24 18:55:27] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 276 ms returned sat
[2023-03-24 18:55:36] [INFO ] After 9634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1363 out of 1962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 30 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1962/1962 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 21 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-24 18:55:36] [INFO ] Invariant cache hit.
[2023-03-24 18:55:37] [INFO ] Implicit Places using invariants in 942 ms returned []
[2023-03-24 18:55:37] [INFO ] Invariant cache hit.
[2023-03-24 18:55:40] [INFO ] Implicit Places using invariants and state equation in 2258 ms returned []
Implicit Place search using SMT with State Equation took 3215 ms to find 0 implicit places.
[2023-03-24 18:55:40] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 18:55:40] [INFO ] Invariant cache hit.
[2023-03-24 18:55:40] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3931 ms. Remains : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 21 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-24 18:55:40] [INFO ] Invariant cache hit.
[2023-03-24 18:55:41] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:55:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-24 18:55:41] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 295 ms returned sat
[2023-03-24 18:55:50] [INFO ] After 9596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-24 18:55:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-24 18:55:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1962 places, 354 transitions and 4290 arcs took 5 ms.
[2023-03-24 18:55:51] [INFO ] Flatten gal took : 185 ms
Total runtime 60576 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: Document_unf
(NrP: 1962 NrTr: 354 NrArc: 4290)

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

net check time: 0m 0.000sec

init dd package: 0m 2.706sec


before gc: list nodes free: 430008

after gc: idd nodes used:38702837, unused:25297163; list nodes free:121546974

RS generation: 7m 3.361sec


-> last computed set: #nodes 38700898 (3.9e+07) #states 8,388,609 (6)


CANNOT_COMPUTE


BK_STOP 1679684612379

--------------------
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.001sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-COL-22"
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 QuasiCertifProtocol-COL-22, 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 r298-tall-167873952300838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;