Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477300311.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
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 r211-tajo-159033477300311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.5K May 14 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 167K May 12 20:42 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 1591298877883

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:27:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:27:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:27:59] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-06-04 19:27:59] [INFO ] Transformed 703 places.
[2020-06-04 19:27:59] [INFO ] Transformed 653 transitions.
[2020-06-04 19:27:59] [INFO ] Found NUPN structural information;
[2020-06-04 19:27:59] [INFO ] Parsed PT model containing 703 places and 653 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 653 rows 703 cols
[2020-06-04 19:28:00] [INFO ] Computed 91 place invariants in 25 ms
[2020-06-04 19:28:00] [INFO ] [Real]Absence check using 91 positive place invariants in 71 ms returned sat
[2020-06-04 19:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:01] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2020-06-04 19:28:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 75 ms returned sat
[2020-06-04 19:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:02] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2020-06-04 19:28:02] [INFO ] Deduced a trap composed of 21 places in 263 ms
[2020-06-04 19:28:03] [INFO ] Deduced a trap composed of 19 places in 267 ms
[2020-06-04 19:28:03] [INFO ] Deduced a trap composed of 29 places in 298 ms
[2020-06-04 19:28:03] [INFO ] Deduced a trap composed of 31 places in 306 ms
[2020-06-04 19:28:04] [INFO ] Deduced a trap composed of 23 places in 189 ms
[2020-06-04 19:28:04] [INFO ] Deduced a trap composed of 22 places in 221 ms
[2020-06-04 19:28:04] [INFO ] Deduced a trap composed of 21 places in 217 ms
[2020-06-04 19:28:04] [INFO ] Deduced a trap composed of 23 places in 237 ms
[2020-06-04 19:28:05] [INFO ] Deduced a trap composed of 23 places in 240 ms
[2020-06-04 19:28:05] [INFO ] Deduced a trap composed of 34 places in 241 ms
[2020-06-04 19:28:05] [INFO ] Deduced a trap composed of 25 places in 202 ms
[2020-06-04 19:28:05] [INFO ] Deduced a trap composed of 25 places in 308 ms
[2020-06-04 19:28:08] [INFO ] Deduced a trap composed of 25 places in 2072 ms
[2020-06-04 19:28:08] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s220 s221 s222 s223 s224 s225 s226 s227 s228 s279 s280 s281 s282 s283 s284 s285 s286 s287) 0)") while checking expression at index 0
[2020-06-04 19:28:08] [INFO ] [Real]Absence check using 91 positive place invariants in 417 ms returned sat
[2020-06-04 19:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:09] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2020-06-04 19:28:10] [INFO ] Deduced a trap composed of 20 places in 842 ms
[2020-06-04 19:28:10] [INFO ] Deduced a trap composed of 15 places in 521 ms
[2020-06-04 19:28:11] [INFO ] Deduced a trap composed of 25 places in 183 ms
[2020-06-04 19:28:11] [INFO ] Deduced a trap composed of 20 places in 124 ms
[2020-06-04 19:28:11] [INFO ] Deduced a trap composed of 20 places in 280 ms
[2020-06-04 19:28:11] [INFO ] Deduced a trap composed of 22 places in 111 ms
[2020-06-04 19:28:12] [INFO ] Deduced a trap composed of 27 places in 222 ms
[2020-06-04 19:28:12] [INFO ] Deduced a trap composed of 20 places in 220 ms
[2020-06-04 19:28:12] [INFO ] Deduced a trap composed of 20 places in 215 ms
[2020-06-04 19:28:12] [INFO ] Deduced a trap composed of 20 places in 176 ms
[2020-06-04 19:28:12] [INFO ] Deduced a trap composed of 21 places in 201 ms
[2020-06-04 19:28:13] [INFO ] Deduced a trap composed of 26 places in 181 ms
[2020-06-04 19:28:13] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s82 s83 s100 s101 s102 s129 s130 s131 s132 s133 s134 s135 s136 s137 s140 s149 s150) 0)") while checking expression at index 1
[2020-06-04 19:28:13] [INFO ] [Real]Absence check using 91 positive place invariants in 70 ms returned sat
[2020-06-04 19:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:14] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2020-06-04 19:28:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:14] [INFO ] [Nat]Absence check using 91 positive place invariants in 86 ms returned sat
[2020-06-04 19:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:15] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2020-06-04 19:28:16] [INFO ] Deduced a trap composed of 22 places in 767 ms
[2020-06-04 19:28:16] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-06-04 19:28:17] [INFO ] Deduced a trap composed of 26 places in 379 ms
[2020-06-04 19:28:17] [INFO ] Deduced a trap composed of 24 places in 164 ms
[2020-06-04 19:28:17] [INFO ] Deduced a trap composed of 23 places in 252 ms
[2020-06-04 19:28:17] [INFO ] Deduced a trap composed of 20 places in 234 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 37 places in 234 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 18 places in 164 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-04 19:28:18] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-06-04 19:28:19] [INFO ] Deduced a trap composed of 19 places in 214 ms
[2020-06-04 19:28:19] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2020-06-04 19:28:20] [INFO ] Deduced a trap composed of 19 places in 650 ms
[2020-06-04 19:28: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 (> (+ s0 s1 s2 s496 s497 s498 s499 s500 s501 s517 s612 s613 s614 s615 s616 s617 s618 s619 s620) 0)") while checking expression at index 2
[2020-06-04 19:28:20] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned unsat
[2020-06-04 19:28:20] [INFO ] [Real]Absence check using 91 positive place invariants in 90 ms returned sat
[2020-06-04 19:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:21] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2020-06-04 19:28:22] [INFO ] Deduced a trap composed of 26 places in 422 ms
[2020-06-04 19:28:22] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-06-04 19:28:22] [INFO ] Deduced a trap composed of 23 places in 221 ms
[2020-06-04 19:28:22] [INFO ] Deduced a trap composed of 26 places in 231 ms
[2020-06-04 19:28:23] [INFO ] Deduced a trap composed of 26 places in 224 ms
[2020-06-04 19:28:23] [INFO ] Deduced a trap composed of 28 places in 195 ms
[2020-06-04 19:28:23] [INFO ] Deduced a trap composed of 38 places in 223 ms
[2020-06-04 19:28:23] [INFO ] Deduced a trap composed of 20 places in 206 ms
[2020-06-04 19:28:24] [INFO ] Deduced a trap composed of 28 places in 216 ms
[2020-06-04 19:28:24] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2020-06-04 19:28:24] [INFO ] Deduced a trap composed of 20 places in 256 ms
[2020-06-04 19:28:25] [INFO ] Deduced a trap composed of 21 places in 214 ms
[2020-06-04 19:28:25] [INFO ] Deduced a trap composed of 21 places in 195 ms
[2020-06-04 19:28:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 19:28:25] [INFO ] Deduced a trap composed of 19 places in 395 ms
[2020-06-04 19:28:25] [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 (> (+ s0 s1 s2 s496 s497 s498 s499 s500 s501 s517 s612 s613 s614 s615 s616 s617 s618 s619 s620) 0)") while checking expression at index 4
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 31 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 703 transition count 497
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 547 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 546 transition count 495
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 315 place count 546 transition count 452
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 401 place count 503 transition count 452
Symmetric choice reduction at 3 with 68 rule applications. Total rules 469 place count 503 transition count 452
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 68 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 605 place count 435 transition count 384
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 605 place count 435 transition count 358
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 657 place count 409 transition count 358
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 959 place count 258 transition count 207
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1009 place count 233 transition count 220
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1010 place count 233 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1011 place count 233 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1012 place count 232 transition count 218
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1022 place count 232 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1023 place count 232 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1024 place count 231 transition count 217
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1026 place count 229 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1026 place count 229 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1028 place count 228 transition count 216
Applied a total of 1028 rules in 197 ms. Remains 228 /703 variables (removed 475) and now considering 216/653 (removed 437) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/703 places, 216/653 transitions.
Incomplete random walk after 1000000 steps, including 1 resets, run finished after 2594 ms. (steps per millisecond=385 ) properties seen :[1, 1, 0, 1]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 562127 steps, including 0 resets, run visited all 1 properties in 1035 ms. (steps per millisecond=543 )
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 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 r211-tajo-159033477300311"
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 ;