fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913700311
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.260 3600000.00 31289.00 152.10 FFFFTFFFFTTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700311.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Mar 25 20:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 25 20:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Mar 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 25 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 598K 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 BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591143230532

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:13:54] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2020-06-03 00:13:54] [INFO ] Transformed 68 places.
[2020-06-03 00:13:54] [INFO ] Transformed 548 transitions.
[2020-06-03 00:13:54] [INFO ] Parsed PT model containing 68 places and 548 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 97 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 56 resets, run finished after 315 ms. (steps per millisecond=31 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 220 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 85 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 00:13:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-03 00:13:56] [INFO ] Computed 7 place invariants in 6 ms
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-06-03 00:13:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:13:56] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat
[2020-06-03 00:13:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 31 ms returned sat
[2020-06-03 00:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:56] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-03 00:13:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2020-06-03 00:13:57] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-06-03 00:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2020-06-03 00:13:57] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 86 ms.
[2020-06-03 00:13:58] [INFO ] Added : 111 causal constraints over 24 iterations in 984 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-03 00:13:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-03 00:13:58] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-06-03 00:13:58] [INFO ] [Real]Absence check using 7 positive place invariants in 52 ms returned sat
[2020-06-03 00:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:58] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 00:13:58] [INFO ] [Real]Added 22 Read/Feed constraints in 24 ms returned sat
[2020-06-03 00:13:58] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 75 ms.
[2020-06-03 00:13:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 22 ms returned sat
[2020-06-03 00:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-03 00:13:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2020-06-03 00:13:58] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 23 ms.
[2020-06-03 00:13:59] [INFO ] Added : 109 causal constraints over 22 iterations in 1085 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 00:14:00] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:00] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2020-06-03 00:14:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2020-06-03 00:14:00] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 31 ms.
[2020-06-03 00:14:00] [INFO ] Added : 72 causal constraints over 16 iterations in 651 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 00:14:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:00] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 00:14:00] [INFO ] [Real]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-06-03 00:14:01] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 19 ms.
[2020-06-03 00:14:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 30 ms returned sat
[2020-06-03 00:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:01] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 00:14:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 33 ms returned sat
[2020-06-03 00:14:01] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 39 ms.
[2020-06-03 00:14:02] [INFO ] Added : 122 causal constraints over 27 iterations in 1358 ms. Result :sat
[2020-06-03 00:14:02] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2020-06-03 00:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-03 00:14:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:02] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 00:14:02] [INFO ] [Real]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-06-03 00:14:02] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 17 ms.
[2020-06-03 00:14:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:03] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-06-03 00:14:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 49 ms returned sat
[2020-06-03 00:14:03] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2020-06-03 00:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2020-06-03 00:14:03] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 16 ms.
[2020-06-03 00:14:04] [INFO ] Added : 107 causal constraints over 22 iterations in 853 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8300 steps, including 354 resets, run finished after 36 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 49900 steps, including 1079 resets, run finished after 143 ms. (steps per millisecond=348 ) properties seen :[0, 1, 0, 1, 0] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7600 steps, including 382 resets, run finished after 16 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12800 steps, including 503 resets, run finished after 28 ms. (steps per millisecond=457 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 48600 steps, including 1031 resets, run finished after 133 ms. (steps per millisecond=365 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 66 transition count 548
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 61 transition count 544
Applied a total of 11 rules in 70 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/68 places, 544/548 transitions.
Incomplete random walk after 1000000 steps, including 7905 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties seen :[0, 0]
Finished Best-First random walk after 3530 steps, including 13 resets, run visited all 2 properties in 5 ms. (steps per millisecond=706 )
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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="BridgeAndVehicles-PT-V20P10N10"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V20P10N10, 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 r182-oct2-158987913700311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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