fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900400558
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.400 3600000.00 79188.00 220.10 TFFTTFFFTFFTFFFF 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/mcc2020-input.r180-ebro-158987900400558.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 3.0K Mar 30 19:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 19:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 24 05:37 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 DLCround-PT-09b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591249127872

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 05:38:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 05:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 05:38:52] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2020-06-04 05:38:52] [INFO ] Transformed 3495 places.
[2020-06-04 05:38:52] [INFO ] Transformed 5439 transitions.
[2020-06-04 05:38:52] [INFO ] Found NUPN structural information;
[2020-06-04 05:38:52] [INFO ] Parsed PT model containing 3495 places and 5439 transitions in 793 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 423 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-09b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 242 ms. (steps per millisecond=41 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 1, 0]
FORMULA DLCround-PT-09b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 5439 rows 3495 cols
[2020-06-04 05:38:53] [INFO ] Computed 184 place invariants in 180 ms
[2020-06-04 05:38:55] [INFO ] [Real]Absence check using 184 positive place invariants in 822 ms returned sat
[2020-06-04 05:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:38:58] [INFO ] [Real]Absence check using state equation in 3281 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 05:39:00] [INFO ] [Real]Absence check using 184 positive place invariants in 953 ms returned sat
[2020-06-04 05:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:03] [INFO ] [Real]Absence check using state equation in 3302 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 05:39:05] [INFO ] [Real]Absence check using 184 positive place invariants in 966 ms returned sat
[2020-06-04 05:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:39:08] [INFO ] [Real]Absence check using state equation in 3301 ms returned (error "Failed to check-sat")
[2020-06-04 05:39:10] [INFO ] [Real]Absence check using 184 positive place invariants in 857 ms returned sat
[2020-06-04 05:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:39:13] [INFO ] [Real]Absence check using state equation in 3524 ms returned (error "Failed to check-sat")
[2020-06-04 05:39:15] [INFO ] [Real]Absence check using 184 positive place invariants in 803 ms returned sat
[2020-06-04 05:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:39:18] [INFO ] [Real]Absence check using state equation in 3475 ms returned (error "Failed to check-sat")
Support contains 25 out of 3495 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3194 edges and 3495 vertex of which 566 / 3495 are part of one of the 45 SCC in 45 ms
Free SCC test removed 521 places
Drop transitions removed 585 transitions
Reduce isomorphic transitions removed 585 transitions.
Performed 1275 Post agglomeration using F-continuation condition.Transition count delta: 1275
Iterating post reduction 0 with 1860 rules applied. Total rules applied 1861 place count 2974 transition count 3579
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 1349 rules applied. Total rules applied 3210 place count 1699 transition count 3505
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 40 rules applied. Total rules applied 3250 place count 1667 transition count 3497
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3254 place count 1663 transition count 3497
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 3254 place count 1663 transition count 3479
Deduced a syphon composed of 18 places in 60 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3290 place count 1645 transition count 3479
Symmetric choice reduction at 4 with 445 rule applications. Total rules 3735 place count 1645 transition count 3479
Deduced a syphon composed of 445 places in 82 ms
Reduce places removed 445 places and 445 transitions.
Iterating global reduction 4 with 890 rules applied. Total rules applied 4625 place count 1200 transition count 3034
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 188 Pre rules applied. Total rules applied 4625 place count 1200 transition count 2846
Deduced a syphon composed of 188 places in 40 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 4 with 376 rules applied. Total rules applied 5001 place count 1012 transition count 2846
Symmetric choice reduction at 4 with 67 rule applications. Total rules 5068 place count 1012 transition count 2846
Deduced a syphon composed of 67 places in 36 ms
Reduce places removed 67 places and 853 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 5202 place count 945 transition count 1993
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 5222 place count 945 transition count 1973
Performed 252 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 5 with 504 rules applied. Total rules applied 5726 place count 693 transition count 1712
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 5733 place count 693 transition count 1705
Symmetric choice reduction at 6 with 2 rule applications. Total rules 5735 place count 693 transition count 1705
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 26 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5739 place count 691 transition count 1679
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -561
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 5851 place count 635 transition count 2240
Drop transitions removed 53 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 6 with 57 rules applied. Total rules applied 5908 place count 635 transition count 2183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 5912 place count 633 transition count 2217
Free-agglomeration rule applied 341 times with reduction of 171 identical transitions.
Iterating global reduction 7 with 341 rules applied. Total rules applied 6253 place count 633 transition count 1705
Reduce places removed 341 places and 0 transitions.
Drop transitions removed 723 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 743 transitions.
Discarding 21 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Graph (complete) has 818 edges and 292 vertex of which 271 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.10 ms
Iterating post reduction 7 with 1085 rules applied. Total rules applied 7338 place count 271 transition count 917
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 7377 place count 271 transition count 878
Symmetric choice reduction at 9 with 3 rule applications. Total rules 7380 place count 271 transition count 878
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 36 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 7386 place count 268 transition count 842
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 7398 place count 268 transition count 830
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 7399 place count 268 transition count 829
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 7413 place count 267 transition count 816
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 7415 place count 267 transition count 816
Drop transitions removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 11 with 86 rules applied. Total rules applied 7501 place count 267 transition count 730
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 7505 place count 263 transition count 730
Symmetric choice reduction at 12 with 7 rule applications. Total rules 7512 place count 263 transition count 730
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 96 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 7526 place count 256 transition count 634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 7532 place count 256 transition count 628
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 7535 place count 256 transition count 625
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 37 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 39 transitions.
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 675 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Iterating post reduction 13 with 43 rules applied. Total rules applied 7578 place count 246 transition count 586
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 7581 place count 246 transition count 583
Applied a total of 7581 rules in 2116 ms. Remains 246 /3495 variables (removed 3249) and now considering 583/5439 (removed 4856) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/3495 places, 583/5439 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7628 ms. (steps per millisecond=131 ) properties seen :[0, 0, 1, 1, 1]
FORMULA DLCround-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4353 ms. (steps per millisecond=229 ) properties seen :[1, 0]
FORMULA DLCround-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3455 ms. (steps per millisecond=289 ) properties seen :[0]
[2020-06-04 05:39:36] [INFO ] Flow matrix only has 207 transitions (discarded 376 similar events)
// Phase 1: matrix 207 rows 246 cols
[2020-06-04 05:39:36] [INFO ] Computed 158 place invariants in 3 ms
[2020-06-04 05:39:36] [INFO ] [Real]Absence check using 158 positive place invariants in 109 ms returned sat
[2020-06-04 05:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:36] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2020-06-04 05:39:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:39:37] [INFO ] [Nat]Absence check using 158 positive place invariants in 80 ms returned sat
[2020-06-04 05:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:39:37] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2020-06-04 05:39:37] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-06-04 05:39:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 71 ms returned sat
[2020-06-04 05:39:37] [INFO ] Computed and/alt/rep : 578/7503/202 causal constraints in 85 ms.
[2020-06-04 05:39:40] [INFO ] Added : 163 causal constraints over 34 iterations in 2867 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA DLCround-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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="DLCround-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is DLCround-PT-09b, 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 r180-ebro-158987900400558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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