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.r197-smll-167840343800141.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 GPUForwardProgress-PT-36b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343800141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 179K Mar 5 18:22 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 GPUForwardProgress-PT-36b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678491560728

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=GPUForwardProgress-PT-36b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 23:39:23] [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-10 23:39:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:39:23] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-10 23:39:23] [INFO ] Transformed 720 places.
[2023-03-10 23:39:23] [INFO ] Transformed 757 transitions.
[2023-03-10 23:39:23] [INFO ] Found NUPN structural information;
[2023-03-10 23:39:23] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 757 rows 720 cols
[2023-03-10 23:39:23] [INFO ] Computed 38 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :12
FORMULA GPUForwardProgress-PT-36b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
[2023-03-10 23:39:24] [INFO ] Invariant cache hit.
[2023-03-10 23:39:24] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 40 ms returned sat
[2023-03-10 23:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:25] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-10 23:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:25] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 44 ms returned sat
[2023-03-10 23:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:25] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-10 23:39:25] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 76 ms.
[2023-03-10 23:39:27] [INFO ] Added : 157 causal constraints over 32 iterations in 1935 ms. Result :sat
Minimization took 148 ms.
[2023-03-10 23:39:28] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 36 ms returned sat
[2023-03-10 23:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:28] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-10 23:39:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:28] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 30 ms returned sat
[2023-03-10 23:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:29] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-10 23:39:29] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 60 ms.
[2023-03-10 23:39:30] [INFO ] Added : 185 causal constraints over 37 iterations in 1781 ms. Result :sat
Minimization took 120 ms.
[2023-03-10 23:39:31] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 33 ms returned sat
[2023-03-10 23:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:31] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-10 23:39:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:31] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 34 ms returned sat
[2023-03-10 23:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:32] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-10 23:39:32] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 58 ms.
[2023-03-10 23:39:33] [INFO ] Added : 140 causal constraints over 28 iterations in 1432 ms. Result :sat
Minimization took 136 ms.
[2023-03-10 23:39:34] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 33 ms returned sat
[2023-03-10 23:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:34] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-10 23:39:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:34] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 34 ms returned sat
[2023-03-10 23:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:35] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2023-03-10 23:39:35] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 78 ms.
[2023-03-10 23:39:37] [INFO ] Added : 205 causal constraints over 41 iterations in 2269 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-36b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 757/757 transitions.
Graph (trivial) has 641 edges and 720 vertex of which 7 / 720 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1084 edges and 714 vertex of which 673 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 ms
Discarding 41 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 408 rules applied. Total rules applied 410 place count 673 transition count 338
Reduce places removed 406 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 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 442 rules applied. Total rules applied 852 place count 267 transition count 302
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 855 place count 266 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 858 place count 264 transition count 299
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 858 place count 264 transition count 229
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 998 place count 194 transition count 229
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 1036 place count 156 transition count 191
Iterating global reduction 4 with 38 rules applied. Total rules applied 1074 place count 156 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1074 place count 156 transition count 189
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1078 place count 154 transition count 189
Graph (complete) has 296 edges and 154 vertex of which 41 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.1 ms
Discarding 113 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 21 rules applied. Total rules applied 1099 place count 41 transition count 57
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 57 rules applied. Total rules applied 1156 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1157 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1157 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1159 place count 19 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1160 place count 18 transition count 18
Iterating global reduction 7 with 1 rules applied. Total rules applied 1161 place count 18 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1176 place count 10 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1178 place count 10 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1179 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1180 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 1180 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1184 place count 6 transition count 6
Applied a total of 1184 rules in 172 ms. Remains 6 /720 variables (removed 714) and now considering 6/757 (removed 751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 6/720 places, 6/757 transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-10 23:39:37] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 3) seen :3
FORMULA GPUForwardProgress-PT-36b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15046 ms.

BK_STOP 1678491579611

--------------------
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="GPUForwardProgress-PT-36b"
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 GPUForwardProgress-PT-36b, 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 r197-smll-167840343800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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