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-158987900400575.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-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.8K Mar 30 19:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 19:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 09:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 09:57 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 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 00:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 00:08 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.5M 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-10b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591252661813

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:37:44] [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 06:37:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:37:45] [INFO ] Load time of PNML (sax parser for PT used): 530 ms
[2020-06-04 06:37:45] [INFO ] Transformed 3924 places.
[2020-06-04 06:37:45] [INFO ] Transformed 6192 transitions.
[2020-06-04 06:37:45] [INFO ] Found NUPN structural information;
[2020-06-04 06:37:45] [INFO ] Parsed PT model containing 3924 places and 6192 transitions in 826 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 398 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 228 ms. (steps per millisecond=43 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1]
FORMULA DLCround-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 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, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 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, 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, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 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, 1, 0]
FORMULA DLCround-PT-10b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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, 0, 0, 0, 0]
// Phase 1: matrix 6192 rows 3924 cols
[2020-06-04 06:37:47] [INFO ] Computed 213 place invariants in 169 ms
[2020-06-04 06:37:49] [INFO ] [Real]Absence check using 213 positive place invariants in 1261 ms returned sat
[2020-06-04 06:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:37:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:37:52] [INFO ] [Real]Absence check using state equation in 2763 ms returned (error "Failed to check-sat")
[2020-06-04 06:37:54] [INFO ] [Real]Absence check using 213 positive place invariants in 1175 ms returned sat
[2020-06-04 06:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:37:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:37:57] [INFO ] [Real]Absence check using state equation in 3131 ms returned (error "Failed to check-sat")
[2020-06-04 06:37:59] [INFO ] [Real]Absence check using 213 positive place invariants in 1211 ms returned sat
[2020-06-04 06:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:02] [INFO ] [Real]Absence check using state equation in 3009 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:04] [INFO ] [Real]Absence check using 213 positive place invariants in 1143 ms returned sat
[2020-06-04 06:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:07] [INFO ] [Real]Absence check using state equation in 3105 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:09] [INFO ] [Real]Absence check using 213 positive place invariants in 1190 ms returned sat
[2020-06-04 06:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:12] [INFO ] [Real]Absence check using state equation in 3053 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:14] [INFO ] [Real]Absence check using 213 positive place invariants in 1147 ms returned sat
[2020-06-04 06:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:17] [INFO ] [Real]Absence check using state equation in 3157 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:19] [INFO ] [Real]Absence check using 213 positive place invariants in 1086 ms returned sat
[2020-06-04 06:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:22] [INFO ] [Real]Absence check using state equation in 3264 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:24] [INFO ] [Real]Absence check using 213 positive place invariants in 1113 ms returned sat
[2020-06-04 06:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:27] [INFO ] [Real]Absence check using state equation in 3224 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:29] [INFO ] [Real]Absence check using 213 positive place invariants in 1128 ms returned sat
[2020-06-04 06:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:32] [INFO ] [Real]Absence check using state equation in 3069 ms returned (error "Failed to check-sat")
[2020-06-04 06:38:34] [INFO ] [Real]Absence check using 213 positive place invariants in 1083 ms returned sat
[2020-06-04 06:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:38:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 06:38:37] [INFO ] [Real]Absence check using state equation in 3211 ms returned unknown
Support contains 83 out of 3924 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3924/3924 places, 6192/6192 transitions.
Graph (trivial) has 3462 edges and 3924 vertex of which 592 / 3924 are part of one of the 44 SCC in 62 ms
Free SCC test removed 548 places
Drop transitions removed 611 transitions
Reduce isomorphic transitions removed 611 transitions.
Performed 1391 Post agglomeration using F-continuation condition.Transition count delta: 1391
Iterating post reduction 0 with 2002 rules applied. Total rules applied 2003 place count 3376 transition count 4190
Reduce places removed 1391 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 1463 rules applied. Total rules applied 3466 place count 1985 transition count 4118
Reduce places removed 32 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 38 rules applied. Total rules applied 3504 place count 1953 transition count 4112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 3507 place count 1950 transition count 4112
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 3507 place count 1950 transition count 4075
Deduced a syphon composed of 37 places in 101 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 3581 place count 1913 transition count 4075
Symmetric choice reduction at 4 with 510 rule applications. Total rules 4091 place count 1913 transition count 4075
Deduced a syphon composed of 510 places in 64 ms
Reduce places removed 510 places and 510 transitions.
Iterating global reduction 4 with 1020 rules applied. Total rules applied 5111 place count 1403 transition count 3565
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 5117 place count 1403 transition count 3559
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 5120 place count 1401 transition count 3558
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 208 Pre rules applied. Total rules applied 5120 place count 1401 transition count 3350
Deduced a syphon composed of 208 places in 57 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 6 with 416 rules applied. Total rules applied 5536 place count 1193 transition count 3350
Symmetric choice reduction at 6 with 63 rule applications. Total rules 5599 place count 1193 transition count 3350
Deduced a syphon composed of 63 places in 51 ms
Reduce places removed 63 places and 851 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 5725 place count 1130 transition count 2499
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 5742 place count 1130 transition count 2482
Performed 294 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 294 places in 2 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 7 with 588 rules applied. Total rules applied 6330 place count 836 transition count 2178
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 6338 place count 836 transition count 2170
Symmetric choice reduction at 8 with 5 rule applications. Total rules 6343 place count 836 transition count 2170
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 70 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 6353 place count 831 transition count 2100
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: -561
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 6459 place count 778 transition count 2661
Drop transitions removed 44 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 6504 place count 778 transition count 2616
Free-agglomeration rule applied 371 times with reduction of 142 identical transitions.
Iterating global reduction 9 with 371 rules applied. Total rules applied 6875 place count 778 transition count 2103
Reduce places removed 371 places and 0 transitions.
Drop transitions removed 619 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 637 transitions.
Discarding 9 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Graph (complete) has 1430 edges and 407 vertex of which 398 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Iterating post reduction 9 with 1009 rules applied. Total rules applied 7884 place count 398 transition count 1448
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 7911 place count 398 transition count 1421
Symmetric choice reduction at 11 with 2 rule applications. Total rules 7913 place count 398 transition count 1421
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 28 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 7917 place count 396 transition count 1393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 7919 place count 396 transition count 1391
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 7921 place count 396 transition count 1389
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 1382 edges and 394 vertex of which 389 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Iterating post reduction 12 with 29 rules applied. Total rules applied 7950 place count 389 transition count 1363
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 7957 place count 389 transition count 1363
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 13 with 95 rules applied. Total rules applied 8052 place count 389 transition count 1268
Symmetric choice reduction at 13 with 5 rule applications. Total rules 8057 place count 389 transition count 1268
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 80 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 8067 place count 384 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 8070 place count 384 transition count 1185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 8072 place count 383 transition count 1195
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 8077 place count 383 transition count 1190
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 47 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 14 with 53 rules applied. Total rules applied 8130 place count 378 transition count 1142
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 8139 place count 378 transition count 1133
Applied a total of 8139 rules in 2480 ms. Remains 378 /3924 variables (removed 3546) and now considering 1133/6192 (removed 5059) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/3924 places, 1133/6192 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11129 ms. (steps per millisecond=89 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 1]
FORMULA DLCround-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 889601 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen :[1, 0]
FORMULA DLCround-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2358 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=90 )
FORMULA DLCround-PT-10b-ReachabilityFireability-10 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-10b"
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-10b, 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-158987900400575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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