fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r081-smll-158922977700231
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for FamilyReunion-PT-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15737.910 50467.00 75962.00 299.10 FTTFTFTTFTTTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r081-smll-158922977700231.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 itstools
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977700231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 64K Apr 1 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 252K Apr 1 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 1 13:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 232K Apr 1 13:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 47K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 194K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 228K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 1 10:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 1 10:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 1 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 363K Apr 1 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 4.7M 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589599808434

[2020-05-16 03:30:11] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 03:30:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 03:30:12] [INFO ] Load time of PNML (sax parser for PT used): 754 ms
[2020-05-16 03:30:12] [INFO ] Transformed 12194 places.
[2020-05-16 03:30:12] [INFO ] Transformed 10560 transitions.
[2020-05-16 03:30:12] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 916 ms.
Reduce places removed 17 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 339 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 881 ms. (steps per millisecond=11 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 653 ms. (steps per millisecond=15 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 309 ms. (steps per millisecond=32 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 106 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 10560 rows 12177 cols
[2020-05-16 03:30:16] [INFO ] Computed 2768 place invariants in 1536 ms
[2020-05-16 03:30:21] [INFO ] [Real]Absence check using 149 positive place invariants in 2472 ms returned sat
[2020-05-16 03:30:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 03:30:21] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 58 ms returned (error "Failed to check-sat")
[2020-05-16 03:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 03:30:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-05-16 03:30:26] [INFO ] [Real]Absence check using 149 positive place invariants in 2725 ms returned (error "Solver has unexpectedly terminated")
[2020-05-16 03:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 03:30:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-05-16 03:30:30] [INFO ] [Real]Absence check using 149 positive place invariants in 2036 ms returned sat
[2020-05-16 03:30:31] [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 (= s4205 (+ s4256 s4307 s4409 s5072 s5123 s5174 s5531 s6505 s6556))") while checking expression at index 2
[2020-05-16 03:30:35] [INFO ] [Real]Absence check using 149 positive place invariants in 2037 ms returned sat
[2020-05-16 03:30:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 03:30:36] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 697 ms returned (error "Failed to check-sat")
[2020-05-16 03:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 03:30:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-16 03:30:40] [INFO ] [Real]Absence check using 149 positive place invariants in 2000 ms returned sat
[2020-05-16 03:30:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 03:30:41] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 905 ms returned (error "Failed to check-sat")
[2020-05-16 03:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 03:30:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
Support contains 1348 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Discarding 884 places :
Also discarding 710 output transitions
Drop transitions removed 710 transitions
Graph (complete) has 18927 edges and 12177 vertex of which 11293 are kept as prefixes of interest. Removing 884 places using SCC suffix rule.112 ms
Drop transitions removed 51 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 1836 places :
Implicit places reduction removed 1836 places
Performed 3917 Post agglomeration using F-continuation condition.Transition count delta: 3917
Iterating post reduction 0 with 5805 rules applied. Total rules applied 5806 place count 9457 transition count 5881
Reduce places removed 3917 places and 0 transitions.
Iterating post reduction 1 with 3917 rules applied. Total rules applied 9723 place count 5540 transition count 5881
Performed 714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 714 Pre rules applied. Total rules applied 9723 place count 5540 transition count 5167
Deduced a syphon composed of 714 places in 31 ms
Ensure Unique test removed 305 places
Reduce places removed 1019 places and 0 transitions.
Iterating global reduction 2 with 1733 rules applied. Total rules applied 11456 place count 4521 transition count 5167
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 51 rules applied. Total rules applied 11507 place count 4521 transition count 5116
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 11558 place count 4470 transition count 5116
Symmetric choice reduction at 4 with 915 rule applications. Total rules 12473 place count 4470 transition count 5116
Deduced a syphon composed of 915 places in 4 ms
Reduce places removed 915 places and 915 transitions.
Iterating global reduction 4 with 1830 rules applied. Total rules applied 14303 place count 3555 transition count 4201
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 4 with 401 rules applied. Total rules applied 14704 place count 3454 transition count 3901
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 5 with 198 rules applied. Total rules applied 14902 place count 3256 transition count 3901
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 103 Pre rules applied. Total rules applied 14902 place count 3256 transition count 3798
Deduced a syphon composed of 103 places in 15 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 6 with 206 rules applied. Total rules applied 15108 place count 3153 transition count 3798
Symmetric choice reduction at 6 with 100 rule applications. Total rules 15208 place count 3153 transition count 3798
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 100 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 15408 place count 3053 transition count 3698
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 49 Pre rules applied. Total rules applied 15408 place count 3053 transition count 3649
Deduced a syphon composed of 49 places in 6 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 15506 place count 3004 transition count 3649
Symmetric choice reduction at 6 with 1 rule applications. Total rules 15507 place count 3004 transition count 3649
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 51 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 15509 place count 3003 transition count 3598
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 15560 place count 3003 transition count 3547
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 4 ms
Ensure Unique test removed 51 places
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 7 with 455 rules applied. Total rules applied 16015 place count 2750 transition count 3345
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 16117 place count 2699 transition count 3396
Free-agglomeration rule (complex) applied 55 times.
Iterating global reduction 7 with 55 rules applied. Total rules applied 16172 place count 2699 transition count 3341
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 7 with 55 rules applied. Total rules applied 16227 place count 2644 transition count 3341
Applied a total of 16227 rules in 4728 ms. Remains 2644 /12177 variables (removed 9533) and now considering 3341/10560 (removed 7219) transitions.
Finished structural reductions, in 1 iterations. Remains : 2644/12177 places, 3341/10560 transitions.
Incomplete random walk after 1000000 steps, including 1202 resets, run finished after 11144 ms. (steps per millisecond=89 ) properties seen :[1, 1, 1, 0, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 205912 steps, including 3 resets, run visited all 1 properties in 481 ms. (steps per millisecond=428 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589599858901

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="FamilyReunion-PT-L00050M0005C002P002G001"
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"

# 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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r081-smll-158922977700231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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