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.r265-smll-167863539600149.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 ltsminxred
Input is NeoElection-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539600149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 11K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 17:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 26 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 98K 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 NeoElection-COL-6-UpperBounds-00
FORMULA_NAME NeoElection-COL-6-UpperBounds-01
FORMULA_NAME NeoElection-COL-6-UpperBounds-02
FORMULA_NAME NeoElection-COL-6-UpperBounds-03
FORMULA_NAME NeoElection-COL-6-UpperBounds-04
FORMULA_NAME NeoElection-COL-6-UpperBounds-05
FORMULA_NAME NeoElection-COL-6-UpperBounds-06
FORMULA_NAME NeoElection-COL-6-UpperBounds-07
FORMULA_NAME NeoElection-COL-6-UpperBounds-08
FORMULA_NAME NeoElection-COL-6-UpperBounds-09
FORMULA_NAME NeoElection-COL-6-UpperBounds-10
FORMULA_NAME NeoElection-COL-6-UpperBounds-11
FORMULA_NAME NeoElection-COL-6-UpperBounds-12
FORMULA_NAME NeoElection-COL-6-UpperBounds-13
FORMULA_NAME NeoElection-COL-6-UpperBounds-14
FORMULA_NAME NeoElection-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678790731592

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 10:45:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 10:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:45:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 10:45:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 10:45:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 848 ms
[2023-03-14 10:45:35] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2023-03-14 10:45:35] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-14 10:45:35] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 122 ms.
[2023-03-14 10:45:35] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-14 10:45:35] [INFO ] Computed 1 place invariants in 3 ms
FORMULA NeoElection-COL-6-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-08 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-01 30 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 10:45:35] [INFO ] Invariant cache hit.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-14 10:45:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 10:45:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-14 10:45:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-14 10:45:35] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 10:45:35] [INFO ] Added : 6 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 10:45:35] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:45:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:45:35] [INFO ] Added : 5 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:45:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:45:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-14 10:45:35] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 10:45:35] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, -1]
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-14 10:45:36] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 198 ms.
[2023-03-14 10:45:36] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Deduced a syphon composed of 4507 places in 24 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :48
FORMULA NeoElection-COL-6-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeoElection-COL-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeoElection-COL-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :30
[2023-03-14 10:45:36] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
// Phase 1: matrix 369 rows 280 cols
[2023-03-14 10:45:36] [INFO ] Computed 77 place invariants in 24 ms
[2023-03-14 10:45:36] [INFO ] [Real]Absence check using 47 positive place invariants in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : [30] Max seen :[30]
FORMULA NeoElection-COL-6-UpperBounds-11 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2441 ms.
ITS solved all properties within timeout

BK_STOP 1678790737605

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="NeoElection-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NeoElection-COL-6, 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 r265-smll-167863539600149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-6.tgz
mv NeoElection-COL-6 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 ;