Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r229-tall-165286033700068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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 itstools
Input is ShieldIIPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286033700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.7K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 332K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1653032319691

Running Version 202205111006
[2022-05-20 07:38:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-20 07:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:38:41] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2022-05-20 07:38:41] [INFO ] Transformed 1203 places.
[2022-05-20 07:38:41] [INFO ] Transformed 1183 transitions.
[2022-05-20 07:38:41] [INFO ] Found NUPN structural information;
[2022-05-20 07:38:41] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 277 ms.
Structural test allowed to assert that 542 places are NOT stable. Took 20 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 661) seen :640
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2022-05-20 07:38:42] [INFO ] Computed 181 place invariants in 24 ms
[2022-05-20 07:38:42] [INFO ] After 844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-20 07:38:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 52 ms returned sat
[2022-05-20 07:38:46] [INFO ] After 2606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-20 07:38:46] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 6 ms to minimize.
[2022-05-20 07:38:47] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2022-05-20 07:38:47] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2022-05-20 07:38:47] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 2 ms to minimize.
[2022-05-20 07:38:48] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2022-05-20 07:38:48] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 1 ms to minimize.
[2022-05-20 07:38:48] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2022-05-20 07:38:48] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 0 ms to minimize.
[2022-05-20 07:38:49] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2022-05-20 07:38:49] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2022-05-20 07:38:49] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2022-05-20 07:38:49] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-05-20 07:38:49] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 2 ms to minimize.
[2022-05-20 07:38:50] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2022-05-20 07:38:50] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2022-05-20 07:38:50] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 1 ms to minimize.
[2022-05-20 07:38:50] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 1 ms to minimize.
[2022-05-20 07:38:50] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2022-05-20 07:38:51] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2022-05-20 07:38:51] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 2 ms to minimize.
[2022-05-20 07:38:51] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 2 ms to minimize.
[2022-05-20 07:38:52] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2022-05-20 07:38:52] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 0 ms to minimize.
[2022-05-20 07:38:52] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
[2022-05-20 07:38:53] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2022-05-20 07:38:53] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2022-05-20 07:38:53] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 1 ms to minimize.
[2022-05-20 07:38:53] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 0 ms to minimize.
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 5 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 2 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 1 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Trap strengthening (SAT) tested/added 73/72 trap constraints in 16986 ms
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 888 ms
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 1 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 1 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 0 ms to minimize.
[2022-05-20 07:39:08] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 0 ms to minimize.
[2022-05-20 07:39:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:39:08] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Parikh walk visited 1 properties in 6789 ms.
Support contains 20 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1203 transition count 1082
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1102 transition count 1082
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 1102 transition count 981
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 1001 transition count 981
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 527 place count 878 transition count 858
Iterating global reduction 2 with 123 rules applied. Total rules applied 650 place count 878 transition count 858
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 650 place count 878 transition count 798
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 770 place count 818 transition count 798
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 4 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 2 with 594 rules applied. Total rules applied 1364 place count 521 transition count 501
Partial Free-agglomeration rule applied 138 times.
Drop transitions removed 138 transitions
Iterating global reduction 2 with 138 rules applied. Total rules applied 1502 place count 521 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1503 place count 520 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1504 place count 519 transition count 500
Applied a total of 1504 rules in 453 ms. Remains 519 /1203 variables (removed 684) and now considering 500/1183 (removed 683) transitions.
Finished structural reductions, in 1 iterations. Remains : 519/1203 places, 500/1183 transitions.
Finished random walk after 1565 steps, including 0 resets, run visited all 20 properties in 40 ms. (steps per millisecond=39 )
Able to resolve query StableMarking after proving 662 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 34487 ms.

BK_STOP 1653032355368

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is ShieldIIPs-PT-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-165286033700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;