Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700139.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717269528995

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:18:50] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-01 19:18:50] [INFO ] Transformed 476 places.
[2024-06-01 19:18:50] [INFO ] Transformed 920 transitions.
[2024-06-01 19:18:50] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 263 ms.
Discarding 96 transitions out of 920. Remains 824
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.22111KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 58 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-06-01 19:18:51] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-06-01 19:18:51] [INFO ] Computed 46 invariants in 49 ms
[2024-06-01 19:18:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 18 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 282 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 322 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 229 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 242 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 234 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 269 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 318 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 223 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 55 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 2 places in 246 ms of which 4 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 251 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 193 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 4 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 271 places in 212 ms of which 4 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 275 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 272 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 260 places in 230 ms of which 4 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:19:23] [INFO ] Deduced a trap composed of 274 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:19:23] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 282 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 297 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 269 places in 276 ms of which 5 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 279 places in 276 ms of which 4 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 304 places in 199 ms of which 3 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 275 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 41267ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41300ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41409 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 39 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-06-01 19:19:32] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:19:32] [INFO ] Invariant cache hit.
[2024-06-01 19:19:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 19:19:32] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:19:32] [INFO ] Invariant cache hit.
[2024-06-01 19:19:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:19:33] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-06-01 19:19:33] [INFO ] Redundant transitions in 87 ms returned []
Running 822 sub problems to find dead transitions.
[2024-06-01 19:19:33] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:19:33] [INFO ] Invariant cache hit.
[2024-06-01 19:19:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:19:40] [INFO ] Deduced a trap composed of 277 places in 232 ms of which 3 ms to minimize.
[2024-06-01 19:19:40] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 4 ms to minimize.
[2024-06-01 19:19:40] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 223 places in 225 ms of which 3 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 290 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 7 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 262 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 215 places in 220 ms of which 4 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 116 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 265 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 56 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 279 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 226 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 264 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 261 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 260 places in 201 ms of which 4 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 255 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 287 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 264 places in 247 ms of which 3 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 268 places in 175 ms of which 2 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 275 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 238 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 286 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 265 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 276 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 72 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 36/36 constraints]
After SMT, in 60982ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60997ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61895 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 2064 steps, including 0 resets, run found a deadlock after 26 ms. (steps per millisecond=79 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 103784 ms.
ITS solved all properties within timeout

BK_STOP 1717269634324

--------------------
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 Liveness -timeout 180 -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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-PT-S02J04T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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