fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987881800031
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCshifumi-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.430 3600000.00 84428.00 50.90 TFFFFFTTTFTTTTTF 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.r178-tajo-158987881800031.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 DLCshifumi-PT-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881800031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 3.2K Mar 30 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 12:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 07:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 07:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 01:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 01:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.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 DLCshifumi-PT-3b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591199218342

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:47:00] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2020-06-03 15:47:00] [INFO ] Transformed 7058 places.
[2020-06-03 15:47:00] [INFO ] Transformed 9611 transitions.
[2020-06-03 15:47:00] [INFO ] Found NUPN structural information;
[2020-06-03 15:47:00] [INFO ] Parsed PT model containing 7058 places and 9611 transitions in 459 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 304 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 170 ms. (steps per millisecond=58 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 9611 rows 7058 cols
[2020-06-03 15:47:01] [INFO ] Computed 282 place invariants in 188 ms
[2020-06-03 15:47:03] [INFO ] [Real]Absence check using 282 positive place invariants in 1311 ms returned sat
[2020-06-03 15:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:06] [INFO ] [Real]Absence check using state equation in 2706 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 15:47:08] [INFO ] [Real]Absence check using 282 positive place invariants in 1362 ms returned sat
[2020-06-03 15:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:11] [INFO ] [Real]Absence check using state equation in 2606 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:13] [INFO ] [Real]Absence check using 282 positive place invariants in 1223 ms returned sat
[2020-06-03 15:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:16] [INFO ] [Real]Absence check using state equation in 2767 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:18] [INFO ] [Real]Absence check using 282 positive place invariants in 1118 ms returned sat
[2020-06-03 15:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:21] [INFO ] [Real]Absence check using state equation in 2964 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:23] [INFO ] [Real]Absence check using 282 positive place invariants in 1257 ms returned sat
[2020-06-03 15:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:26] [INFO ] [Real]Absence check using state equation in 3015 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:28] [INFO ] [Real]Absence check using 282 positive place invariants in 1136 ms returned sat
[2020-06-03 15:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:31] [INFO ] [Real]Absence check using state equation in 2925 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:33] [INFO ] [Real]Absence check using 282 positive place invariants in 1260 ms returned sat
[2020-06-03 15:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:36] [INFO ] [Real]Absence check using state equation in 2764 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:38] [INFO ] [Real]Absence check using 282 positive place invariants in 1165 ms returned sat
[2020-06-03 15:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:41] [INFO ] [Real]Absence check using state equation in 2945 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:43] [INFO ] [Real]Absence check using 282 positive place invariants in 1208 ms returned sat
[2020-06-03 15:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:46] [INFO ] [Real]Absence check using state equation in 2950 ms returned (error "Failed to check-sat")
[2020-06-03 15:47:48] [INFO ] [Real]Absence check using 282 positive place invariants in 1349 ms returned sat
[2020-06-03 15:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:47:51] [INFO ] [Real]Absence check using state equation in 2773 ms returned (error "Failed to check-sat")
Support contains 36 out of 7058 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7058/7058 places, 9611/9611 transitions.
Graph (trivial) has 6727 edges and 7058 vertex of which 739 / 7058 are part of one of the 51 SCC in 48 ms
Free SCC test removed 688 places
Drop transitions removed 779 transitions
Reduce isomorphic transitions removed 779 transitions.
Performed 3530 Post agglomeration using F-continuation condition.Transition count delta: 3530
Iterating post reduction 0 with 4309 rules applied. Total rules applied 4310 place count 6370 transition count 5302
Reduce places removed 3530 places and 0 transitions.
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Iterating post reduction 1 with 3775 rules applied. Total rules applied 8085 place count 2840 transition count 5057
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 2 with 197 rules applied. Total rules applied 8282 place count 2718 transition count 4982
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 8319 place count 2681 transition count 4982
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 8319 place count 2681 transition count 4935
Deduced a syphon composed of 47 places in 44 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 8413 place count 2634 transition count 4935
Symmetric choice reduction at 4 with 734 rule applications. Total rules 9147 place count 2634 transition count 4935
Deduced a syphon composed of 734 places in 93 ms
Reduce places removed 734 places and 734 transitions.
Iterating global reduction 4 with 1468 rules applied. Total rules applied 10615 place count 1900 transition count 4201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10617 place count 1900 transition count 4199
Performed 277 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 277 Pre rules applied. Total rules applied 10617 place count 1900 transition count 3922
Deduced a syphon composed of 277 places in 26 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 5 with 554 rules applied. Total rules applied 11171 place count 1623 transition count 3922
Symmetric choice reduction at 5 with 88 rule applications. Total rules 11259 place count 1623 transition count 3922
Deduced a syphon composed of 88 places in 24 ms
Reduce places removed 88 places and 756 transitions.
Iterating global reduction 5 with 176 rules applied. Total rules applied 11435 place count 1535 transition count 3166
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 11512 place count 1535 transition count 3089
Performed 381 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 381 places in 1 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 6 with 762 rules applied. Total rules applied 12274 place count 1154 transition count 2706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 12275 place count 1154 transition count 2705
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 7 with 1 rule applications. Total rules 12276 place count 1154 transition count 2705
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 41 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 12278 place count 1153 transition count 2664
Performed 101 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
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 12480 place count 1052 transition count 2870
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 12481 place count 1052 transition count 2869
Performed 28 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 12537 place count 1024 transition count 3030
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 12562 place count 1024 transition count 3005
Free-agglomeration rule applied 574 times with reduction of 284 identical transitions.
Iterating global reduction 9 with 574 rules applied. Total rules applied 13136 place count 1024 transition count 2147
Reduce places removed 574 places and 0 transitions.
Drop transitions removed 654 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 674 transitions.
Discarding 89 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Graph (complete) has 1668 edges and 450 vertex of which 361 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.23 ms
Iterating post reduction 9 with 1249 rules applied. Total rules applied 14385 place count 361 transition count 1424
Drop transitions removed 221 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 229 transitions.
Iterating post reduction 10 with 229 rules applied. Total rules applied 14614 place count 361 transition count 1195
Symmetric choice reduction at 11 with 10 rule applications. Total rules 14624 place count 361 transition count 1195
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 30 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 14644 place count 351 transition count 1165
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 14660 place count 351 transition count 1149
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 14664 place count 351 transition count 1314
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 12 with 162 rules applied. Total rules applied 14826 place count 347 transition count 1156
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 14829 place count 347 transition count 1156
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 14830 place count 347 transition count 1156
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 13 with 53 rules applied. Total rules applied 14883 place count 347 transition count 1103
Applied a total of 14883 rules in 2533 ms. Remains 347 /7058 variables (removed 6711) and now considering 1103/9611 (removed 8508) transitions.
Finished structural reductions, in 1 iterations. Remains : 347/7058 places, 1103/9611 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6614 ms. (steps per millisecond=151 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 1, 1]
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3120 ms. (steps per millisecond=320 ) properties seen :[1, 0]
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 539 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=179 )
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-11 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="DLCshifumi-PT-3b"
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 DLCshifumi-PT-3b, 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 r178-tajo-158987881800031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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