About the Execution of 2022-gold for Diffusion2D-PT-D20N050
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.r159-smll-167819445100021.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 gold2022
Input is Diffusion2D-PT-D20N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445100021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 26 04:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 04:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 26 04:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 04:18 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-D20N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678464695876
Running Version 202205111006
[2023-03-10 16:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 16:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:11:39] [INFO ] Load time of PNML (sax parser for PT used): 523 ms
[2023-03-10 16:11:39] [INFO ] Transformed 400 places.
[2023-03-10 16:11:39] [INFO ] Transformed 2964 transitions.
[2023-03-10 16:11:39] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 791 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 148 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-10 16:11:39] [INFO ] Computed 1 place invariants in 78 ms
Incomplete random walk after 10033 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 16) seen :149
FORMULA Diffusion2D-PT-D20N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :4
// Phase 1: matrix 2964 rows 400 cols
[2023-03-10 16:11:40] [INFO ] Computed 1 place invariants in 43 ms
[2023-03-10 16:11:40] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-10 16:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:41] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2023-03-10 16:11:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-10 16:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:42] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2023-03-10 16:11:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 502 ms.
Minimization took 268 ms.
[2023-03-10 16:11:44] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-10 16:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:45] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-10 16:11:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:46] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2023-03-10 16:11:46] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 335 ms.
Minimization took 375 ms.
[2023-03-10 16:11:47] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-10 16:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:48] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2023-03-10 16:11:48] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 300 ms.
Minimization took 343 ms.
[2023-03-10 16:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-10 16:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:49] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2023-03-10 16:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:50] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2023-03-10 16:11:51] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 299 ms.
Minimization took 388 ms.
[2023-03-10 16:11:52] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:52] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-10 16:11:53] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 338 ms.
Minimization took 476 ms.
[2023-03-10 16:11:54] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:54] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2023-03-10 16:11:55] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 307 ms.
Minimization took 606 ms.
[2023-03-10 16:11:56] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-10 16:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:57] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2023-03-10 16:11:57] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 330 ms.
Minimization took 516 ms.
[2023-03-10 16:11:58] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:59] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-10 16:11:59] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 463 ms.
Minimization took 508 ms.
[2023-03-10 16:12:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:01] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-10 16:12:01] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 312 ms.
Minimization took 526 ms.
[2023-03-10 16:12:02] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:03] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2023-03-10 16:12:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:12:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:04] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2023-03-10 16:12:05] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 296 ms.
Minimization took 310 ms.
[2023-03-10 16:12:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:06] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2023-03-10 16:12:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:12:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-10 16:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:07] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2023-03-10 16:12:07] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 205 ms.
Minimization took 301 ms.
[2023-03-10 16:12:08] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-10 16:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:09] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2023-03-10 16:12:09] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 296 ms.
Minimization took 458 ms.
[2023-03-10 16:12:10] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-10 16:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:11] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2023-03-10 16:12:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:12:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-10 16:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:11] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-10 16:12:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 266 ms.
Minimization took 444 ms.
[2023-03-10 16:12:13] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-10 16:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:12:13] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2023-03-10 16:12:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 222 ms.
Minimization took 516 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 48, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 3]
FORMULA Diffusion2D-PT-D20N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 50637 ms.
BK_STOP 1678464749269
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-D20N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is Diffusion2D-PT-D20N050, 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 r159-smll-167819445100021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N050.tgz
mv Diffusion2D-PT-D20N050 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 ;