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.r222-tall-165286025200463.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 ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025200463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.1K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 30 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 349K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654272587748

Running Version 202205111006
[2022-06-03 16:09:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2022-06-03 16:09:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:09:49] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2022-06-03 16:09:49] [INFO ] Transformed 1363 places.
[2022-06-03 16:09:49] [INFO ] Transformed 1263 transitions.
[2022-06-03 16:09:49] [INFO ] Found NUPN structural information;
[2022-06-03 16:09:49] [INFO ] Parsed PT model containing 1363 places and 1263 transitions in 304 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 16) seen :12
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2022-06-03 16:09:50] [INFO ] Computed 221 place invariants in 51 ms
[2022-06-03 16:09:50] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 16:09:51] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2022-06-03 16:09:52] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 16:09:53] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 6 ms to minimize.
[2022-06-03 16:09:53] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 2 ms to minimize.
[2022-06-03 16:09:53] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2022-06-03 16:09:54] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 2 ms to minimize.
[2022-06-03 16:09:54] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 1 ms to minimize.
[2022-06-03 16:09:54] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 2 ms to minimize.
[2022-06-03 16:09:55] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 1 ms to minimize.
[2022-06-03 16:09:55] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2022-06-03 16:09:55] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2022-06-03 16:09:56] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2022-06-03 16:09:56] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 1 ms to minimize.
[2022-06-03 16:09:56] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2022-06-03 16:09:57] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2022-06-03 16:09:57] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2022-06-03 16:09:57] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 1 ms to minimize.
[2022-06-03 16:09:58] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 1 ms to minimize.
[2022-06-03 16:09:58] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 1 ms to minimize.
[2022-06-03 16:09:58] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2022-06-03 16:09:58] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2022-06-03 16:09:59] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 0 ms to minimize.
[2022-06-03 16:09:59] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2022-06-03 16:09:59] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2022-06-03 16:09:59] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 0 ms to minimize.
[2022-06-03 16:10:00] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2022-06-03 16:10:00] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2022-06-03 16:10:00] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2022-06-03 16:10:00] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 0 ms to minimize.
[2022-06-03 16:10:01] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 0 ms to minimize.
[2022-06-03 16:10:01] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8259 ms
[2022-06-03 16:10:01] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 1 ms to minimize.
[2022-06-03 16:10:02] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 1 ms to minimize.
[2022-06-03 16:10:03] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 1 ms to minimize.
[2022-06-03 16:10:03] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 1 ms to minimize.
[2022-06-03 16:10:03] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 1 ms to minimize.
[2022-06-03 16:10:04] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2022-06-03 16:10:04] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 1 ms to minimize.
[2022-06-03 16:10:05] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2022-06-03 16:10:05] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 0 ms to minimize.
[2022-06-03 16:10:05] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2022-06-03 16:10:06] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 0 ms to minimize.
[2022-06-03 16:10:06] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2022-06-03 16:10:06] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2022-06-03 16:10:07] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 0 ms to minimize.
[2022-06-03 16:10:07] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 2 ms to minimize.
[2022-06-03 16:10:07] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 1 ms to minimize.
[2022-06-03 16:10:08] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2022-06-03 16:10:08] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 0 ms to minimize.
[2022-06-03 16:10:08] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2022-06-03 16:10:08] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2022-06-03 16:10:09] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 0 ms to minimize.
[2022-06-03 16:10:09] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2022-06-03 16:10:09] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 1 ms to minimize.
[2022-06-03 16:10:10] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 1 ms to minimize.
[2022-06-03 16:10:10] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2022-06-03 16:10:10] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 1 ms to minimize.
[2022-06-03 16:10:10] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2022-06-03 16:10:11] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2022-06-03 16:10:11] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 1 ms to minimize.
[2022-06-03 16:10:11] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 0 ms to minimize.
[2022-06-03 16:10:12] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 1 ms to minimize.
[2022-06-03 16:10:12] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2022-06-03 16:10:12] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2022-06-03 16:10:12] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 0 ms to minimize.
[2022-06-03 16:10:13] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2022-06-03 16:10:13] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:10:13] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2022-06-03 16:10:13] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2022-06-03 16:10:14] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 2 ms to minimize.
[2022-06-03 16:10:14] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12603 ms
[2022-06-03 16:10:14] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 3 ms to minimize.
[2022-06-03 16:10:15] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 1 ms to minimize.
[2022-06-03 16:10:15] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2022-06-03 16:10:15] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 1 ms to minimize.
[2022-06-03 16:10:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:10:15] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 7900 ms.
Support contains 113 out of 1363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1363 transition count 1142
Reduce places removed 121 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 127 rules applied. Total rules applied 248 place count 1242 transition count 1136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 254 place count 1236 transition count 1136
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 254 place count 1236 transition count 1039
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 448 place count 1139 transition count 1039
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 573 place count 1014 transition count 914
Iterating global reduction 3 with 125 rules applied. Total rules applied 698 place count 1014 transition count 914
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 698 place count 1014 transition count 876
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 774 place count 976 transition count 876
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 243
Deduced a syphon composed of 243 places in 2 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1260 place count 733 transition count 633
Partial Free-agglomeration rule applied 147 times.
Drop transitions removed 147 transitions
Iterating global reduction 3 with 147 rules applied. Total rules applied 1407 place count 733 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1408 place count 732 transition count 632
Applied a total of 1408 rules in 426 ms. Remains 732 /1363 variables (removed 631) and now considering 632/1263 (removed 631) transitions.
Finished structural reductions, in 1 iterations. Remains : 732/1363 places, 632/1263 transitions.
Incomplete random walk after 1000000 steps, including 366 resets, run finished after 8888 ms. (steps per millisecond=112 ) properties (out of 4) seen :3
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 41141 steps, including 1 resets, run visited all 1 properties in 172 ms. (steps per millisecond=239 )
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 44250 ms.

BK_STOP 1654272633255

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -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 3600 -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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPs-PT-020B, 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 r222-tall-165286025200463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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