About the Execution of GreatSPN+red for LeafsetExtension-PT-S32C3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
936.136 | 22648.00 | 42912.00 | 108.70 | FFTFFTFFFFTTFFTT | 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.r223-tall-171649611300375.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 greatspnxred
Input is LeafsetExtension-PT-S32C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300375
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K 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 6.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716546298068
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 10:24:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 10:24:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:24:59] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2024-05-24 10:24:59] [INFO ] Transformed 5622 places.
[2024-05-24 10:24:59] [INFO ] Transformed 5449 transitions.
[2024-05-24 10:24:59] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1538 resets) in 1944 ms. (20 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (117 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 746 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (99 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (101 resets) in 327 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (103 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 95 ms. (416 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (102 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 10:25:01] [INFO ] Computed 173 invariants in 462 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/324 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 5219/5543 variables, 105/126 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5543 variables, 0/126 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 14/5557 variables, 14/140 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5557 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 65/5622 variables, 33/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11071/11071 variables, and 5795 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/139 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5169/5308 variables, 74/83 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5308 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/5334 variables, 26/109 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5334 variables, 0/109 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 288/5622 variables, 64/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5449/11071 variables, 5622/5795 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11071/11071 variables, and 5801 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 11101ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 4527 are kept as prefixes of interest. Removing 1095 places using SCC suffix rule.15 ms
Discarding 1095 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 913 transitions
Trivial Post-agglo rules discarded 913 transitions
Performed 913 trivial Post agglomeration. Transition count delta: 913
Iterating post reduction 0 with 913 rules applied. Total rules applied 914 place count 4527 transition count 4534
Reduce places removed 913 places and 0 transitions.
Performed 611 Post agglomeration using F-continuation condition.Transition count delta: 611
Iterating post reduction 1 with 1524 rules applied. Total rules applied 2438 place count 3614 transition count 3923
Reduce places removed 611 places and 0 transitions.
Iterating post reduction 2 with 611 rules applied. Total rules applied 3049 place count 3003 transition count 3923
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 3049 place count 3003 transition count 3872
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 3151 place count 2952 transition count 3872
Discarding 996 places :
Symmetric choice reduction at 3 with 996 rule applications. Total rules 4147 place count 1956 transition count 2876
Iterating global reduction 3 with 996 rules applied. Total rules applied 5143 place count 1956 transition count 2876
Discarding 492 places :
Symmetric choice reduction at 3 with 492 rule applications. Total rules 5635 place count 1464 transition count 2384
Iterating global reduction 3 with 492 rules applied. Total rules applied 6127 place count 1464 transition count 2384
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 6134 place count 1464 transition count 2377
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 6141 place count 1457 transition count 2377
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 6199 place count 1457 transition count 2377
Applied a total of 6199 rules in 2368 ms. Remains 1457 /5622 variables (removed 4165) and now considering 2377/5449 (removed 3072) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2381 ms. Remains : 1457/5622 places, 2377/5449 transitions.
RANDOM walk for 40000 steps (2365 resets) in 1000 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 336 ms. (118 steps per ms) remains 5/6 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (111 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (128 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
// Phase 1: matrix 2377 rows 1457 cols
[2024-05-24 10:25:15] [INFO ] Computed 102 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 843/896 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 561/1457 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1457 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2377/3834 variables, 1457/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3834 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3834 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3834/3834 variables, and 1559 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2331 ms.
Refiners :[Generalized P Invariants (flows): 102/102 constraints, State Equation: 1457/1457 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 843/896 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 561/1457 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1457 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2377/3834 variables, 1457/1559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3834 variables, 5/1564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3834 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3834 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3834/3834 variables, and 1564 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2839 ms.
Refiners :[Generalized P Invariants (flows): 102/102 constraints, State Equation: 1457/1457 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5229ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 73 ms.
All properties solved without resorting to model-checking.
Total runtime 21430 ms.
ITS solved all properties within timeout
BK_STOP 1716546320716
--------------------
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="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is LeafsetExtension-PT-S32C3, 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 r223-tall-171649611300375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C3.tgz
mv LeafsetExtension-PT-S32C3 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 '
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 ;