fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914000534
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.160 3600000.00 60281.00 151.20 TFFFFTTFTFTFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000534.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K Mar 24 05:37 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 BusinessProcesses-PT-11-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591162019570

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:27:02] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:27:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:27:02] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-06-03 05:27:02] [INFO ] Transformed 567 places.
[2020-06-03 05:27:02] [INFO ] Transformed 508 transitions.
[2020-06-03 05:27:02] [INFO ] Found NUPN structural information;
[2020-06-03 05:27:02] [INFO ] Parsed PT model containing 567 places and 508 transitions in 165 ms.
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[1, 0, 0, 1, 0, 1, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-06-03 05:27:02] [INFO ] Computed 95 place invariants in 49 ms
[2020-06-03 05:27:03] [INFO ] [Real]Absence check using 53 positive place invariants in 42 ms returned sat
[2020-06-03 05:27:03] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 33 ms returned sat
[2020-06-03 05:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:03] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2020-06-03 05:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:04] [INFO ] [Nat]Absence check using 53 positive place invariants in 57 ms returned sat
[2020-06-03 05:27:04] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2020-06-03 05:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:04] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2020-06-03 05:27:05] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2020-06-03 05:27:06] [INFO ] Deduced a trap composed of 16 places in 1036 ms
[2020-06-03 05:27:06] [INFO ] Deduced a trap composed of 19 places in 245 ms
[2020-06-03 05:27:08] [INFO ] Deduced a trap composed of 24 places in 1703 ms
[2020-06-03 05:27:09] [INFO ] Deduced a trap composed of 28 places in 963 ms
[2020-06-03 05:27:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s151 s152 s153 s180 s183 s184 s185 s324 s325 s326 s340 s355 s487 s488 s550 s551) 0)") while checking expression at index 0
[2020-06-03 05:27:09] [INFO ] [Real]Absence check using 53 positive place invariants in 54 ms returned sat
[2020-06-03 05:27:09] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 37 ms returned sat
[2020-06-03 05:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:10] [INFO ] [Real]Absence check using state equation in 1399 ms returned sat
[2020-06-03 05:27:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 71 ms returned sat
[2020-06-03 05:27:11] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 38 ms returned sat
[2020-06-03 05:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:12] [INFO ] [Nat]Absence check using state equation in 1438 ms returned sat
[2020-06-03 05:27:13] [INFO ] Deduced a trap composed of 11 places in 382 ms
[2020-06-03 05:27:15] [INFO ] Deduced a trap composed of 18 places in 2094 ms
[2020-06-03 05:27:17] [INFO ] Deduced a trap composed of 14 places in 2368 ms
[2020-06-03 05:27:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s192 s368 s369 s370) 0)") while checking expression at index 1
[2020-06-03 05:27:17] [INFO ] [Real]Absence check using 53 positive place invariants in 347 ms returned sat
[2020-06-03 05:27:18] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 289 ms returned sat
[2020-06-03 05:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:21] [INFO ] [Real]Absence check using state equation in 2880 ms returned sat
[2020-06-03 05:27:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:21] [INFO ] [Nat]Absence check using 53 positive place invariants in 66 ms returned sat
[2020-06-03 05:27:21] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 35 ms returned sat
[2020-06-03 05:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:22] [INFO ] [Nat]Absence check using state equation in 1445 ms returned sat
[2020-06-03 05:27:23] [INFO ] Deduced a trap composed of 12 places in 968 ms
[2020-06-03 05:27:24] [INFO ] Deduced a trap composed of 12 places in 526 ms
[2020-06-03 05:27:25] [INFO ] Deduced a trap composed of 12 places in 1060 ms
[2020-06-03 05:27:26] [INFO ] Deduced a trap composed of 18 places in 750 ms
[2020-06-03 05:27:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s186 s189 s190 s191 s368 s369 s370) 0)") while checking expression at index 2
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 309 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.14 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 549 transition count 372
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 250 place count 429 transition count 372
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 250 place count 429 transition count 285
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 441 place count 325 transition count 285
Symmetric choice reduction at 2 with 64 rule applications. Total rules 505 place count 325 transition count 285
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 633 place count 261 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 633 place count 261 transition count 218
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 639 place count 258 transition count 218
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 820 place count 166 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 822 place count 165 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 824 place count 165 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 826 place count 163 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 827 place count 163 transition count 131
Applied a total of 827 rules in 196 ms. Remains 163 /560 variables (removed 397) and now considering 131/501 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/560 places, 131/501 transitions.
Incomplete random walk after 1000000 steps, including 44368 resets, run finished after 2265 ms. (steps per millisecond=441 ) properties seen :[1, 1, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 16611 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties seen :[0]
// Phase 1: matrix 131 rows 163 cols
[2020-06-03 05:27:29] [INFO ] Computed 71 place invariants in 11 ms
[2020-06-03 05:27:30] [INFO ] [Real]Absence check using 48 positive place invariants in 161 ms returned sat
[2020-06-03 05:27:30] [INFO ] [Real]Absence check using 48 positive and 23 generalized place invariants in 23 ms returned sat
[2020-06-03 05:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:30] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2020-06-03 05:27:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:31] [INFO ] [Nat]Absence check using 48 positive place invariants in 286 ms returned sat
[2020-06-03 05:27:31] [INFO ] [Nat]Absence check using 48 positive and 23 generalized place invariants in 36 ms returned sat
[2020-06-03 05:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:31] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2020-06-03 05:27:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-03 05:27:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 72 ms returned sat
[2020-06-03 05:27:31] [INFO ] Deduced a trap composed of 36 places in 105 ms
[2020-06-03 05:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2020-06-03 05:27:31] [INFO ] Computed and/alt/rep : 129/2282/129 causal constraints in 10 ms.
[2020-06-03 05:27:32] [INFO ] Added : 60 causal constraints over 13 iterations in 681 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
Incomplete Parikh walk after 6000 steps, including 402 resets, run finished after 16 ms. (steps per millisecond=375 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 131/131 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 162 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 162 transition count 128
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 159 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 157 transition count 126
Applied a total of 11 rules in 11 ms. Remains 157 /163 variables (removed 6) and now considering 126/131 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/163 places, 126/131 transitions.
Incomplete random walk after 1000000 steps, including 51594 resets, run finished after 2106 ms. (steps per millisecond=474 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 20340 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties seen :[0]
Finished probabilistic random walk after 3049 steps, run visited all 1 properties in 15 ms. (steps per millisecond=203 )
Probabilistic random walk after 3049 steps, saw 1175 distinct states, run finished after 15 ms. (steps per millisecond=203 ) properties seen :[1]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

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

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="BusinessProcesses-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-11, 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 r182-oct2-158987914000534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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