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

About the Execution of 2020-gold for NoC3x3-PT-8B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1014.063 3600000.00 76692.00 492.20 FTTFTTTTFTFFTTTT 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.r151-tall-162089151200176.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 NoC3x3-PT-8B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 NoC3x3-PT-8B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621003106068

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 14:38:28] [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-14 14:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 14:38:28] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2021-05-14 14:38:28] [INFO ] Transformed 9140 places.
[2021-05-14 14:38:28] [INFO ] Transformed 14577 transitions.
[2021-05-14 14:38:28] [INFO ] Found NUPN structural information;
[2021-05-14 14:38:28] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 587 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 366 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 207 ms. (steps per millisecond=48 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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, 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, 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, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-06 TRUE 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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 26 ms. (steps per millisecond=384 ) 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 24 ms. (steps per millisecond=416 ) 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 24 ms. (steps per millisecond=416 ) 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 22 ms. (steps per millisecond=454 ) 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 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 14577 rows 9140 cols
[2021-05-14 14:38:30] [INFO ] Computed 99 place invariants in 488 ms
[2021-05-14 14:38:32] [INFO ] [Real]Absence check using 99 positive place invariants in 975 ms returned sat
[2021-05-14 14:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:35] [INFO ] [Real]Absence check using state equation in 2776 ms returned (error "Failed to check-sat")
[2021-05-14 14:38:37] [INFO ] [Real]Absence check using 99 positive place invariants in 877 ms returned sat
[2021-05-14 14:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:40] [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 (= s143 (- t13679 (+ t13680 t13702 t13704 t13706 t13708 t13710)))") while checking expression at index 1
[2021-05-14 14:38:42] [INFO ] [Real]Absence check using 99 positive place invariants in 877 ms returned sat
[2021-05-14 14:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:45] [INFO ] [Real]Absence check using state equation in 3058 ms returned (error "Failed to check-sat")
[2021-05-14 14:38:47] [INFO ] [Real]Absence check using 99 positive place invariants in 869 ms returned sat
[2021-05-14 14:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:50] [INFO ] [Real]Absence check using state equation in 3070 ms returned (error "Failed to check-sat")
[2021-05-14 14:38:52] [INFO ] [Real]Absence check using 99 positive place invariants in 887 ms returned sat
[2021-05-14 14:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:55] [INFO ] [Real]Absence check using state equation in 3072 ms returned (error "Failed to check-sat")
[2021-05-14 14:38:57] [INFO ] [Real]Absence check using 99 positive place invariants in 915 ms returned sat
[2021-05-14 14:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:00] [INFO ] [Real]Absence check using state equation in 3036 ms returned (error "Failed to check-sat")
[2021-05-14 14:39:02] [INFO ] [Real]Absence check using 99 positive place invariants in 882 ms returned sat
[2021-05-14 14:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:05] [INFO ] [Real]Absence check using state equation in 3065 ms returned (error "Failed to check-sat")
[2021-05-14 14:39:07] [INFO ] [Real]Absence check using 99 positive place invariants in 923 ms returned sat
[2021-05-14 14:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:10] [INFO ] [Real]Absence check using state equation in 3020 ms returned (error "Failed to check-sat")
[2021-05-14 14:39:12] [INFO ] [Real]Absence check using 99 positive place invariants in 921 ms returned sat
[2021-05-14 14:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:15] [INFO ] [Real]Absence check using state equation in 3017 ms returned (error "Failed to check-sat")
[2021-05-14 14:39:17] [INFO ] [Real]Absence check using 99 positive place invariants in 925 ms returned sat
[2021-05-14 14:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:20] [INFO ] [Real]Absence check using state equation in 3020 ms returned (error "Failed to check-sat")
[2021-05-14 14:39:22] [INFO ] [Real]Absence check using 99 positive place invariants in 902 ms returned sat
[2021-05-14 14:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:39:25] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:39:25] [INFO ] [Real]Absence check using state equation in 3021 ms returned (error "Failed to check-sat")
Support contains 55 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13429 edges and 9140 vertex of which 1903 / 9140 are part of one of the 31 SCC in 43 ms
Free SCC test removed 1872 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 13110 edges and 7268 vertex of which 7155 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.29 ms
Drop transitions removed 2944 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3048 transitions.
Performed 4545 Post agglomeration using F-continuation condition.Transition count delta: 4545
Iterating post reduction 0 with 7593 rules applied. Total rules applied 7595 place count 7155 transition count 6904
Reduce places removed 4545 places and 0 transitions.
Ensure Unique test removed 2564 transitions
Reduce isomorphic transitions removed 2564 transitions.
Performed 1275 Post agglomeration using F-continuation condition.Transition count delta: 1275
Iterating post reduction 1 with 8384 rules applied. Total rules applied 15979 place count 2610 transition count 3065
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 1275 transitions
Reduce isomorphic transitions removed 1275 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 2568 rules applied. Total rules applied 18547 place count 1335 transition count 1772
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 18565 place count 1317 transition count 1772
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 18565 place count 1317 transition count 1722
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 18665 place count 1267 transition count 1722
Symmetric choice reduction at 4 with 351 rule applications. Total rules 19016 place count 1267 transition count 1722
Deduced a syphon composed of 351 places in 13 ms
Reduce places removed 351 places and 351 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 19718 place count 916 transition count 1371
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 19771 place count 916 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 60 Pre rules applied. Total rules applied 19771 place count 916 transition count 1258
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 19891 place count 856 transition count 1258
Symmetric choice reduction at 5 with 46 rule applications. Total rules 19937 place count 856 transition count 1258
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 62 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 20029 place count 810 transition count 1196
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 20045 place count 810 transition count 1180
Performed 232 Post agglomeration using F-continuation condition.Transition count delta: 232
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 6 with 464 rules applied. Total rules applied 20509 place count 578 transition count 948
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 20530 place count 578 transition count 927
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 20548 place count 569 transition count 963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 20549 place count 569 transition count 962
Free-agglomeration rule applied 226 times.
Iterating global reduction 8 with 226 rules applied. Total rules applied 20775 place count 569 transition count 736
Reduce places removed 226 places and 0 transitions.
Drop transitions removed 41 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 1057 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Iterating post reduction 8 with 275 rules applied. Total rules applied 21050 place count 336 transition count 688
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 21057 place count 336 transition count 681
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 10 with 29 rules applied. Total rules applied 21086 place count 336 transition count 681
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 21090 place count 336 transition count 681
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 21093 place count 336 transition count 678
Drop transitions removed 148 transitions
Redundant transition composition rules discarded 148 transitions
Iterating global reduction 11 with 148 rules applied. Total rules applied 21241 place count 336 transition count 530
Reduce places removed 1 places and 0 transitions.
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 929 edges and 335 vertex of which 322 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Iterating post reduction 11 with 2 rules applied. Total rules applied 21243 place count 322 transition count 530
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 21256 place count 322 transition count 517
Symmetric choice reduction at 13 with 5 rule applications. Total rules 21261 place count 322 transition count 517
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 8 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 21271 place count 317 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 21272 place count 316 transition count 508
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 13 with 15 rules applied. Total rules applied 21287 place count 308 transition count 501
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 21295 place count 301 transition count 500
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 15 with 44 rules applied. Total rules applied 21339 place count 301 transition count 456
Symmetric choice reduction at 15 with 11 rule applications. Total rules 21350 place count 301 transition count 456
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 21372 place count 290 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 21373 place count 290 transition count 445
Applied a total of 21373 rules in 1831 ms. Remains 290 /9140 variables (removed 8850) and now considering 445/14577 (removed 14132) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/9140 places, 445/14577 transitions.
Finished random walk after 6295 steps, including 0 resets, run visited all 11 properties in 32 ms. (steps per millisecond=196 )
FORMULA NoC3x3-PT-8B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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="NoC3x3-PT-8B"
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 NoC3x3-PT-8B, 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 r151-tall-162089151200176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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