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

About the Execution of Marcie+red for PolyORBLF-PT-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8346.764 3600000.00 3639821.00 9571.20 TTTTTTFFTTFTTTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951800511.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 PolyORBLF-PT-S02J04T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951800511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 19K Feb 26 13:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 13:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Feb 26 14:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 26 14:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 329K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 906K 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 PolyORBLF-PT-S02J04T10-ReachabilityFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679571969890

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=PolyORBLF-PT-S02J04T10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 11:46:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 11:46:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:46:11] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-23 11:46:11] [INFO ] Transformed 752 places.
[2023-03-23 11:46:11] [INFO ] Transformed 1572 transitions.
[2023-03-23 11:46:11] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 11:46:11] [INFO ] Reduced 40 identical enabling conditions.
[2023-03-23 11:46:11] [INFO ] Reduced 40 identical enabling conditions.
[2023-03-23 11:46:11] [INFO ] Reduced 110 identical enabling conditions.
[2023-03-23 11:46:11] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 16) seen :7
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 11:46:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2023-03-23 11:46:15] [INFO ] Computed 54 place invariants in 81 ms
[2023-03-23 11:46:18] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 11:46:18] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned sat
[2023-03-23 11:46:18] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-23 11:46:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 11:46:18] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 29 ms returned sat
[2023-03-23 11:46:30] [INFO ] After 11104ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2023-03-23 11:46:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 11:46:35] [INFO ] After 4911ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :8 sat :1
[2023-03-23 11:46:36] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 12 ms to minimize.
[2023-03-23 11:46:36] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2023-03-23 11:46:36] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 1 ms to minimize.
[2023-03-23 11:46:37] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2023-03-23 11:46:37] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 0 ms to minimize.
[2023-03-23 11:46:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1148 ms
[2023-03-23 11:46:37] [INFO ] After 6714ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 821 ms.
[2023-03-23 11:46:38] [INFO ] After 19849ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 11 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 482 place count 510 transition count 1172
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 502 place count 510 transition count 1152
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 522 place count 490 transition count 1152
Applied a total of 522 rules in 226 ms. Remains 490 /752 variables (removed 262) and now considering 1152/1412 (removed 260) transitions.
[2023-03-23 11:46:38] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 490 cols
[2023-03-23 11:46:38] [INFO ] Computed 52 place invariants in 36 ms
[2023-03-23 11:46:39] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 490/752 places, 1042/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 489 transition count 1022
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 469 transition count 1002
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 21 rules in 35 ms. Remains 469 /490 variables (removed 21) and now considering 1002/1042 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1123 ms. Remains : 469/752 places, 1002/1412 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 27862 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: PolyORBLF_PT_S02J04T10
(NrP: 752 NrTr: 1572 NrArc: 7262)

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

net check time: 0m 0.001sec

init dd package: 0m 2.718sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7801628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101632 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.028sec

30702 68002 115050 137082 152792 165740 204319 285283 339160 369242 375187 448861 606746 640950 678051 717798 834611 972587 1007318 1037009 1037210 1308239 1367862 1390345 1465965 1477955 1661433 1700787 1730611 1571850 1827884 1882147 1918344 1997336 1753842 1920389 1955235 1971442 1634477 1709917 1657291 1630091 1407381

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="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r298-tall-167873951800511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 ;