fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r094-tall-162048902800480
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for FamilyReunion-PT-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2287.939 3600000.00 125147.00 349.10 FTFFTFFTTTTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902800480.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
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 r094-tall-162048902800480
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 524K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 629K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 34K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 84K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 225K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Mar 23 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Mar 23 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 163K Mar 22 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 428K Mar 22 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M May 5 16:51 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 1620802105160

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-12 06:48:26] [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]
[2021-05-12 06:48:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:48:27] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2021-05-12 06:48:27] [INFO ] Transformed 12194 places.
[2021-05-12 06:48:27] [INFO ] Transformed 10560 transitions.
[2021-05-12 06:48:27] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 429 ms.
Reduce places removed 17 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 265 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 326 ms. (steps per millisecond=30 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0]
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-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06 FALSE 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-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 379 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 10560 rows 12177 cols
[2021-05-12 06:48:29] [INFO ] Computed 2768 place invariants in 1306 ms
[2021-05-12 06:48:32] [INFO ] [Real]Absence check using 149 positive place invariants in 1338 ms returned sat
[2021-05-12 06:48:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-12 06:48:34] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2607 ms returned (error "Failed to check-sat")
[2021-05-12 06:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:48:34] [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
[2021-05-12 06:48:36] [INFO ] [Real]Absence check using 149 positive place invariants in 1138 ms returned sat
[2021-05-12 06:48:39] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2907 ms returned (error "Failed to check-sat")
[2021-05-12 06:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:48:39] [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
[2021-05-12 06:48:41] [INFO ] [Real]Absence check using 149 positive place invariants in 1128 ms returned sat
[2021-05-12 06:48:44] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2936 ms returned (error "Solver has unexpectedly terminated")
[2021-05-12 06:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:48:44] [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 2
[2021-05-12 06:48:46] [INFO ] [Real]Absence check using 149 positive place invariants in 973 ms returned sat
[2021-05-12 06:48:49] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2904 ms returned (error "Failed to check-sat")
[2021-05-12 06:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:48:49] [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
[2021-05-12 06:48:51] [INFO ] [Real]Absence check using 149 positive place invariants in 951 ms returned sat
[2021-05-12 06:48:54] [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 (= (+ s2481 s3960 s4827 s6258 s6976) (+ s2175 s2787 s3654 s5286 s5952 s7384 s7690))") while checking expression at index 4
[2021-05-12 06:48:56] [INFO ] [Real]Absence check using 149 positive place invariants in 966 ms returned sat
[2021-05-12 06:48:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-12 06:48:59] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 3048 ms returned (error "Failed to check-sat")
[2021-05-12 06:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:48:59] [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 5
Support contains 940 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Discarding 277 places :
Also discarding 54 output transitions
Drop transitions removed 54 transitions
Graph (complete) has 18927 edges and 12177 vertex of which 11900 are kept as prefixes of interest. Removing 277 places using SCC suffix rule.44 ms
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Discarding 1833 places :
Implicit places reduction removed 1833 places
Performed 4315 Post agglomeration using F-continuation condition.Transition count delta: 4315
Iterating post reduction 0 with 6298 rules applied. Total rules applied 6299 place count 10067 transition count 6041
Reduce places removed 4315 places and 0 transitions.
Iterating post reduction 1 with 4315 rules applied. Total rules applied 10614 place count 5752 transition count 6041
Performed 662 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 662 Pre rules applied. Total rules applied 10614 place count 5752 transition count 5379
Deduced a syphon composed of 662 places in 6 ms
Ensure Unique test removed 304 places
Reduce places removed 966 places and 0 transitions.
Iterating global reduction 2 with 1628 rules applied. Total rules applied 12242 place count 4786 transition count 5379
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Iterating post reduction 2 with 153 rules applied. Total rules applied 12395 place count 4785 transition count 5227
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 3 with 152 rules applied. Total rules applied 12547 place count 4633 transition count 5227
Symmetric choice reduction at 4 with 970 rule applications. Total rules 13517 place count 4633 transition count 5227
Deduced a syphon composed of 970 places in 13 ms
Reduce places removed 970 places and 971 transitions.
Iterating global reduction 4 with 1940 rules applied. Total rules applied 15457 place count 3663 transition count 4256
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Iterating post reduction 4 with 253 rules applied. Total rules applied 15710 place count 3663 transition count 4003
Reduce places removed 253 places and 0 transitions.
Iterating post reduction 5 with 253 rules applied. Total rules applied 15963 place count 3410 transition count 4003
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 15963 place count 3410 transition count 4001
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 15967 place count 3408 transition count 4001
Symmetric choice reduction at 6 with 108 rule applications. Total rules 16075 place count 3408 transition count 4001
Deduced a syphon composed of 108 places in 2 ms
Reduce places removed 108 places and 408 transitions.
Iterating global reduction 6 with 216 rules applied. Total rules applied 16291 place count 3300 transition count 3593
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 6 with 100 rules applied. Total rules applied 16391 place count 3250 transition count 3543
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 16391 place count 3250 transition count 3442
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 16593 place count 3149 transition count 3442
Symmetric choice reduction at 7 with 2 rule applications. Total rules 16595 place count 3149 transition count 3442
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 102 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 16599 place count 3147 transition count 3340
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 7 with 204 rules applied. Total rules applied 16803 place count 3096 transition count 3187
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 16854 place count 3045 transition count 3187
Performed 305 Post agglomeration using F-continuation condition.Transition count delta: 305
Deduced a syphon composed of 305 places in 1 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 9 with 610 rules applied. Total rules applied 17464 place count 2740 transition count 2882
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 17465 place count 2740 transition count 2881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 17466 place count 2739 transition count 2881
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 10 with 102 rules applied. Total rules applied 17568 place count 2739 transition count 2779
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 10 with 153 rules applied. Total rules applied 17721 place count 2586 transition count 2779
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 11 with 100 rules applied. Total rules applied 17821 place count 2586 transition count 2779
Applied a total of 17821 rules in 3674 ms. Remains 2586 /12177 variables (removed 9591) and now considering 2779/10560 (removed 7781) transitions.
Finished structural reductions, in 1 iterations. Remains : 2586/12177 places, 2779/10560 transitions.
Incomplete random walk after 1000000 steps, including 1356 resets, run finished after 9746 ms. (steps per millisecond=102 ) properties seen :[1, 1, 1, 1, 1, 0]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12 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-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 1905 ms. (steps per millisecond=524 ) properties seen :[0]
// Phase 1: matrix 2779 rows 2586 cols
[2021-05-12 06:49:15] [INFO ] Computed 367 place invariants in 60 ms
[2021-05-12 06:49:16] [INFO ] [Real]Absence check using 0 positive and 367 generalized place invariants in 518 ms returned sat
[2021-05-12 06:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:49:30] [INFO ] [Real]Absence check using state equation in 14187 ms returned sat
[2021-05-12 06:49:30] [INFO ] Computed and/alt/rep : 2473/38214/2473 causal constraints in 212 ms.
[2021-05-12 06:49:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:49:31] [INFO ] [Nat]Absence check using 0 positive and 367 generalized place invariants in 497 ms returned sat
[2021-05-12 06:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 06:49:46] [INFO ] [Nat]Absence check using state equation in 14301 ms returned sat
[2021-05-12 06:49:46] [INFO ] Computed and/alt/rep : 2473/38214/2473 causal constraints in 209 ms.
[2021-05-12 06:50:06] [INFO ] Added : 595 causal constraints over 119 iterations in 20125 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 90 ms.
Finished Parikh walk after 572 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=63 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
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 r094-tall-162048902800480"
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 ;