fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r579-smll-171734921400183
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MedleyA-PT-23

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
345.964 10443.00 25209.00 226.30 TTTTTTTTTFFTTFFF normal

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.r579-smll-171734921400183.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 MedleyA-PT-23, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 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 MedleyA-PT-23-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366392947

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 22:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:13:15] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-06-02 22:13:16] [INFO ] Transformed 378 places.
[2024-06-02 22:13:16] [INFO ] Transformed 614 transitions.
[2024-06-02 22:13:16] [INFO ] Found NUPN structural information;
[2024-06-02 22:13:16] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 562 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (26 resets) in 3480 ms. (11 steps per ms) remains 9/16 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (50 resets) in 329 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (27 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (37 resets) in 116 ms. (341 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 618 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (71 resets) in 417 ms. (95 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
// Phase 1: matrix 614 rows 378 cols
[2024-06-02 22:13:18] [INFO ] Computed 11 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 218/293 variables, 9/84 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 218/302 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 85/378 variables, 2/304 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 85/389 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 767 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1570 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 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/33 variables, 33/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 251/284 variables, 9/42 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 251/293 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 94/378 variables, 2/295 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 94/389 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 3/770 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/770 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/992 variables, 0/770 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 770 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1659 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3562ms problems are : Problem set: 3 solved, 3 unsolved
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 893 ms.
Support contains 13 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 283 edges and 378 vertex of which 26 / 378 are part of one of the 2 SCC in 7 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1051 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 351 transition count 488
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 189 place count 260 transition count 486
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 189 place count 260 transition count 465
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 231 place count 239 transition count 465
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 314 place count 156 transition count 382
Iterating global reduction 2 with 83 rules applied. Total rules applied 397 place count 156 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 399 place count 156 transition count 380
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 399 place count 156 transition count 373
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 413 place count 149 transition count 373
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 448 place count 114 transition count 268
Iterating global reduction 3 with 35 rules applied. Total rules applied 483 place count 114 transition count 268
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 493 place count 114 transition count 258
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 496 place count 113 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 497 place count 112 transition count 256
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 503 place count 106 transition count 244
Iterating global reduction 6 with 6 rules applied. Total rules applied 509 place count 106 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 511 place count 106 transition count 242
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 514 place count 103 transition count 233
Iterating global reduction 7 with 3 rules applied. Total rules applied 517 place count 103 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 520 place count 103 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 552 place count 87 transition count 214
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 568 place count 79 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 569 place count 79 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 576 place count 79 transition count 221
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 578 place count 77 transition count 215
Iterating global reduction 9 with 2 rules applied. Total rules applied 580 place count 77 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 582 place count 77 transition count 213
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 594 place count 77 transition count 201
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 606 place count 65 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 607 place count 65 transition count 200
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 608 place count 65 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 609 place count 64 transition count 199
Applied a total of 609 rules in 328 ms. Remains 64 /378 variables (removed 314) and now considering 199/614 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 64/378 places, 199/614 transitions.
RANDOM walk for 40000 steps (13 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1382 steps (3 resets) in 24 ms. (55 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 7901 ms.
ITS solved all properties within timeout

BK_STOP 1717366403390

--------------------
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 ReachabilityFireability -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="MedleyA-PT-23"
export BK_EXAMINATION="ReachabilityFireability"
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 MedleyA-PT-23, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921400183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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