fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945600597
Last Updated
May 14, 2023

About the Execution of ITS-Tools for PolyORBLF-PT-S06J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
488.067 25491.00 36049.00 253.40 4 1 1 2 1 1 1 1 1 1 4 1 1 1 4 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945600597.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-PT-S06J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945600597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 24K Feb 26 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Feb 26 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 26 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 26 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Feb 26 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 262K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678909721880

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 19:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 19:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:48:43] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2023-03-15 19:48:43] [INFO ] Transformed 632 places.
[2023-03-15 19:48:43] [INFO ] Transformed 10500 transitions.
[2023-03-15 19:48:44] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 729 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Normalized transition count is 2394 out of 2430 initially.
// Phase 1: matrix 2394 rows 632 cols
[2023-03-15 19:48:44] [INFO ] Computed 54 place invariants in 154 ms
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 15) seen :23
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :16
[2023-03-15 19:48:44] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2023-03-15 19:48:45] [INFO ] Computed 54 place invariants in 82 ms
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 32 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 27 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 16 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 23 ms returned unsat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:45] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 14 ms returned unsat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 28 ms returned unsat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 29 ms returned unsat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 29 ms returned unsat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 19:48:46] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 30 ms returned sat
[2023-03-15 19:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:48:51] [INFO ] [Real]Absence check using state equation in 4762 ms returned sat
[2023-03-15 19:48:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:48:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:51] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 38 ms returned sat
[2023-03-15 19:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:48:56] [INFO ] [Nat]Absence check using state equation in 4893 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, -1] Max seen :[4, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 3]
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 400 place count 429 transition count 2233
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 412 place count 429 transition count 2221
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 424 place count 417 transition count 2221
Applied a total of 424 rules in 391 ms. Remains 417 /632 variables (removed 215) and now considering 2221/2430 (removed 209) transitions.
[2023-03-15 19:48:56] [INFO ] Flow matrix only has 2185 transitions (discarded 36 similar events)
// Phase 1: matrix 2185 rows 417 cols
[2023-03-15 19:48:56] [INFO ] Computed 48 place invariants in 37 ms
[2023-03-15 19:48:57] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 417/632 places, 1303/2430 transitions.
Applied a total of 0 rules in 37 ms. Remains 417 /417 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 417/632 places, 1303/2430 transitions.
Normalized transition count is 1267 out of 1303 initially.
// Phase 1: matrix 1267 rows 417 cols
[2023-03-15 19:48:57] [INFO ] Computed 48 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 11440 resets, run finished after 6237 ms. (steps per millisecond=160 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 3616 resets, run finished after 2263 ms. (steps per millisecond=441 ) properties (out of 1) seen :4
[2023-03-15 19:49:06] [INFO ] Flow matrix only has 1267 transitions (discarded 36 similar events)
// Phase 1: matrix 1267 rows 417 cols
[2023-03-15 19:49:06] [INFO ] Computed 48 place invariants in 30 ms
[2023-03-15 19:49:06] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 19:49:06] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23241 ms.

BK_STOP 1678909747371

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945600597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;