Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167100150.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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 AutoFlight-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717189672150

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:07:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:07:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:07:54] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-31 21:07:54] [INFO ] Transformed 574 places.
[2024-05-31 21:07:54] [INFO ] Transformed 572 transitions.
[2024-05-31 21:07:54] [INFO ] Found NUPN structural information;
[2024-05-31 21:07:54] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (140 resets) in 2216 ms. (18 steps per ms) remains 7/15 properties
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 262 ms. (152 steps per ms) remains 6/7 properties
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 624 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (15 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
// Phase 1: matrix 572 rows 574 cols
[2024-05-31 21:07:56] [INFO ] Computed 40 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AutoFlight-PT-06b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 468/540 variables, 38/110 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 468/578 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/542 variables, 1/579 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AutoFlight-PT-06b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 32/574 variables, 1/582 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 32/614 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/614 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 572/1146 variables, 574/1188 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 1188 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1571 ms.
Refiners :[Domain max(s): 574/574 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 138/146 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 138/154 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/541 variables, 31/185 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 395/580 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:07:58] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 40 ms to minimize.
[2024-05-31 21:07:58] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 4 ms to minimize.
[2024-05-31 21:07:58] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-31 21:07:58] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-31 21:07:58] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 4 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2024-05-31 21:07:59] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-31 21:08:00] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-31 21:08:00] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 4 ms to minimize.
[2024-05-31 21:08:00] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 4 ms to minimize.
[2024-05-31 21:08:00] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 15/595 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/595 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 33/574 variables, 1/596 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 33/629 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:08:01] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2024-05-31 21:08:01] [INFO ] Deduced a trap composed of 89 places in 272 ms of which 3 ms to minimize.
[2024-05-31 21:08:02] [INFO ] Deduced a trap composed of 64 places in 1072 ms of which 3 ms to minimize.
[2024-05-31 21:08:02] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 3 ms to minimize.
[2024-05-31 21:08:02] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-31 21:08:02] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 6934ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 574 transition count 353
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 260 rules applied. Total rules applied 479 place count 355 transition count 312
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 493 place count 343 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 495 place count 341 transition count 310
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 495 place count 341 transition count 235
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 645 place count 266 transition count 235
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 697 place count 214 transition count 183
Iterating global reduction 4 with 52 rules applied. Total rules applied 749 place count 214 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 749 place count 214 transition count 167
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 781 place count 198 transition count 167
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 873 place count 152 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 874 place count 152 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 876 place count 151 transition count 119
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 900 place count 151 transition count 95
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 924 place count 127 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 925 place count 126 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 928 place count 123 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 928 place count 123 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 934 place count 120 transition count 91
Applied a total of 934 rules in 234 ms. Remains 120 /574 variables (removed 454) and now considering 91/572 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 120/574 places, 91/572 transitions.
RANDOM walk for 36670 steps (8 resets) in 690 ms. (53 steps per ms) remains 0/4 properties
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9375 ms.
ITS solved all properties within timeout

BK_STOP 1717189683486

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="AutoFlight-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-06b, 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 r468-smll-171620167100150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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