About the Execution of Marcie+red for BugTracking-PT-q3m064
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5785.384 | 3600000.00 | 3639928.00 | 731.30 | F?TFFTFT?TFFFFTF | 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-167813695700367.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-q3m064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700367
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 06:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 07:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 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-q3m064-ReachabilityFireability-00
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-01
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-02
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-03
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-04
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-05
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-06
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-07
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-08
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-09
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-10
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-11
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-12
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-13
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-14
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678716215935
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=BugTracking-PT-q3m064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 14:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:03:38] [INFO ] Load time of PNML (sax parser for PT used): 604 ms
[2023-03-13 14:03:38] [INFO ] Transformed 754 places.
[2023-03-13 14:03:38] [INFO ] Transformed 27370 transitions.
[2023-03-13 14:03:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 751 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 105 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10031 steps, including 5 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 156495 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156495 steps, saw 77780 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 14:03:41] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-13 14:03:41] [INFO ] Computed 10 place invariants in 47 ms
[2023-03-13 14:03:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 14:03:42] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:03:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 14:03:43] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:43] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-13 14:03:43] [INFO ] After 354ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:44] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 8 ms to minimize.
[2023-03-13 14:03:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-13 14:03:44] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-13 14:03:44] [INFO ] After 1919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 278 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 229/240 places, 2747/2769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 196994 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196994 steps, saw 95318 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 14:03:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-13 14:03:48] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-13 14:03:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 14:03:48] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:03:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 14:03:49] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:03:49] [INFO ] After 241ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:49] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-13 14:03:49] [INFO ] After 1141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 64 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-13 14:03:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 14:03:49] [INFO ] Invariant cache hit.
[2023-03-13 14:03:50] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-13 14:03:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 14:03:50] [INFO ] Invariant cache hit.
[2023-03-13 14:03:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:03:51] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2023-03-13 14:03:51] [INFO ] Redundant transitions in 242 ms returned []
[2023-03-13 14:03:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 14:03:51] [INFO ] Invariant cache hit.
[2023-03-13 14:03:52] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3037 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
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 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 273 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-13 14:03:53] [INFO ] Computed 9 place invariants in 29 ms
[2023-03-13 14:03:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 14:03:53] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:03:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 14:03:54] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:54] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-13 14:03:54] [INFO ] After 1022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 14:03:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 14:03:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 26 ms.
[2023-03-13 14:03:55] [INFO ] Flatten gal took : 286 ms
Total runtime 17835 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=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: BugTracking_PT_q3
(NrP: 229 NrTr: 2747 NrArc: 13485)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.054sec
net check time: 0m 0.002sec
init dd package: 0m 3.110sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 10342956 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16084724 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 ReachabilityFireability -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.041sec
7017 13665 18461 23073 28823 37190 43452 49698 57446 65407 73251 76676 81198 87402 90690 94710 98154 114517 124803 131397 126295 125405 131101 147760 153946 160160 170957 181860 191807 190310 192371 198575 198332 200105 200981 228044 242075 248669 233723 227460 233072 258077 264263
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-q3m064"
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 BugTracking-PT-q3m064, 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-167813695700367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m064.tgz
mv BugTracking-PT-q3m064 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 '
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 ;