Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853200454.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-8B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.1K Apr 8 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 18:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 20:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 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 3.0M 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 NoC3x3-PT-8B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591149185988

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:53:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:53:08] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2020-06-03 01:53:08] [INFO ] Transformed 9140 places.
[2020-06-03 01:53:08] [INFO ] Transformed 14577 transitions.
[2020-06-03 01:53:08] [INFO ] Found NUPN structural information;
[2020-06-03 01:53:08] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 644 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 335 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 173 ms. (steps per millisecond=57 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
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]
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]
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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[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]
// Phase 1: matrix 14577 rows 9140 cols
[2020-06-03 01:53:10] [INFO ] Computed 99 place invariants in 471 ms
[2020-06-03 01:53:13] [INFO ] [Real]Absence check using 99 positive place invariants in 1318 ms returned sat
[2020-06-03 01:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:15] [INFO ] [Real]Absence check using state equation in 2304 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:17] [INFO ] [Real]Absence check using 99 positive place invariants in 1198 ms returned sat
[2020-06-03 01:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:20] [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 (= s98 (- t13459 t13460))") while checking expression at index 1
[2020-06-03 01:53:22] [INFO ] [Real]Absence check using 99 positive place invariants in 1436 ms returned sat
[2020-06-03 01:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:25] [INFO ] [Real]Absence check using state equation in 2616 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:27] [INFO ] [Real]Absence check using 99 positive place invariants in 1114 ms returned sat
[2020-06-03 01:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:30] [INFO ] [Real]Absence check using state equation in 2857 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:32] [INFO ] [Real]Absence check using 99 positive place invariants in 1266 ms returned sat
[2020-06-03 01:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:35] [INFO ] [Real]Absence check using state equation in 2672 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:37] [INFO ] [Real]Absence check using 99 positive place invariants in 1107 ms returned sat
[2020-06-03 01:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:40] [INFO ] [Real]Absence check using state equation in 2916 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:42] [INFO ] [Real]Absence check using 99 positive place invariants in 1149 ms returned sat
[2020-06-03 01:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:45] [INFO ] [Real]Absence check using state equation in 2902 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:47] [INFO ] [Real]Absence check using 99 positive place invariants in 1132 ms returned sat
[2020-06-03 01:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:50] [INFO ] [Real]Absence check using state equation in 2947 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:52] [INFO ] [Real]Absence check using 99 positive place invariants in 1110 ms returned sat
[2020-06-03 01:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:55] [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 (= s136 (- t13686 t14053))") while checking expression at index 8
Support contains 30 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13666 edges and 9140 vertex of which 2376 / 9140 are part of one of the 33 SCC in 51 ms
Free SCC test removed 2343 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 12333 edges and 6797 vertex of which 6684 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.49 ms
Drop transitions removed 3721 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3825 transitions.
Performed 4199 Post agglomeration using F-continuation condition.Transition count delta: 4199
Iterating post reduction 0 with 8024 rules applied. Total rules applied 8026 place count 6684 transition count 6473
Reduce places removed 4199 places and 0 transitions.
Ensure Unique test removed 2372 transitions
Reduce isomorphic transitions removed 2372 transitions.
Performed 1187 Post agglomeration using F-continuation condition.Transition count delta: 1187
Iterating post reduction 1 with 7758 rules applied. Total rules applied 15784 place count 2485 transition count 2914
Reduce places removed 1187 places and 0 transitions.
Ensure Unique test removed 1187 transitions
Reduce isomorphic transitions removed 1187 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 2400 rules applied. Total rules applied 18184 place count 1298 transition count 1701
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 18210 place count 1272 transition count 1701
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 18210 place count 1272 transition count 1657
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 18298 place count 1228 transition count 1657
Symmetric choice reduction at 4 with 356 rule applications. Total rules 18654 place count 1228 transition count 1657
Deduced a syphon composed of 356 places in 11 ms
Reduce places removed 356 places and 356 transitions.
Iterating global reduction 4 with 712 rules applied. Total rules applied 19366 place count 872 transition count 1301
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 19421 place count 872 transition count 1246
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 59 Pre rules applied. Total rules applied 19421 place count 872 transition count 1187
Deduced a syphon composed of 59 places in 8 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 19539 place count 813 transition count 1187
Symmetric choice reduction at 5 with 52 rule applications. Total rules 19591 place count 813 transition count 1187
Deduced a syphon composed of 52 places in 8 ms
Reduce places removed 52 places and 74 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 19695 place count 761 transition count 1113
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 19717 place count 761 transition count 1091
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 242
Deduced a syphon composed of 242 places in 1 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 6 with 484 rules applied. Total rules applied 20201 place count 519 transition count 849
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 20222 place count 519 transition count 828
Symmetric choice reduction at 7 with 3 rule applications. Total rules 20225 place count 519 transition count 828
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 5 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 20231 place count 516 transition count 823
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 20235 place count 514 transition count 835
Free-agglomeration rule applied 202 times.
Iterating global reduction 7 with 202 rules applied. Total rules applied 20437 place count 514 transition count 633
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 49 transitions.
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 951 edges and 312 vertex of which 305 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Iterating post reduction 7 with 252 rules applied. Total rules applied 20689 place count 305 transition count 584
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 20696 place count 305 transition count 577
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 20715 place count 305 transition count 577
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 20719 place count 305 transition count 577
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 20723 place count 305 transition count 573
Drop transitions removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 10 with 117 rules applied. Total rules applied 20840 place count 305 transition count 456
Reduce places removed 3 places and 0 transitions.
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 835 edges and 302 vertex of which 289 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Iterating post reduction 10 with 4 rules applied. Total rules applied 20844 place count 289 transition count 456
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 20857 place count 289 transition count 443
Symmetric choice reduction at 12 with 4 rule applications. Total rules 20861 place count 289 transition count 443
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 6 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 20869 place count 285 transition count 437
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 20871 place count 285 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 20873 place count 283 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 20874 place count 283 transition count 435
Applied a total of 20874 rules in 2258 ms. Remains 283 /9140 variables (removed 8857) and now considering 435/14577 (removed 14142) transitions.
Finished structural reductions, in 1 iterations. Remains : 283/9140 places, 435/14577 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties seen :[0, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 01:54:02] [INFO ] Flow matrix only has 394 transitions (discarded 41 similar events)
// Phase 1: matrix 394 rows 283 cols
[2020-06-03 01:54:03] [INFO ] Computed 63 place invariants in 10 ms
[2020-06-03 01:54:03] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2020-06-03 01:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:03] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-03 01:54:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:03] [INFO ] [Nat]Absence check using 63 positive place invariants in 46 ms returned sat
[2020-06-03 01:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:04] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 01:54:04] [INFO ] State equation strengthened by 195 read => feed constraints.
[2020-06-03 01:54:04] [INFO ] [Nat]Added 195 Read/Feed constraints in 72 ms returned sat
[2020-06-03 01:54:04] [INFO ] Computed and/alt/rep : 432/2249/391 causal constraints in 25 ms.
[2020-06-03 01:54:06] [INFO ] Added : 359 causal constraints over 72 iterations in 2599 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
Finished Parikh walk after 530 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=58 )
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityCardinality"
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 NoC3x3-PT-8B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853200454"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;