About the Execution of ITS-Tools for FireWire-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3162.296 | 202592.00 | 227516.00 | 546.00 | 8.8090E+0011 ? 1 9 | 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.r550-tall-171734899100312.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 itstools
Input is FireWire-PT-18, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100312
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 168K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
no data necessary for post analysis
=== Now, execution of the tool begins
BK_START 1717370607215
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 23:23:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:23:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:23:28] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 23:23:28] [INFO ] Transformed 437 places.
[2024-06-02 23:23:28] [INFO ] Transformed 707 transitions.
[2024-06-02 23:23:28] [INFO ] Found NUPN structural information;
[2024-06-02 23:23:28] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 195 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 437/437 places, 707/707 transitions.
[2024-06-02 23:23:28] [INFO ] Redundant transitions in 36 ms returned []
Running 706 sub problems to find dead transitions.
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 23:23:28] [INFO ] Computed 9 invariants in 32 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 426/426 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (OVERLAPS) 11/437 variables, 9/435 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 11/446 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:23:42] [INFO ] Deduced a trap composed of 223 places in 287 ms of which 36 ms to minimize.
[2024-06-02 23:23:43] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:23:43] [INFO ] Deduced a trap composed of 80 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:23:43] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 14 ms to minimize.
[2024-06-02 23:23:43] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:23:44] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 4 ms to minimize.
[2024-06-02 23:23:44] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:23:44] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 3 ms to minimize.
[2024-06-02 23:23:45] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:23:45] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:23:45] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:23:45] [INFO ] Deduced a trap composed of 128 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:23:45] [INFO ] Deduced a trap composed of 130 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:23:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:23:46] [INFO ] Deduced a trap composed of 127 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:23:46] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:23:46] [INFO ] Deduced a trap composed of 119 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:23:46] [INFO ] Deduced a trap composed of 124 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:23:47] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:23:47] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 20/466 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:23:48] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:23:48] [INFO ] Deduced a trap composed of 127 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:23:48] [INFO ] Deduced a trap composed of 133 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:23:48] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:23:48] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:23:49] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:23:49] [INFO ] Deduced a trap composed of 134 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:23:50] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:23:50] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:23:50] [INFO ] Deduced a trap composed of 119 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:23:50] [INFO ] Deduced a trap composed of 142 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:23:51] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:23:51] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:23:51] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:23:51] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-06-02 23:23:51] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 248 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 141 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 117 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 143 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 140 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 137 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:23:55] [INFO ] Deduced a trap composed of 128 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:23:57] [INFO ] Deduced a trap composed of 128 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:23:58] [INFO ] Deduced a trap composed of 141 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/1144 variables, and 495 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30022 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/437 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 426/426 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (OVERLAPS) 11/437 variables, 9/435 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 11/446 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 49/495 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 131 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:24:07] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 2 ms to minimize.
[2024-06-02 23:24:07] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:24:07] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:24:08] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 5/500 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 243 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 252 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 237 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 251 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 269 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 251 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 247 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 248 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 263 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 250 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 252 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 264 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 285 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:24:15] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:24:15] [INFO ] Deduced a trap composed of 139 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:24:17] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 17/517 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 126 places in 63 ms of which 2 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 214 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/1144 variables, and 520 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30020 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/437 constraints, PredecessorRefiner: 0/706 constraints, Known Traps: 74/74 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60680 ms. Remains : 437/437 places, 707/707 transitions.
Final net has 437 places and 707 transitions.
[2024-06-02 23:24:29] [INFO ] Flatten gal took : 94 ms
[2024-06-02 23:24:29] [INFO ] Applying decomposition
[2024-06-02 23:24:29] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2977559074078525615.txt' '-o' '/tmp/graph2977559074078525615.bin' '-w' '/tmp/graph2977559074078525615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2977559074078525615.bin' '-l' '-1' '-v' '-w' '/tmp/graph2977559074078525615.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:24:29] [INFO ] Decomposing Gal with order
[2024-06-02 23:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:24:29] [INFO ] Removed a total of 676 redundant transitions.
[2024-06-02 23:24:29] [INFO ] Flatten gal took : 85 ms
[2024-06-02 23:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 20 ms.
[2024-06-02 23:24:29] [INFO ] Time to serialize gal into /tmp/StateSpace16005745542560954210.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace16005745542560954210.gal' '-t' 'CGAL' '--stats'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.80904e+11,139.633,2578192,7956,425,2.16472e+06,23090,1360,2.42426e+07,174,143570,0
Total reachable state count : 880903951242
Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 9
STATE_SPACE MAX_TOKEN_PER_MARKING 9 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 880903951242
STATE_SPACE STATES 880903951242 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 201452 ms.
BK_STOP 1717370809807
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FireWire-PT-18"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-18, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899100312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;