fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761500647
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1419.000 40983.00 78412.00 126.20 FFTFTTTTFTTFFTTF 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.r528-tall-171683761500647.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 ShieldPPPt-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500647
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 201K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258098255

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:08:19] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-01 16:08:19] [INFO ] Transformed 753 places.
[2024-06-01 16:08:19] [INFO ] Transformed 543 transitions.
[2024-06-01 16:08:19] [INFO ] Found NUPN structural information;
[2024-06-01 16:08:19] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2407 ms. (16 steps per ms) remains 11/16 properties
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 563 ms. (70 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 955 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 457 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 11/11 properties
// Phase 1: matrix 542 rows 753 cols
[2024-06-01 16:08:21] [INFO ] Computed 331 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 188/381 variables, 165/358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 188/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 372/753 variables, 166/712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 372/1084 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1579 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 188/381 variables, 165/358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 188/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 372/753 variables, 166/712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 372/1084 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 11/1848 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/1848 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1295 variables, 0/1848 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1848 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4096 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 5843ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 26453 ms.
Support contains 61 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 103 times.
Drop transitions (Partial Free agglomeration) removed 103 transitions
Iterating global reduction 0 with 103 rules applied. Total rules applied 107 place count 751 transition count 540
Applied a total of 107 rules in 170 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 751/753 places, 540/542 transitions.
RANDOM walk for 40000 steps (8 resets) in 1401 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 290031 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :3 out of 4
Probabilistic random walk after 290031 steps, saw 280409 distinct states, run finished after 3005 ms. (steps per millisecond=96 ) properties seen :3
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 540 rows 751 cols
[2024-06-01 16:08:58] [INFO ] Computed 331 invariants in 8 ms
[2024-06-01 16:08:58] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/44 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 707/751 variables, 313/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 707/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 540/1291 variables, 751/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1291 variables, 25/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1291 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1291 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1291/1291 variables, and 1858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 751/751 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/44 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 707/751 variables, 313/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 707/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 540/1291 variables, 751/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1291 variables, 25/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1291 variables, 1/1859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1291 variables, 0/1859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1291 variables, 0/1859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1291/1291 variables, and 1859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 751/751 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 990ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 723 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=90 )
FORMULA ShieldPPPt-PT-030A-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 39839 ms.
ITS solved all properties within timeout

BK_STOP 1717258139238

--------------------
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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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 r528-tall-171683761500647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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