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

About the Execution of 2020-gold for HirschbergSinclair-PT-40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
550.451 32750.00 45110.00 747.50 TTFTFTTFTTFTTTFT 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.r303-tall-162124171300228.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 HirschbergSinclair-PT-40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.1K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 1.4M May 12 08:13 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 leader_election-ReachabilityFireability-00
FORMULA_NAME leader_election-ReachabilityFireability-01
FORMULA_NAME leader_election-ReachabilityFireability-02
FORMULA_NAME leader_election-ReachabilityFireability-03
FORMULA_NAME leader_election-ReachabilityFireability-04
FORMULA_NAME leader_election-ReachabilityFireability-05
FORMULA_NAME leader_election-ReachabilityFireability-06
FORMULA_NAME leader_election-ReachabilityFireability-07
FORMULA_NAME leader_election-ReachabilityFireability-08
FORMULA_NAME leader_election-ReachabilityFireability-09
FORMULA_NAME leader_election-ReachabilityFireability-10
FORMULA_NAME leader_election-ReachabilityFireability-11
FORMULA_NAME leader_election-ReachabilityFireability-12
FORMULA_NAME leader_election-ReachabilityFireability-13
FORMULA_NAME leader_election-ReachabilityFireability-14
FORMULA_NAME leader_election-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621350050175

