About the Execution of Marcie+red for Diffusion2D-PT-D20N150
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.r138-smll-167819419800181.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 marciexred
Input is Diffusion2D-PT-D20N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419800181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.2K Feb 26 04:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 04:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 04:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Diffusion2D-PT-D20N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678620592132
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N150
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 11:29:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 11:29:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:29:55] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2023-03-12 11:29:55] [INFO ] Transformed 400 places.
[2023-03-12 11:29:55] [INFO ] Transformed 2964 transitions.
[2023-03-12 11:29:55] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 644 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-12 11:29:56] [INFO ] Computed 1 place invariants in 121 ms
Incomplete random walk after 10119 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=459 ) properties (out of 16) seen :450
FORMULA Diffusion2D-PT-D20N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
[2023-03-12 11:29:56] [INFO ] Invariant cache hit.
[2023-03-12 11:29:56] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 11:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:57] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2023-03-12 11:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:29:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-12 11:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:59] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2023-03-12 11:29:59] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 401 ms.
Minimization took 280 ms.
[2023-03-12 11:30:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:01] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2023-03-12 11:30:01] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 254 ms.
Minimization took 321 ms.
[2023-03-12 11:30:02] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:02] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2023-03-12 11:30:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:03] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2023-03-12 11:30:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 223 ms.
Minimization took 305 ms.
[2023-03-12 11:30:04] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:05] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2023-03-12 11:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:06] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2023-03-12 11:30:06] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 219 ms.
Minimization took 329 ms.
[2023-03-12 11:30:07] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:07] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2023-03-12 11:30:08] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 203 ms.
Minimization took 335 ms.
[2023-03-12 11:30:08] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:09] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2023-03-12 11:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:10] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2023-03-12 11:30:10] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 324 ms.
Minimization took 517 ms.
[2023-03-12 11:30:11] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:11] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2023-03-12 11:30:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 275 ms.
Minimization took 376 ms.
[2023-03-12 11:30:12] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:13] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2023-03-12 11:30:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:14] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2023-03-12 11:30:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 201 ms.
Minimization took 330 ms.
[2023-03-12 11:30:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 11:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:16] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2023-03-12 11:30:17] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 344 ms.
Minimization took 299 ms.
[2023-03-12 11:30:17] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:18] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2023-03-12 11:30:18] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 204 ms.
Minimization took 457 ms.
[2023-03-12 11:30:19] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:20] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-12 11:30:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:21] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2023-03-12 11:30:21] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 201 ms.
Minimization took 368 ms.
[2023-03-12 11:30:21] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 11:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:22] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-03-12 11:30:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 205 ms.
Minimization took 400 ms.
[2023-03-12 11:30:23] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:24] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2023-03-12 11:30:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 11:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:25] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2023-03-12 11:30:25] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 195 ms.
Minimization took 357 ms.
Current structural bounds on expressions (after SMT) : [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150] Max seen :[0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0]
FORMULA Diffusion2D-PT-D20N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 211186 ms.
ITS solved all properties within timeout
BK_STOP 1678620807451
--------------------
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="Diffusion2D-PT-D20N150"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Diffusion2D-PT-D20N150, 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 r138-smll-167819419800181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N150.tgz
mv Diffusion2D-PT-D20N150 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 ;