About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
760.199 | 19467.00 | 39824.00 | 48.00 | TTTTFFTFFTTFFTTT | 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.r508-tall-171654350700006.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 MultiCrashLeafsetExtension-PT-S16C02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 07:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717194970225
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:36:11] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-31 22:36:11] [INFO ] Transformed 2952 places.
[2024-05-31 22:36:11] [INFO ] Transformed 4255 transitions.
[2024-05-31 22:36:11] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1873 resets) in 2307 ms. (17 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (468 resets) in 542 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 285 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 1062 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 328 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (467 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (467 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (468 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
[2024-05-31 22:36:14] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2024-05-31 22:36:14] [INFO ] Computed 421 invariants in 178 ms
[2024-05-31 22:36:14] [INFO ] State equation strengthened by 1090 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 663/904 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/936 variables, 32/40 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/936 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 1676/2612 variables, 229/269 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2612 variables, 0/269 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/2615 variables, 3/272 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2615 variables, 0/272 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 324/2939 variables, 136/408 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2939 variables, 0/408 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/2952 variables, 13/421 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2952 variables, 0/421 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3983/6935 variables, 2952/3373 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/6935 variables, 1090/4463 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6935 variables, 0/4463 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/6935 variables, 0/4463 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6935/6935 variables, and 4463 constraints, problems are : Problem set: 9 solved, 2 unsolved in 4021 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 379/379 constraints, State Equation: 2952/2952 constraints, ReadFeed: 1090/1090 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 708/772 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-31 22:36:18] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 47 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 98 places in 307 ms of which 5 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 139 places in 269 ms of which 5 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 111 places in 256 ms of which 4 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 139 places in 295 ms of which 5 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 128 places in 248 ms of which 5 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 139 places in 291 ms of which 5 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 139 places in 292 ms of which 5 ms to minimize.
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/772 variables, 8/12 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/772 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/804 variables, 32/44 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/44 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1593/2397 variables, 188/232 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-05-31 22:36:23] [INFO ] Deduced a trap composed of 197 places in 1612 ms of which 17 ms to minimize.
[2024-05-31 22:36:24] [INFO ] Deduced a trap composed of 461 places in 1709 ms of which 16 ms to minimize.
SMT process timed out in 10756ms, After SMT, problems are : Problem set: 10 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.13 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 517 rules applied. Total rules applied 518 place count 2928 transition count 3738
Reduce places removed 517 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 533 rules applied. Total rules applied 1051 place count 2411 transition count 3722
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1067 place count 2395 transition count 3722
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 1067 place count 2395 transition count 3656
Deduced a syphon composed of 66 places in 6 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 1199 place count 2329 transition count 3656
Discarding 457 places :
Symmetric choice reduction at 3 with 457 rule applications. Total rules 1656 place count 1872 transition count 3199
Iterating global reduction 3 with 457 rules applied. Total rules applied 2113 place count 1872 transition count 3199
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 2330 place count 1655 transition count 2765
Iterating global reduction 3 with 217 rules applied. Total rules applied 2547 place count 1655 transition count 2765
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2581 place count 1638 transition count 2748
Free-agglomeration rule (complex) applied 174 times.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2755 place count 1638 transition count 2765
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 3 with 174 rules applied. Total rules applied 2929 place count 1464 transition count 2765
Partial Free-agglomeration rule applied 67 times.
Drop transitions (Partial Free agglomeration) removed 67 transitions
Iterating global reduction 4 with 67 rules applied. Total rules applied 2996 place count 1464 transition count 2765
Applied a total of 2996 rules in 1219 ms. Remains 1464 /2952 variables (removed 1488) and now considering 2765/4255 (removed 1490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 1464/2952 places, 2765/4255 transitions.
RANDOM walk for 40000 steps (2947 resets) in 734 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (513 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
Probably explored full state space saw : 18202 states, properties seen :0
Probabilistic random walk after 40825 steps, saw 18202 distinct states, run finished after 1708 ms. (steps per millisecond=23 ) properties seen :0
Explored full state space saw : 18202 states, properties seen :0
Exhaustive walk after 40825 steps, saw 18202 distinct states, run finished after 1548 ms. (steps per millisecond=26 ) properties seen :0
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 18227 ms.
ITS solved all properties within timeout
BK_STOP 1717194989692
--------------------
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="MultiCrashLeafsetExtension-PT-S16C02"
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 MultiCrashLeafsetExtension-PT-S16C02, 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 r508-tall-171654350700006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C02.tgz
mv MultiCrashLeafsetExtension-PT-S16C02 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 ;