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

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7788.815 3600000.00 14094869.00 761.60 FTFFFTTTFTTTTFTT 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.r233-tall-167856419400806.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 ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400806
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 15K Feb 26 02:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 02:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 03:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 03:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 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 7.6M 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 MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679620269464

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 01:11:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 01:11:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:11:11] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2023-03-24 01:11:11] [INFO ] Transformed 7032 places.
[2023-03-24 01:11:11] [INFO ] Transformed 10855 transitions.
[2023-03-24 01:11:11] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 470 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 16690 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{2=1}
Probabilistic random walk after 16690 steps, saw 7889 distinct states, run finished after 3002 ms. (steps per millisecond=5 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 15 properties.
[2023-03-24 01:11:15] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2023-03-24 01:11:16] [INFO ] Computed 813 place invariants in 615 ms
[2023-03-24 01:11:18] [INFO ] After 2325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-24 01:11:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 47 ms returned sat
[2023-03-24 01:11:21] [INFO ] [Nat]Absence check using 58 positive and 755 generalized place invariants in 413 ms returned sat
[2023-03-24 01:11:34] [INFO ] After 12764ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :5
[2023-03-24 01:11:34] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:11:37] [INFO ] After 2839ms SMT Verify possible using 3202 Read/Feed constraints in natural domain returned unsat :13 sat :2
[2023-03-24 01:11:38] [INFO ] After 4078ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :2
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-24 01:11:39] [INFO ] After 20755ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :2
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.28 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1199 place count 7000 transition count 9657
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 5802 transition count 9656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2399 place count 5801 transition count 9656
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 2399 place count 5801 transition count 9556
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 2599 place count 5701 transition count 9556
Discarding 1098 places :
Symmetric choice reduction at 3 with 1098 rule applications. Total rules 3697 place count 4603 transition count 8458
Iterating global reduction 3 with 1098 rules applied. Total rules applied 4795 place count 4603 transition count 8458
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4795 place count 4603 transition count 8455
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4801 place count 4600 transition count 8455
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 5349 place count 4052 transition count 7359
Iterating global reduction 3 with 548 rules applied. Total rules applied 5897 place count 4052 transition count 7359
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 5947 place count 4027 transition count 7334
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 6285 place count 4027 transition count 7544
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 6623 place count 3689 transition count 7544
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 6648 place count 3689 transition count 7544
Applied a total of 6648 rules in 4084 ms. Remains 3689 /7032 variables (removed 3343) and now considering 7544/10855 (removed 3311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4086 ms. Remains : 3689/7032 places, 7544/10855 transitions.
Incomplete random walk after 10000 steps, including 764 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished probabilistic random walk after 14702 steps, run visited all 2 properties in 1584 ms. (steps per millisecond=9 )
Probabilistic random walk after 14702 steps, saw 6638 distinct states, run finished after 1584 ms. (steps per millisecond=9 ) properties seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 34630 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/466/inv_0_ --invariant=/tmp/466/inv_1_ --invariant=/tmp/466/inv_2_ --invariant=/tmp/466/inv_3_ --invariant=/tmp/466/inv_4_ --invariant=/tmp/466/inv_5_ --invariant=/tmp/466/inv_6_ --invariant=/tmp/466/inv_7_ --invariant=/tmp/466/inv_8_ --invariant=/tmp/466/inv_9_ --invariant=/tmp/466/inv_10_ --invariant=/tmp/466/inv_11_ --invariant=/tmp/466/inv_12_ --invariant=/tmp/466/inv_13_ --invariant=/tmp/466/inv_14_ --invariant=/tmp/466/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8352980 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="MultiCrashLeafsetExtension-PT-S24C02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, 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 r233-tall-167856419400806"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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