fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r193-csrt-159033389000598
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for UtahNoC-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.810 27447.00 44150.00 125.40 TFFFFTTFFFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389000598.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389000598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.2K Apr 12 20:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 20:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 23:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 23:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 22:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 205K Mar 24 05:38 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 UtahNoC-PT-none-ReachabilityCardinality-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590538339115

[2020-05-27 00:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 00:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:12:22] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2020-05-27 00:12:22] [INFO ] Transformed 216 places.
[2020-05-27 00:12:22] [INFO ] Transformed 977 transitions.
[2020-05-27 00:12:22] [INFO ] Found NUPN structural information;
[2020-05-27 00:12:22] [INFO ] Parsed PT model containing 216 places and 977 transitions in 296 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA UtahNoC-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 1, 1, 0, 0, 0, 1]
FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0]
[2020-05-27 00:12:23] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2020-05-27 00:12:23] [INFO ] Computed 8 place invariants in 14 ms
[2020-05-27 00:12:23] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2020-05-27 00:12:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:23] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2020-05-27 00:12:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:12:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 38 ms returned sat
[2020-05-27 00:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:24] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2020-05-27 00:12:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-05-27 00:12:24] [INFO ] [Nat]Added 43 Read/Feed constraints in 34 ms returned sat
[2020-05-27 00:12:24] [INFO ] Computed and/alt/rep : 828/4432/426 causal constraints in 86 ms.
[2020-05-27 00:12:28] [INFO ] Added : 370 causal constraints over 74 iterations in 4388 ms. Result :(error "Failed to check-sat")
[2020-05-27 00:12:29] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-05-27 00:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:29] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2020-05-27 00:12:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:12:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 72 ms returned sat
[2020-05-27 00:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:30] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-05-27 00:12:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 16 ms returned sat
[2020-05-27 00:12:31] [INFO ] Deduced a trap composed of 117 places in 925 ms
[2020-05-27 00:12:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1003 ms
[2020-05-27 00:12:31] [INFO ] Computed and/alt/rep : 828/4432/426 causal constraints in 86 ms.
[2020-05-27 00:12:34] [INFO ] Added : 360 causal constraints over 72 iterations in 3286 ms. Result :unknown
[2020-05-27 00:12:34] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2020-05-27 00:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:34] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-05-27 00:12:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:12:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2020-05-27 00:12:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:35] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-05-27 00:12:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2020-05-27 00:12:35] [INFO ] Deduced a trap composed of 117 places in 132 ms
[2020-05-27 00:12:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-05-27 00:12:35] [INFO ] Computed and/alt/rep : 828/4432/426 causal constraints in 44 ms.
[2020-05-27 00:12:40] [INFO ] Added : 418 causal constraints over 84 iterations in 4553 ms. Result :unknown
[2020-05-27 00:12:40] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-05-27 00:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:40] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-05-27 00:12:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:12:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2020-05-27 00:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:12:40] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-27 00:12:40] [INFO ] [Nat]Added 43 Read/Feed constraints in 15 ms returned sat
[2020-05-27 00:12:40] [INFO ] Computed and/alt/rep : 828/4432/426 causal constraints in 70 ms.
[2020-05-27 00:12:45] [INFO ] Added : 426 causal constraints over 86 iterations in 4522 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
Incomplete Parikh walk after 49400 steps, including 350 resets, run finished after 222 ms. (steps per millisecond=222 ) properties seen :[1, 0, 1, 1] could not realise parikh vector
FORMULA UtahNoC-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 35600 steps, including 953 resets, run finished after 104 ms. (steps per millisecond=342 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 49600 steps, including 990 resets, run finished after 175 ms. (steps per millisecond=283 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 353 edges and 216 vertex of which 91 / 216 are part of one of the 13 SCC in 12 ms
Free SCC test removed 78 places
Drop transitions removed 250 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 328 transitions.
Iterating post reduction 0 with 328 rules applied. Total rules applied 329 place count 138 transition count 501
Symmetric choice reduction at 1 with 8 rule applications. Total rules 337 place count 138 transition count 501
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 26 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 353 place count 130 transition count 475
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 363 place count 130 transition count 465
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 371 place count 126 transition count 458
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 18 rules applied. Total rules applied 389 place count 126 transition count 440
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 394 place count 123 transition count 438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 396 place count 122 transition count 443
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 397 place count 122 transition count 442
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 408 place count 122 transition count 431
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 434 place count 111 transition count 416
Symmetric choice reduction at 6 with 5 rule applications. Total rules 439 place count 111 transition count 416
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 25 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 449 place count 106 transition count 391
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 452 place count 106 transition count 393
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 457 place count 103 transition count 391
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 460 place count 103 transition count 391
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 461 place count 103 transition count 390
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 462 place count 103 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 463 place count 102 transition count 388
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 103 edges and 100 vertex of which 20 / 100 are part of one of the 4 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 466 place count 84 transition count 388
Drop transitions removed 28 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 9 with 64 rules applied. Total rules applied 530 place count 84 transition count 324
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 10 with 2 rules applied. Total rules applied 532 place count 83 transition count 323
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 536 place count 83 transition count 319
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 548 place count 79 transition count 311
Symmetric choice reduction at 11 with 1 rule applications. Total rules 549 place count 79 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 551 place count 78 transition count 306
Applied a total of 551 rules in 323 ms. Remains 78 /216 variables (removed 138) and now considering 306/829 (removed 523) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/216 places, 306/829 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
FORMULA UtahNoC-PT-none-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590538366562

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="UtahNoC-PT-none"
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"

# 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 UtahNoC-PT-none, 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 r193-csrt-159033389000598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 ;