About the Execution of ITS-Tools for AutonomousCar-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
258.096 | 40639.00 | 68874.00 | 141.30 | FFTTFTTFFTTFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873000503.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is AutonomousCar-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873000503
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 4.9K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 228K Jun 3 16:02 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 AutonomousCar-PT-06b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654902125495
Running Version 202205111006
[2022-06-10 23:02:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 23:02:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 23:02:08] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2022-06-10 23:02:08] [INFO ] Transformed 289 places.
[2022-06-10 23:02:08] [INFO ] Transformed 644 transitions.
[2022-06-10 23:02:08] [INFO ] Found NUPN structural information;
[2022-06-10 23:02:08] [INFO ] Parsed PT model containing 289 places and 644 transitions in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 102 resets, run finished after 829 ms. (steps per millisecond=12 ) properties (out of 16) seen :12
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 644 rows 289 cols
[2022-06-10 23:02:09] [INFO ] Computed 11 place invariants in 45 ms
[2022-06-10 23:02:10] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 23:02:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-06-10 23:02:11] [INFO ] After 821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 23:02:12] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 12 ms to minimize.
[2022-06-10 23:02:12] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 2 ms to minimize.
[2022-06-10 23:02:12] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2022-06-10 23:02:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 936 ms
[2022-06-10 23:02:13] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 2 ms to minimize.
[2022-06-10 23:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2022-06-10 23:02:13] [INFO ] After 2478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 365 ms.
[2022-06-10 23:02:13] [INFO ] After 3069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2448 ms.
Support contains 25 out of 289 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 243 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 23 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 958 edges and 287 vertex of which 280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 280 transition count 518
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 144 rules applied. Total rules applied 263 place count 165 transition count 489
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 282 place count 150 transition count 485
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 288 place count 146 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 145 transition count 483
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 289 place count 145 transition count 474
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 307 place count 136 transition count 474
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 330 place count 113 transition count 451
Iterating global reduction 5 with 23 rules applied. Total rules applied 353 place count 113 transition count 451
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 497 place count 113 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 497 place count 113 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 499 place count 112 transition count 306
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 501 place count 110 transition count 294
Iterating global reduction 6 with 2 rules applied. Total rules applied 503 place count 110 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 507 place count 110 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 509 place count 108 transition count 290
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 565 place count 80 transition count 262
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 567 place count 78 transition count 248
Iterating global reduction 8 with 2 rules applied. Total rules applied 569 place count 78 transition count 248
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 570 place count 78 transition count 247
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 581 place count 78 transition count 236
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 592 place count 67 transition count 236
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 593 place count 67 transition count 236
Applied a total of 593 rules in 326 ms. Remains 67 /289 variables (removed 222) and now considering 236/644 (removed 408) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/289 places, 236/644 transitions.
Incomplete random walk after 1000000 steps, including 40871 resets, run finished after 14544 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5415 resets, run finished after 3716 ms. (steps per millisecond=269 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5436 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 236 rows 67 cols
[2022-06-10 23:02:36] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 23:02:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 23:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 23:02:36] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 23:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:02:36] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 23:02:36] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2022-06-10 23:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-06-10 23:02:36] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-10 23:02:36] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 24 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 230
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 229
Applied a total of 3 rules in 38 ms. Remains 66 /67 variables (removed 1) and now considering 229/236 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/67 places, 229/236 transitions.
Incomplete random walk after 1000000 steps, including 36773 resets, run finished after 3895 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5475 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1582382 steps, run visited all 1 properties in 3098 ms. (steps per millisecond=510 )
Probabilistic random walk after 1582382 steps, saw 243499 distinct states, run finished after 3099 ms. (steps per millisecond=510 ) properties seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 38123 ms.
BK_STOP 1654902166134
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="AutonomousCar-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06b, 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 r294-smll-165463873000503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b 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 '
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 ;