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

About the Execution of ITS-Tools for ShieldRVt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
392.880 40674.00 69288.00 228.40 F 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.r229-tall-165286034600618.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 ShieldRVt-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-165286034600618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 239K 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 1653038426723

Running Version 202205111006
[2022-05-20 09:20:27] [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 09:20:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:20:28] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2022-05-20 09:20:28] [INFO ] Transformed 1003 places.
[2022-05-20 09:20:28] [INFO ] Transformed 1003 transitions.
[2022-05-20 09:20:28] [INFO ] Found NUPN structural information;
[2022-05-20 09:20:28] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 229 ms.
Structural test allowed to assert that 401 places are NOT stable. Took 12 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 602) seen :529
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) 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 73) 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 73) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) 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 73) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 73) 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 73) 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 73) seen :0
Running SMT prover for 73 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2022-05-20 09:20:29] [INFO ] Computed 81 place invariants in 33 ms
[2022-05-20 09:20:30] [INFO ] After 1724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:73
[2022-05-20 09:20:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 27 ms returned sat
[2022-05-20 09:20:36] [INFO ] After 2939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :73
[2022-05-20 09:20:36] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 9 ms to minimize.
[2022-05-20 09:20:36] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 3 ms to minimize.
[2022-05-20 09:20:36] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2022-05-20 09:20:37] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 2 ms to minimize.
[2022-05-20 09:20:37] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2022-05-20 09:20:37] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2022-05-20 09:20:37] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-05-20 09:20:37] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 0 ms to minimize.
[2022-05-20 09:20:39] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2022-05-20 09:20:40] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2022-05-20 09:20:40] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:20:40] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4019 ms
[2022-05-20 09:20:41] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2022-05-20 09:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-20 09:20:44] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2022-05-20 09:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-20 09:20:45] [INFO ] After 11966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :73
Attempting to minimize the solution found.
Minimization took 3606 ms.
[2022-05-20 09:20:48] [INFO ] After 17932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :73
Fused 73 Parikh solutions to 65 different solutions.
Parikh walk visited 0 properties in 18072 ms.
Support contains 73 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 1003 transition count 710
Reduce places removed 293 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 295 rules applied. Total rules applied 588 place count 710 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 589 place count 709 transition count 708
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 589 place count 709 transition count 631
Deduced a syphon composed of 77 places in 6 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 743 place count 632 transition count 631
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 857 place count 518 transition count 517
Iterating global reduction 3 with 114 rules applied. Total rules applied 971 place count 518 transition count 517
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 971 place count 518 transition count 473
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1059 place count 474 transition count 473
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 2 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 3 with 368 rules applied. Total rules applied 1427 place count 290 transition count 289
Renaming transitions due to excessive name length > 1024 char.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1511 place count 248 transition count 324
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1512 place count 248 transition count 323
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1528 place count 248 transition count 307
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1544 place count 232 transition count 307
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1550 place count 232 transition count 301
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1554 place count 232 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1555 place count 231 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1556 place count 230 transition count 300
Applied a total of 1556 rules in 203 ms. Remains 230 /1003 variables (removed 773) and now considering 300/1003 (removed 703) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/1003 places, 300/1003 transitions.
Finished random walk after 6706 steps, including 3 resets, run visited all 73 properties in 158 ms. (steps per millisecond=42 )
Able to resolve query StableMarking after proving 603 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 39528 ms.

BK_STOP 1653038467397

--------------------
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="ShieldRVt-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 ShieldRVt-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-165286034600618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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