About the Execution of LoLa+red for Philosophers-COL-000020
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.r295-tall-167873947400101.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 lolaxred
Input is Philosophers-COL-000020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947400101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11K 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 Philosophers-COL-000020-UpperBounds-00
FORMULA_NAME Philosophers-COL-000020-UpperBounds-01
FORMULA_NAME Philosophers-COL-000020-UpperBounds-02
FORMULA_NAME Philosophers-COL-000020-UpperBounds-03
FORMULA_NAME Philosophers-COL-000020-UpperBounds-04
FORMULA_NAME Philosophers-COL-000020-UpperBounds-05
FORMULA_NAME Philosophers-COL-000020-UpperBounds-06
FORMULA_NAME Philosophers-COL-000020-UpperBounds-07
FORMULA_NAME Philosophers-COL-000020-UpperBounds-08
FORMULA_NAME Philosophers-COL-000020-UpperBounds-09
FORMULA_NAME Philosophers-COL-000020-UpperBounds-10
FORMULA_NAME Philosophers-COL-000020-UpperBounds-11
FORMULA_NAME Philosophers-COL-000020-UpperBounds-12
FORMULA_NAME Philosophers-COL-000020-UpperBounds-13
FORMULA_NAME Philosophers-COL-000020-UpperBounds-14
FORMULA_NAME Philosophers-COL-000020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678782410134
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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:26:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 08:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:26:51] [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 08:26:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:26:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2023-03-14 08:26:52] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-14 08:26:52] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 08:26:52] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 08:26:52] [INFO ] Computed 2 place invariants in 3 ms
FORMULA Philosophers-COL-000020-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 08:26:52] [INFO ] Invariant cache hit.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 08:26:52] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 08:26:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 08:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-14 08:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 08:26:53] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 08:26:53] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20, 10, 20, 20, 10]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:26:53] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 22 ms.
[2023-03-14 08:26:53] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :134
FORMULA Philosophers-COL-000020-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :18
// Phase 1: matrix 100 rows 100 cols
[2023-03-14 08:26:53] [INFO ] Computed 40 place invariants in 15 ms
[2023-03-14 08:26:53] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2023-03-14 08:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:53] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-14 08:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2023-03-14 08:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-14 08:26:53] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 08:26:53] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 12 ms.
[2023-03-14 08:26:53] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2023-03-14 08:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-14 08:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2023-03-14 08:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:26:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-14 08:26:53] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-14 08:26:53] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 100/100 transitions.
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 100 transition count 60
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 100 place count 60 transition count 40
Applied a total of 100 rules in 33 ms. Remains 60 /100 variables (removed 40) and now considering 40/100 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 60/100 places, 40/100 transitions.
// Phase 1: matrix 40 rows 60 cols
[2023-03-14 08:26:53] [INFO ] Computed 40 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2527 ms. (steps per millisecond=395 ) properties (out of 2) seen :20
FORMULA Philosophers-COL-000020-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4600 ms.
ITS solved all properties within timeout
BK_STOP 1678782417369
--------------------
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="Philosophers-COL-000020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Philosophers-COL-000020, 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 r295-tall-167873947400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000020.tgz
mv Philosophers-COL-000020 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 '
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 ;