fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025000271
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldIIPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
274.231 20252.00 37015.00 66.50 TFTFTTTTTTTTTTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 29 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 167K 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 ShieldIIPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654268803722

Running Version 202205111006
[2022-06-03 15:06:44] [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 15:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:06:45] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-06-03 15:06:45] [INFO ] Transformed 703 places.
[2022-06-03 15:06:45] [INFO ] Transformed 653 transitions.
[2022-06-03 15:06:45] [INFO ] Found NUPN structural information;
[2022-06-03 15:06:45] [INFO ] Parsed PT model containing 703 places and 653 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 16) seen :9
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 TRUE 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 653 rows 703 cols
[2022-06-03 15:06:45] [INFO ] Computed 91 place invariants in 25 ms
[2022-06-03 15:06:46] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:06:46] [INFO ] [Nat]Absence check using 91 positive place invariants in 27 ms returned sat
[2022-06-03 15:06:47] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:06:47] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 5 ms to minimize.
[2022-06-03 15:06:47] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2022-06-03 15:06:47] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-06-03 15:06:47] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:06:48] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-06-03 15:06:48] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:06:48] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:06:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1020 ms
[2022-06-03 15:06:48] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2022-06-03 15:06:48] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-06-03 15:06:49] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2022-06-03 15:06:49] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2022-06-03 15:06:49] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2022-06-03 15:06:49] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-06-03 15:06:49] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:06:50] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-06-03 15:06:51] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3340 ms
[2022-06-03 15:06:51] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-06-03 15:06:52] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2022-06-03 15:06:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1465 ms
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-06-03 15:06:54] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:06:55] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-06-03 15:06:56] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 8 ms to minimize.
[2022-06-03 15:06:56] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:06:56] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:06:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2373 ms
[2022-06-03 15:06:56] [INFO ] After 9672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 674 ms.
[2022-06-03 15:06:57] [INFO ] After 10672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6536 ms.
Support contains 77 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 653/653 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 703 transition count 532
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 244 place count 582 transition count 530
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 253 place count 581 transition count 522
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 261 place count 573 transition count 522
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 261 place count 573 transition count 473
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 359 place count 524 transition count 473
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 420 place count 463 transition count 412
Iterating global reduction 4 with 61 rules applied. Total rules applied 481 place count 463 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 481 place count 463 transition count 395
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 515 place count 446 transition count 395
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 785 place count 311 transition count 260
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 825 place count 291 transition count 266
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 827 place count 291 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 829 place count 289 transition count 264
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 837 place count 289 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 838 place count 289 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 839 place count 288 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 840 place count 287 transition count 263
Applied a total of 840 rules in 173 ms. Remains 287 /703 variables (removed 416) and now considering 263/653 (removed 390) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/703 places, 263/653 transitions.
Finished random walk after 8873 steps, including 0 resets, run visited all 6 properties in 126 ms. (steps per millisecond=70 )
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18975 ms.

BK_STOP 1654268823974

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-165286025000271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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