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.r114-smll-165264477500310.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 HirschbergSinclair-PT-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.7K Apr 29 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 29 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 29 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 29 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 357K May 10 09:34 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 HirschbergSinclair-PT-30-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654187896489

Running Version 202205111006
[2022-06-02 16:38:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-02 16:38:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:38:19] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2022-06-02 16:38:19] [INFO ] Transformed 670 places.
[2022-06-02 16:38:19] [INFO ] Transformed 605 transitions.
[2022-06-02 16:38:19] [INFO ] Parsed PT model containing 670 places and 605 transitions in 552 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 900 ms. (steps per millisecond=11 ) properties (out of 16) seen :8
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 605 rows 670 cols
[2022-06-02 16:38:21] [INFO ] Computed 65 place invariants in 51 ms
[2022-06-02 16:38:21] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 16:38:22] [INFO ] [Nat]Absence check using 60 positive place invariants in 66 ms returned sat
[2022-06-02 16:38:22] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-02 16:38:23] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-02 16:38:24] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 9 ms to minimize.
[2022-06-02 16:38:24] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 3 ms to minimize.
[2022-06-02 16:38:24] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 2 ms to minimize.
[2022-06-02 16:38:25] [INFO ] Deduced a trap composed of 14 places in 497 ms of which 4 ms to minimize.
[2022-06-02 16:38:26] [INFO ] Deduced a trap composed of 11 places in 618 ms of which 2 ms to minimize.
[2022-06-02 16:38:26] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 2 ms to minimize.
[2022-06-02 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2765 ms
[2022-06-02 16:38:27] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2022-06-02 16:38:27] [INFO ] Deduced a trap composed of 16 places in 533 ms of which 3 ms to minimize.
[2022-06-02 16:38:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
[2022-06-02 16:38:28] [INFO ] After 5987ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 598 ms.
[2022-06-02 16:38:29] [INFO ] After 7153ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2119 ms.
Support contains 56 out of 670 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 644 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 644 transition count 407
Reduce places removed 197 places and 0 transitions.
Graph (complete) has 812 edges and 447 vertex of which 391 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 216 rules applied. Total rules applied 415 place count 391 transition count 389
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 489 place count 373 transition count 333
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 492 place count 370 transition count 330
Iterating global reduction 3 with 3 rules applied. Total rules applied 495 place count 370 transition count 330
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 497 place count 368 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 368 transition count 328
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 513 place count 368 transition count 314
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 527 place count 354 transition count 314
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 545 place count 336 transition count 296
Applied a total of 545 rules in 389 ms. Remains 336 /670 variables (removed 334) and now considering 296/605 (removed 309) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/670 places, 296/605 transitions.
Incomplete random walk after 1000000 steps, including 3336 resets, run finished after 17149 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 678 resets, run finished after 3603 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 597 resets, run finished after 1628 ms. (steps per millisecond=614 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 687 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 336 cols
[2022-06-02 16:38:55] [INFO ] Computed 40 place invariants in 7 ms
[2022-06-02 16:38:55] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:38:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-02 16:38:55] [INFO ] [Nat]Absence check using 7 positive and 33 generalized place invariants in 85 ms returned sat
[2022-06-02 16:38:56] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:38:56] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:38:56] [INFO ] After 130ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:38:56] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2022-06-02 16:38:56] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 2 ms to minimize.
[2022-06-02 16:38:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2022-06-02 16:38:56] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2022-06-02 16:38:56] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 16 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 296/296 transitions.
Graph (complete) has 632 edges and 336 vertex of which 322 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 322 transition count 267
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 563 edges and 302 vertex of which 295 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 53 place count 295 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 62 place count 293 transition count 258
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 62 place count 293 transition count 247
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 84 place count 282 transition count 247
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 92 place count 274 transition count 239
Applied a total of 92 rules in 58 ms. Remains 274 /336 variables (removed 62) and now considering 239/296 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 274/336 places, 239/296 transitions.
Incomplete random walk after 1000000 steps, including 4194 resets, run finished after 1804 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1289 resets, run finished after 1250 ms. (steps per millisecond=800 ) properties (out of 1) seen :0
Finished probabilistic random walk after 629 steps, run visited all 1 properties in 15 ms. (steps per millisecond=41 )
Probabilistic random walk after 629 steps, saw 494 distinct states, run finished after 15 ms. (steps per millisecond=41 ) properties seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 41216 ms.

BK_STOP 1654187940112

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="HirschbergSinclair-PT-30"
export BK_EXAMINATION="ReachabilityCardinality"
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 HirschbergSinclair-PT-30, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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