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-167813696000591.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 BusinessProcesses-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K 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 BusinessProcesses-PT-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678734921027

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:15:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:15:22] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-13 19:15:22] [INFO ] Transformed 717 places.
[2023-03-13 19:15:22] [INFO ] Transformed 642 transitions.
[2023-03-13 19:15:22] [INFO ] Found NUPN structural information;
[2023-03-13 19:15:22] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 627 rows 702 cols
[2023-03-13 19:15:23] [INFO ] Computed 114 place invariants in 26 ms
[2023-03-13 19:15:24] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 19:15:24] [INFO ] [Nat]Absence check using 73 positive place invariants in 28 ms returned sat
[2023-03-13 19:15:24] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-13 19:15:26] [INFO ] After 1197ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-13 19:15:26] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 7 ms to minimize.
[2023-03-13 19:15:26] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:15:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 371 ms
[2023-03-13 19:15:26] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:15:27] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:15:27] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:15:27] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:15:27] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2023-03-13 19:15:27] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2023-03-13 19:15:28] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:15:28] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2023-03-13 19:15:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1629 ms
[2023-03-13 19:15:28] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2023-03-13 19:15:28] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:15:29] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:15:29] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2023-03-13 19:15:29] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:15:29] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:15:30] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:15:30] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:15:30] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:15:31] [INFO ] Deduced a trap composed of 53 places in 1219 ms of which 1 ms to minimize.
[2023-03-13 19:15:31] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2023-03-13 19:15:31] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:15:32] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2023-03-13 19:15:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3629 ms
[2023-03-13 19:15:32] [INFO ] After 7380ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-13 19:15:32] [INFO ] After 8189ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 23 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 693 transition count 521
Reduce places removed 105 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 110 rules applied. Total rules applied 216 place count 588 transition count 516
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 221 place count 583 transition count 516
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 221 place count 583 transition count 371
Deduced a syphon composed of 145 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 313 rules applied. Total rules applied 534 place count 415 transition count 371
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 622 place count 327 transition count 283
Iterating global reduction 3 with 88 rules applied. Total rules applied 710 place count 327 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 712 place count 327 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 713 place count 326 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 713 place count 326 transition count 272
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 734 place count 314 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 735 place count 313 transition count 271
Iterating global reduction 5 with 1 rules applied. Total rules applied 736 place count 313 transition count 271
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 5 with 208 rules applied. Total rules applied 944 place count 209 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 946 place count 208 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 947 place count 207 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 948 place count 206 transition count 169
Applied a total of 948 rules in 212 ms. Remains 206 /702 variables (removed 496) and now considering 169/627 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 206/702 places, 169/627 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 169 rows 206 cols
[2023-03-13 19:15:33] [INFO ] Computed 79 place invariants in 9 ms
[2023-03-13 19:15:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:15:33] [INFO ] [Nat]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-13 19:15:33] [INFO ] [Nat]Absence check using 64 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-13 19:15:33] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:15:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 19:15:33] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:15:33] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-13 19:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-13 19:15:33] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:15:33] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 113 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=37 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 10950 ms.
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_18
(NrP: 717 NrTr: 642 NrArc: 1860)

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

net check time: 0m 0.000sec

init dd package: 0m 3.145sec


before gc: list nodes free: 84169

after gc: idd nodes used:35400431, unused:28599569; list nodes free:119237855

RS generation: 38m48.372sec


-> last computed set: #nodes 35399784 (3.5e+07) #states 107,934,411,767,414,285 (17)


CANNOT_COMPUTE


BK_STOP 1678737316838

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p69
p279
p275
p282
p284
p361
p278
p280
p331
p276
p366
p283
p351
p274
p70

The net has transition(s) that can never fire:
t513
t514
t515
t466
t467
t282
t286
t294
t309
t316
t317
t319
t320
t322
t323

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

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="BusinessProcesses-PT-18"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-18, examination is ReachabilityFireability"
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-167813696000591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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