Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 362K May 18 16:43 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 NoC3x3-PT-1B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716691798166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-26 02:49:59] [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]
[2024-05-26 02:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:49:59] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-26 02:49:59] [INFO ] Transformed 1416 places.
[2024-05-26 02:49:59] [INFO ] Transformed 1640 transitions.
[2024-05-26 02:49:59] [INFO ] Found NUPN structural information;
[2024-05-26 02:49:59] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1640 rows 1416 cols
[2024-05-26 02:49:59] [INFO ] Computed 40 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (8 resets) in 49 ms. (200 steps per ms)
FORMULA NoC3x3-PT-1B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 32 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-26 02:49:59] [INFO ] Invariant cache hit.
[2024-05-26 02:50:00] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-26 02:50:00] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-05-26 02:50:01] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 30 ms to minimize.
[2024-05-26 02:50:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-26 02:50:01] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2024-05-26 02:50:02] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-26 02:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-26 02:50:02] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 94 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-26 02:50:06] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2024-05-26 02:50:06] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-26 02:50:07] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 4 ms to minimize.
[2024-05-26 02:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-26 02:50:07] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-05-26 02:50:08] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-26 02:50:08] [INFO ] Deduced a trap composed of 121 places in 103 ms of which 3 ms to minimize.
[2024-05-26 02:50:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2024-05-26 02:50:08] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-26 02:50:12] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2024-05-26 02:50:12] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-26 02:50:13] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 5 ms to minimize.
[2024-05-26 02:50:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-26 02:50:13] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2024-05-26 02:50:14] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 4 ms to minimize.
[2024-05-26 02:50:14] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-26 02:50:14] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-26 02:50:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 626 ms
[2024-05-26 02:50:14] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 78 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1438 edges and 1416 vertex of which 916 / 1416 are part of one of the 20 SCC in 11 ms
Free SCC test removed 896 places
Drop transitions (Empty/Sink Transition effects.) removed 1084 transitions
Reduce isomorphic transitions removed 1084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 520 transition count 536
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 500 transition count 536
Discarding 166 places :
Symmetric choice reduction at 2 with 166 rule applications. Total rules 207 place count 334 transition count 370
Iterating global reduction 2 with 166 rules applied. Total rules applied 373 place count 334 transition count 370
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 373 place count 334 transition count 334
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 445 place count 298 transition count 334
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 472 place count 271 transition count 294
Iterating global reduction 2 with 27 rules applied. Total rules applied 499 place count 271 transition count 294
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 617 place count 212 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 211 transition count 249
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 621 place count 211 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 627 place count 211 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 629 place count 210 transition count 252
Free-agglomeration rule applied 103 times.
Iterating global reduction 3 with 103 rules applied. Total rules applied 732 place count 210 transition count 149
Reduce places removed 103 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 295 edges and 107 vertex of which 29 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 places :
Also discarding 75 output transitions
Drop transitions (Output transitions of discarded places.) removed 75 transitions
Iterating post reduction 3 with 123 rules applied. Total rules applied 855 place count 29 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 884 place count 29 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 885 place count 28 transition count 25
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 15 edges and 21 vertex of which 12 / 21 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 5 with 8 rules applied. Total rules applied 893 place count 12 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 908 place count 12 transition count 10
Applied a total of 908 rules in 179 ms. Remains 12 /1416 variables (removed 1404) and now considering 10/1640 (removed 1630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 12/1416 places, 10/1640 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-26 02:50:18] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 570 ms. (1751 steps per ms)
FORMULA NoC3x3-PT-1B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 233 ms. (4273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-26 02:50:19] [INFO ] Flatten gal took : 17 ms
[2024-05-26 02:50:19] [INFO ] Flatten gal took : 2 ms
[2024-05-26 02:50:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5329423781989378866.gal : 3 ms
[2024-05-26 02:50:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality531636311888822987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5329423781989378866.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality531636311888822987.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality531636311888822987.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4,0.008418,3416,2,17,5,56,6,0,61,27,0
Total reachable state count : 4

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20219 ms.

BK_STOP 1716691819537

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="NoC3x3-PT-1B"
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-5568"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1B, 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 r246-tall-171654351900565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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