[2021-05-18 15:00:52] [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]
[2021-05-18 15:00:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 15:00:52] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2021-05-18 15:00:52] [INFO ] Transformed 1068 places.
[2021-05-18 15:00:52] [INFO ] Transformed 982 transitions.
[2021-05-18 15:00:52] [INFO ] Parsed PT model containing 1068 places and 982 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 62 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 116 ms. (steps per millisecond=86 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1]
FORMULA leader_election-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 1, 0, 0, 0]
FORMULA leader_election-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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]
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]
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]
// Phase 1: matrix 982 rows 1068 cols
[2021-05-18 15:00:52] [INFO ] Computed 86 place invariants in 35 ms
[2021-05-18 15:00:53] [INFO ] [Real]Absence check using 80 positive place invariants in 93 ms returned sat
[2021-05-18 15:00:53] [INFO ] [Real]Absence check using 80 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 15:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 15:00:55] [INFO ] [Real]Absence check using state equation in 2425 ms returned sat
[2021-05-18 15:00:56] [INFO ] Deduced a trap composed of 18 places in 586 ms
[2021-05-18 15:00:56] [INFO ] Deduced a trap composed of 36 places in 516 ms
[2021-05-18 15:00:57] [INFO ] Deduced a trap composed of 35 places in 490 ms
[2021-05-18 15:00:57] [INFO ] Deduced a trap composed of 14 places in 472 ms
[2021-05-18 15:00:57] [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: Stream closed (> (+ s47 s48 s81 s239 s243 s247 s248 s511 s641 s705 s786 s818 s899 s995) 0)") while checking expression at index 0
[2021-05-18 15:00:58] [INFO ] [Real]Absence check using 80 positive place invariants in 83 ms returned sat
[2021-05-18 15:00:58] [INFO ] [Real]Absence check using 80 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-18 15:00:58] [INFO ] [Real]Absence check using 80 positive place invariants in 83 ms returned sat
[2021-05-18 15:00:58] [INFO ] [Real]Absence check using 80 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-18 15:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 15:01:00] [INFO ] [Real]Absence check using state equation in 2507 ms returned sat
[2021-05-18 15:01:01] [INFO ] Deduced a trap composed of 25 places in 470 ms
[2021-05-18 15:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2021-05-18 15:01:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 15:01:01] [INFO ] [Nat]Absence check using 80 positive place invariants in 81 ms returned sat
[2021-05-18 15:01:01] [INFO ] [Nat]Absence check using 80 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-18 15:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 15:01:03] [INFO ] [Nat]Absence check using state equation in 2386 ms returned sat
[2021-05-18 15:01:04] [INFO ] Deduced a trap composed of 25 places in 470 ms
[2021-05-18 15:01:04] [INFO ] Deduced a trap composed of 35 places in 444 ms
[2021-05-18 15:01:05] [INFO ] Deduced a trap composed of 15 places in 435 ms
[2021-05-18 15:01:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1490 ms
[2021-05-18 15:01:05] [INFO ] Computed and/alt/rep : 942/7009/942 causal constraints in 77 ms.
[2021-05-18 15:01:06] [INFO ] Added : 45 causal constraints over 9 iterations in 936 ms. Result :(error "Failed to check-sat")
[2021-05-18 15:01:06] [INFO ] [Real]Absence check using 80 positive place invariants in 85 ms returned sat
[2021-05-18 15:01:06] [INFO ] [Real]Absence check using 80 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-18 15:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 15:01:09] [INFO ] [Real]Absence check using state equation in 2504 ms returned sat
[2021-05-18 15:01:09] [INFO ] Deduced a trap composed of 25 places in 497 ms
[2021-05-18 15:01:10] [INFO ] Deduced a trap composed of 35 places in 505 ms
[2021-05-18 15:01:10] [INFO ] Deduced a trap composed of 19 places in 488 ms
[2021-05-18 15:01:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1634 ms
[2021-05-18 15:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 15:01:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 85 ms returned sat
[2021-05-18 15:01:10] [INFO ] [Nat]Absence check using 80 positive and 6 generalized place invariants in 9 ms returned sat
[2021-05-18 15:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 15:01:13] [INFO ] [Nat]Absence check using state equation in 2449 ms returned sat
[2021-05-18 15:01:13] [INFO ] Deduced a trap composed of 27 places in 504 ms
[2021-05-18 15:01:14] [INFO ] Deduced a trap composed of 23 places in 484 ms
[2021-05-18 15:01:14] [INFO ] Deduced a trap composed of 15 places in 473 ms
[2021-05-18 15:01:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1578 ms
[2021-05-18 15:01:15] [INFO ] Computed and/alt/rep : 942/7009/942 causal constraints in 71 ms.
[2021-05-18 15:01:15] [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: Stream closed (=> (> t114 0) (and (or (and (> t13 0) (< o13 o114)) (and (> t115 0) (< o115 o114)) (and (> t119 0) (< o119 o114)) (and (> t123 0) (< o123 o114)) (and (> t487 0) (< o487 o114)) (and (> t495 0) (< o495 o114)) (and (> t576 0) (< o576 o114)) (and (> t600 0) (< o600 o114)) (and (> t680 0) (< o680 o114)) (and (> t752 0) (< o752 o114)) (and (> t833 0) (< o833 o114)) (and (> t889 0) (< o889 o114))) (and (> t12 0) (< o12 o114))))") while checking expression at index 3
FORMULA leader_election-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 17 out of 1068 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1068/1068 places, 982/982 transitions.
Discarding 40 places :
Also discarding 0 output transitions
Graph (complete) has 2054 edges and 1068 vertex of which 1028 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.9 ms
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1028 transition count 604
Reduce places removed 378 places and 0 transitions.
Discarding 96 places :
Also discarding 0 output transitions
Graph (complete) has 1113 edges and 650 vertex of which 554 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Iterating post reduction 1 with 379 rules applied. Total rules applied 758 place count 554 transition count 604
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 854 place count 554 transition count 508
Symmetric choice reduction at 3 with 10 rule applications. Total rules 864 place count 554 transition count 508
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 884 place count 544 transition count 498
Symmetric choice reduction at 3 with 8 rule applications. Total rules 892 place count 544 transition count 498
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 908 place count 536 transition count 490
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 947 place count 536 transition count 451
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 986 place count 497 transition count 451
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 987 place count 496 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 988 place count 495 transition count 449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 989 place count 494 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 990 place count 493 transition count 447
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 991 place count 492 transition count 446
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 992 place count 491 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 993 place count 490 transition count 444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 994 place count 489 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 995 place count 488 transition count 442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 996 place count 487 transition count 441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 997 place count 486 transition count 440
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 998 place count 485 transition count 439
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 999 place count 484 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1000 place count 483 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1001 place count 482 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1002 place count 481 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1003 place count 480 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1004 place count 479 transition count 433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1005 place count 478 transition count 432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1006 place count 477 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1007 place count 476 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1008 place count 475 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1009 place count 474 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1010 place count 473 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1011 place count 472 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1012 place count 471 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 470 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 469 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1015 place count 468 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1016 place count 467 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1017 place count 466 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1018 place count 465 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1019 place count 464 transition count 418
Applied a total of 1019 rules in 855 ms. Remains 464 /1068 variables (removed 604) and now considering 418/982 (removed 564) transitions.
Finished structural reductions, in 1 iterations. Remains : 464/1068 places, 418/982 transitions.
Incomplete random walk after 1000000 steps, including 2312 resets, run finished after 2740 ms. (steps per millisecond=364 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 485 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties seen :[1, 0, 0]
FORMULA leader_election-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 729 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties seen :[1, 0]
FORMULA leader_election-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 686 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=228 )
FORMULA leader_election-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621350082925

--------------------
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="HirschbergSinclair-PT-40"
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 HirschbergSinclair-PT-40, 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 r303-tall-162124171300228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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