Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654351300278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Murphy-COL-D4N025, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351300278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 22:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 22:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 22:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 22:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20K May 18 16:43 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 Murphy-COL-D4N025-ReachabilityCardinality-2024-00
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-01
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-02
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-03
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-04
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-05
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-06
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-07
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-08
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-09
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-10
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-11
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-12
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-13
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-14
FORMULA_NAME Murphy-COL-D4N025-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717235753189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N025
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:55:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 09:55:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 09:55:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 501 ms
[2024-06-01 09:55:54] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 09:55:55] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2024-06-01 09:55:55] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 10 formulas.
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 21245 steps (3 resets) in 56 ms. (372 steps per ms) remains 0/6 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 09:55:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 09:55:55] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Arc [0:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2024-06-01 09:55:55] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 11 ms.
[2024-06-01 09:55:55] [INFO ] Unfolded 6 HLPN properties in 0 ms.
RANDOM walk for 40012 steps (8 resets) in 394 ms. (101 steps per ms) remains 1/6 properties
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
// Phase 1: matrix 35 rows 30 cols
[2024-06-01 09:55:55] [INFO ] Computed 6 invariants in 12 ms
[2024-06-01 09:55:55] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/35 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 15/50 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/65 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/35 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/50 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:55:55] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/65 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 48 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 15 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 19 ms. Remains 15 /30 variables (removed 15) and now considering 20/35 (removed 15) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-06-01 09:55:55] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:55:55] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 163 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 165 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 15/30 places, 20/35 transitions.
RANDOM walk for 40000 steps (8 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 93 ms. (steps per millisecond=641 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 46 ms. (steps per millisecond=1296 ) properties seen :0
FORMULA Murphy-COL-D4N025-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 2137 ms.
ITS solved all properties within timeout

BK_STOP 1717235756599

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="Murphy-COL-D4N025"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Murphy-COL-D4N025, 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 r508-tall-171654351300278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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