About the Execution of ITS-Tools for MAPK-PT-01280
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.r229-tall-167856413500605.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 itstools
Input is MAPK-PT-01280, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413500605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:50 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:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-01280-UpperBounds-00
FORMULA_NAME MAPK-PT-01280-UpperBounds-01
FORMULA_NAME MAPK-PT-01280-UpperBounds-02
FORMULA_NAME MAPK-PT-01280-UpperBounds-03
FORMULA_NAME MAPK-PT-01280-UpperBounds-04
FORMULA_NAME MAPK-PT-01280-UpperBounds-05
FORMULA_NAME MAPK-PT-01280-UpperBounds-06
FORMULA_NAME MAPK-PT-01280-UpperBounds-07
FORMULA_NAME MAPK-PT-01280-UpperBounds-08
FORMULA_NAME MAPK-PT-01280-UpperBounds-09
FORMULA_NAME MAPK-PT-01280-UpperBounds-10
FORMULA_NAME MAPK-PT-01280-UpperBounds-11
FORMULA_NAME MAPK-PT-01280-UpperBounds-12
FORMULA_NAME MAPK-PT-01280-UpperBounds-13
FORMULA_NAME MAPK-PT-01280-UpperBounds-14
FORMULA_NAME MAPK-PT-01280-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679513982776
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-01280
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 19:39:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 19:39:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:39:44] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-22 19:39:44] [INFO ] Transformed 22 places.
[2023-03-22 19:39:44] [INFO ] Transformed 30 transitions.
[2023-03-22 19:39:44] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 19:39:44] [INFO ] Computed 7 place invariants in 6 ms
FORMULA MAPK-PT-01280-UpperBounds-15 1280 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-UpperBounds-12 960 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-UpperBounds-11 960 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-UpperBounds-07 320 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-UpperBounds-04 960 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-UpperBounds-02 640 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10271 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1027 ) properties (out of 10) seen :3200
FORMULA MAPK-PT-01280-UpperBounds-05 640 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-01280-UpperBounds-01 960 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-01280-UpperBounds-00 320 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :40
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :334
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :23
[2023-03-22 19:39:44] [INFO ] Invariant cache hit.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-22 19:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 12 ms.
[2023-03-22 19:39:44] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-22 19:39:44] [INFO ] Added : 18 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-22 19:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-22 19:39:44] [INFO ] Added : 21 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 19:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:39:44] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:44] [INFO ] Added : 16 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-22 19:39:45] [INFO ] Added : 16 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-22 19:39:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:45] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 19:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:39:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:39:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-22 19:39:45] [INFO ] Added : 20 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [640, 960, 640, 640, 1280, 640, 960] Max seen :[5, 2, 320, 26, 960, 14, 6]
FORMULA MAPK-PT-01280-UpperBounds-14 960 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-01280-UpperBounds-13 640 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-01280-UpperBounds-10 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-01280-UpperBounds-09 640 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-01280-UpperBounds-08 640 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-01280-UpperBounds-03 640 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 10 transition count 20
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 4 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 31 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 6 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 46 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 2 transition count 2
Applied a total of 47 rules in 61 ms. Remains 2 /22 variables (removed 20) and now considering 2/30 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 2/22 places, 2/30 transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-22 19:39:46] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000417 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=12200 ) properties (out of 1) seen :960
FORMULA MAPK-PT-01280-UpperBounds-06 960 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2838 ms.
BK_STOP 1679513987790
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-01280"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is MAPK-PT-01280, 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 r229-tall-167856413500605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-01280.tgz
mv MAPK-PT-01280 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 ;