fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900400559
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
15738.410 3600000.00 88515.00 144.90 TFFTFTTTTFTTFTTT 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-158987900400559.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400559
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591249203008

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 05:40:06] [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-04 05:40:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 05:40:06] [INFO ] Load time of PNML (sax parser for PT used): 465 ms
[2020-06-04 05:40:06] [INFO ] Transformed 3495 places.
[2020-06-04 05:40:06] [INFO ] Transformed 5439 transitions.
[2020-06-04 05:40:06] [INFO ] Found NUPN structural information;
[2020-06-04 05:40:06] [INFO ] Parsed PT model containing 3495 places and 5439 transitions in 685 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 367 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 200 ms. (steps per millisecond=50 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1]
FORMULA DLCround-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5439 rows 3495 cols
[2020-06-04 05:40:08] [INFO ] Computed 184 place invariants in 195 ms
[2020-06-04 05:40:09] [INFO ] [Real]Absence check using 184 positive place invariants in 829 ms returned sat
[2020-06-04 05:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:13] [INFO ] [Real]Absence check using state equation in 3212 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:14] [INFO ] [Real]Absence check using 184 positive place invariants in 853 ms returned sat
[2020-06-04 05:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:18] [INFO ] [Real]Absence check using state equation in 3467 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:19] [INFO ] [Real]Absence check using 184 positive place invariants in 862 ms returned sat
[2020-06-04 05:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:23] [INFO ] [Real]Absence check using state equation in 3491 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:25] [INFO ] [Real]Absence check using 184 positive place invariants in 1310 ms returned sat
[2020-06-04 05:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:28] [INFO ] [Real]Absence check using state equation in 2542 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:29] [INFO ] [Real]Absence check using 184 positive place invariants in 991 ms returned sat
[2020-06-04 05:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:33] [INFO ] [Real]Absence check using state equation in 3375 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 05:40:34] [INFO ] [Real]Absence check using 184 positive place invariants in 910 ms returned sat
[2020-06-04 05:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:38] [INFO ] [Real]Absence check using state equation in 3403 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:39] [INFO ] [Real]Absence check using 184 positive place invariants in 824 ms returned sat
[2020-06-04 05:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s280 (- t3122 t3123))") while checking expression at index 6
[2020-06-04 05:40:44] [INFO ] [Real]Absence check using 184 positive place invariants in 907 ms returned sat
[2020-06-04 05:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:48] [INFO ] [Real]Absence check using state equation in 3457 ms returned (error "Failed to check-sat")
[2020-06-04 05:40:49] [INFO ] [Real]Absence check using 184 positive place invariants in 849 ms returned sat
[2020-06-04 05:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:40:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 05:40:53] [INFO ] [Real]Absence check using state equation in 3521 ms returned (error "Failed to check-sat")
Support contains 66 out of 3495 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3124 edges and 3495 vertex of which 537 / 3495 are part of one of the 43 SCC in 44 ms
Free SCC test removed 494 places
Drop transitions removed 554 transitions
Reduce isomorphic transitions removed 554 transitions.
Performed 1277 Post agglomeration using F-continuation condition.Transition count delta: 1277
Iterating post reduction 0 with 1831 rules applied. Total rules applied 1832 place count 3001 transition count 3608
Reduce places removed 1277 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 1345 rules applied. Total rules applied 3177 place count 1724 transition count 3540
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 36 rules applied. Total rules applied 3213 place count 1694 transition count 3534
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 3216 place count 1691 transition count 3534
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 3216 place count 1691 transition count 3508
Deduced a syphon composed of 26 places in 65 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 3268 place count 1665 transition count 3508
Symmetric choice reduction at 4 with 450 rule applications. Total rules 3718 place count 1665 transition count 3508
Deduced a syphon composed of 450 places in 82 ms
Reduce places removed 450 places and 450 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 4618 place count 1215 transition count 3058
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 4624 place count 1215 transition count 3052
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 4627 place count 1213 transition count 3051
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 185 Pre rules applied. Total rules applied 4627 place count 1213 transition count 2866
Deduced a syphon composed of 185 places in 45 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 6 with 370 rules applied. Total rules applied 4997 place count 1028 transition count 2866
Symmetric choice reduction at 6 with 55 rule applications. Total rules 5052 place count 1028 transition count 2866
Deduced a syphon composed of 55 places in 41 ms
Reduce places removed 55 places and 691 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 5162 place count 973 transition count 2175
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 5178 place count 973 transition count 2159
Performed 246 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 246 places in 2 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 7 with 492 rules applied. Total rules applied 5670 place count 727 transition count 1907
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 5675 place count 727 transition count 1902
Symmetric choice reduction at 8 with 2 rule applications. Total rules 5677 place count 727 transition count 1902
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 26 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 5681 place count 725 transition count 1876
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: -609
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 8 with 126 rules applied. Total rules applied 5807 place count 662 transition count 2485
Drop transitions removed 72 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 8 with 76 rules applied. Total rules applied 5883 place count 662 transition count 2409
Free-agglomeration rule applied 303 times with reduction of 129 identical transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 6186 place count 662 transition count 1977
Reduce places removed 303 places and 0 transitions.
Drop transitions removed 564 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 598 transitions.
Iterating post reduction 9 with 901 rules applied. Total rules applied 7087 place count 359 transition count 1379
Symmetric choice reduction at 10 with 2 rule applications. Total rules 7089 place count 359 transition count 1379
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 26 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 7093 place count 357 transition count 1353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 7097 place count 357 transition count 1349
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 7099 place count 357 transition count 1347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 7124 place count 355 transition count 1324
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 7125 place count 355 transition count 1335
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 7139 place count 354 transition count 1322
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 7143 place count 354 transition count 1322
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 7144 place count 354 transition count 1322
Drop transitions removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 13 with 87 rules applied. Total rules applied 7231 place count 354 transition count 1235
Symmetric choice reduction at 13 with 9 rule applications. Total rules 7240 place count 354 transition count 1235
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 126 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 7258 place count 345 transition count 1109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 7265 place count 345 transition count 1102
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 7270 place count 345 transition count 1097
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 55 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 14 with 67 rules applied. Total rules applied 7337 place count 340 transition count 1035
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 7345 place count 340 transition count 1027
Applied a total of 7345 rules in 2078 ms. Remains 340 /3495 variables (removed 3155) and now considering 1027/5439 (removed 4412) transitions.
Finished structural reductions, in 1 iterations. Remains : 340/3495 places, 1027/5439 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11317 ms. (steps per millisecond=88 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0]
FORMULA DLCround-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 3800 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=122 )
FORMULA DLCround-PT-09b-ReachabilityFireability-14 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="DLCround-PT-09b"
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 DLCround-PT-09b, 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 r180-ebro-158987900400559"
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 [ "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 ;