About the Execution of LTSMin+red for HealthRecord-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
310.831 | 5051.00 | 14323.00 | 70.70 | TTTFFTTTTTTTTFTT | 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.r496-tall-171640604000718.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 HealthRecord-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604000718
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 12 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K 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 HealthRecord-PT-03-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-03-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717200872157
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:14:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:14:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:14:33] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 00:14:33] [INFO ] Transformed 121 places.
[2024-06-01 00:14:33] [INFO ] Transformed 232 transitions.
[2024-06-01 00:14:33] [INFO ] Found NUPN structural information;
[2024-06-01 00:14:33] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2698 resets) in 1794 ms. (22 steps per ms) remains 8/10 properties
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (397 resets) in 369 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (380 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (410 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (413 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (326 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (400 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (394 resets) in 464 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (403 resets) in 855 ms. (46 steps per ms) remains 8/8 properties
[2024-06-01 00:14:34] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2024-06-01 00:14:34] [INFO ] Computed 14 invariants in 18 ms
[2024-06-01 00:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 22/103 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 22/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 18/121 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 00:14:35] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 13 ms to minimize.
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 216/337 variables, 121/257 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/338 variables, 1/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/338 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 258 constraints, problems are : Problem set: 1 solved, 7 unsolved in 833 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-05 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-03-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 25/100 variables, 8/83 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 25/108 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 6/114 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 21/121 variables, 6/120 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 21/141 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/142 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 5/147 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/147 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 216/337 variables, 121/268 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 2/270 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-06-01 00:14:36] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 1/271 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/271 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/338 variables, 1/272 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/272 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/338 variables, 0/272 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 272 constraints, problems are : Problem set: 6 solved, 2 unsolved in 874 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 13/13 constraints]
After SMT, in 1861ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 13 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 141 edges and 121 vertex of which 8 / 121 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 431 edges and 117 vertex of which 110 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 106 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 106 transition count 198
Deduced a syphon composed of 2 places in 1 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 19 place count 103 transition count 198
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 65 place count 57 transition count 106
Iterating global reduction 2 with 46 rules applied. Total rules applied 111 place count 57 transition count 106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 52 transition count 96
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 52 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 52 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 51 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 51 transition count 91
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 3 with 4 rules applied. Total rules applied 129 place count 49 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 45 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 45 transition count 110
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 157 place count 45 transition count 110
Applied a total of 157 rules in 57 ms. Remains 45 /121 variables (removed 76) and now considering 110/225 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 45/121 places, 110/225 transitions.
RANDOM walk for 40000 steps (106 resets) in 729 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 23049 steps (790 resets) in 106 ms. (215 steps per ms) remains 0/2 properties
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 3869 ms.
ITS solved all properties within timeout
BK_STOP 1717200877208
--------------------
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="HealthRecord-PT-03"
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 HealthRecord-PT-03, 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 r496-tall-171640604000718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-03.tgz
mv HealthRecord-PT-03 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 '
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 ;