fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r157-smll-165277001700203
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.363 51189.00 81592.00 280.10 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.r157-smll-165277001700203.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 Parking-PT-432, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001700203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.6K Apr 30 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 06:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 192K 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 1652866063988

Running Version 202205111006
[2022-05-18 09:27:46] [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-18 09:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:27:46] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2022-05-18 09:27:46] [INFO ] Transformed 529 places.
[2022-05-18 09:27:46] [INFO ] Transformed 785 transitions.
[2022-05-18 09:27:46] [INFO ] Found NUPN structural information;
[2022-05-18 09:27:46] [INFO ] Parsed PT model containing 529 places and 785 transitions in 366 ms.
Structural test allowed to assert that 201 places are NOT stable. Took 14 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 328) seen :225
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Running SMT prover for 103 properties.
// Phase 1: matrix 457 rows 529 cols
[2022-05-18 09:27:47] [INFO ] Computed 124 place invariants in 34 ms
[2022-05-18 09:27:49] [INFO ] After 1925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:103
[2022-05-18 09:27:51] [INFO ] [Nat]Absence check using 120 positive place invariants in 45 ms returned sat
[2022-05-18 09:27:51] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 09:27:55] [INFO ] After 2954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :103
[2022-05-18 09:27:55] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-18 09:27:58] [INFO ] After 3164ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :103
[2022-05-18 09:27:58] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 8 ms to minimize.
[2022-05-18 09:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-18 09:28:00] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2022-05-18 09:28:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-18 09:28:01] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2022-05-18 09:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-18 09:28:02] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2022-05-18 09:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-18 09:28:04] [INFO ] After 8587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :103
Attempting to minimize the solution found.
Minimization took 3038 ms.
[2022-05-18 09:28:07] [INFO ] After 17447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :103
Fused 103 Parikh solutions to 99 different solutions.
Parikh walk visited 39 properties in 27511 ms.
Support contains 64 out of 529 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 529 transition count 441
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 513 transition count 441
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 513 transition count 425
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 497 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 493 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 493 transition count 421
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 110 place count 474 transition count 402
Free-agglomeration rule applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 190 place count 474 transition count 322
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 270 place count 394 transition count 322
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 394 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 393 transition count 321
Reduce places removed 80 places and 0 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 3 with 187 rules applied. Total rules applied 459 place count 313 transition count 214
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 146 rules applied. Total rules applied 605 place count 206 transition count 175
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 25 rules applied. Total rules applied 630 place count 182 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 631 place count 181 transition count 174
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 631 place count 181 transition count 138
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 703 place count 145 transition count 138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 704 place count 145 transition count 137
Applied a total of 704 rules in 275 ms. Remains 145 /529 variables (removed 384) and now considering 137/457 (removed 320) transitions.
Finished structural reductions, in 1 iterations. Remains : 145/529 places, 137/457 transitions.
Finished random walk after 934 steps, including 0 resets, run visited all 64 properties in 31 ms. (steps per millisecond=30 )
Able to resolve query StableMarking after proving 329 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 49012 ms.

BK_STOP 1652866115177

--------------------
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="Parking-PT-432"
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 Parking-PT-432, 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 r157-smll-165277001700203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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