Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281800127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BugTracking-PT-q8m256, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-00
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-01
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-02
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-03
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-04
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-05
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-06
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-07
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-08
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-09
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-10
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-11
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-12
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-13
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-14
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654771073722

Running Version 202205111006
[2022-06-09 10:37:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-09 10:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:37:55] [INFO ] Load time of PNML (sax parser for PT used): 897 ms
[2022-06-09 10:37:55] [INFO ] Transformed 754 places.
[2022-06-09 10:37:56] [INFO ] Transformed 27370 transitions.
[2022-06-09 10:37:56] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1116 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 105 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138725 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138725 steps, saw 66918 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:37:59] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 10:37:59] [INFO ] Computed 10 place invariants in 44 ms
[2022-06-09 10:37:59] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-09 10:38:00] [INFO ] After 1113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:01] [INFO ] After 810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:01] [INFO ] State equation strengthened by 303 read => feed constraints.
[2022-06-09 10:38:01] [INFO ] After 352ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:02] [INFO ] Deduced a trap composed of 47 places in 497 ms of which 14 ms to minimize.
[2022-06-09 10:38:03] [INFO ] Deduced a trap composed of 21 places in 519 ms of which 1 ms to minimize.
[2022-06-09 10:38:03] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2022-06-09 10:38:04] [INFO ] Deduced a trap composed of 14 places in 625 ms of which 1 ms to minimize.
[2022-06-09 10:38:04] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2022-06-09 10:38:05] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 1 ms to minimize.
[2022-06-09 10:38:05] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2022-06-09 10:38:05] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 0 ms to minimize.
[2022-06-09 10:38:06] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 1 ms to minimize.
[2022-06-09 10:38:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4216 ms
[2022-06-09 10:38:06] [INFO ] After 4650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-06-09 10:38:06] [INFO ] After 5660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 534 ms.
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 358 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/280 places, 3872/3904 transitions.
Incomplete random walk after 1000000 steps, including 342 resets, run finished after 4533 ms. (steps per millisecond=220 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 628 resets, run finished after 4113 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 998572 steps, run timeout after 24001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 998572 steps, saw 651764 distinct states, run finished after 24001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:38:39] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:38:39] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 10:38:40] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2022-06-09 10:38:40] [INFO ] After 613ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:38:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:41] [INFO ] After 318ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:38:41] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:38:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 10:38:41] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:42] [INFO ] After 341ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:42] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 0 ms to minimize.
[2022-06-09 10:38:43] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 0 ms to minimize.
[2022-06-09 10:38:43] [INFO ] Deduced a trap composed of 54 places in 393 ms of which 0 ms to minimize.
[2022-06-09 10:38:44] [INFO ] Deduced a trap composed of 60 places in 434 ms of which 1 ms to minimize.
[2022-06-09 10:38:44] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 1 ms to minimize.
[2022-06-09 10:38:45] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 1 ms to minimize.
[2022-06-09 10:38:45] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 0 ms to minimize.
[2022-06-09 10:38:45] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2022-06-09 10:38:45] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2022-06-09 10:38:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3832 ms
[2022-06-09 10:38:45] [INFO ] After 4253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2022-06-09 10:38:46] [INFO ] After 5071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1209 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 64 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 80 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2022-06-09 10:38:47] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:38:47] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-09 10:38:48] [INFO ] Implicit Places using invariants in 574 ms returned []
[2022-06-09 10:38:48] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:38:48] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:38:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:50] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
[2022-06-09 10:38:50] [INFO ] Redundant transitions in 261 ms returned []
[2022-06-09 10:38:50] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:38:50] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 10:38:51] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 100000 steps, including 33 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-09 10:38:52] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:38:52] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:38:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:38:53] [INFO ] After 593ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:38:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:53] [INFO ] After 120ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:38:53] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:38:53] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:54] [INFO ] After 258ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:38:54] [INFO ] Deduced a trap composed of 28 places in 482 ms of which 0 ms to minimize.
[2022-06-09 10:38:55] [INFO ] Deduced a trap composed of 37 places in 386 ms of which 1 ms to minimize.
[2022-06-09 10:38:55] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 0 ms to minimize.
[2022-06-09 10:38:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1468 ms
[2022-06-09 10:38:55] [INFO ] After 1740ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 10:38:55] [INFO ] After 2574ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 60830 ms.

BK_STOP 1654771135788

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="BugTracking-PT-q8m256"
export BK_EXAMINATION="ReachabilityFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m256, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m256.tgz
mv BugTracking-PT-q8m256 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;