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

About the Execution of ITS-Tools for FireWire-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
468.804 63673.00 80720.00 163.60 3.5128E+0006 ? 1 5 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-171734899000288.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-15, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 90K 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 1717368183204

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 22:43:04] [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 22:43:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:43:04] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 22:43:04] [INFO ] Transformed 248 places.
[2024-06-02 22:43:04] [INFO ] Transformed 383 transitions.
[2024-06-02 22:43:04] [INFO ] Found NUPN structural information;
[2024-06-02 22:43:04] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 187 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 248/248 places, 383/383 transitions.
[2024-06-02 22:43:04] [INFO ] Redundant transitions in 22 ms returned []
Running 382 sub problems to find dead transitions.
// Phase 1: matrix 383 rows 248 cols
[2024-06-02 22:43:04] [INFO ] Computed 5 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 6/248 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 19 ms to minimize.
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 116 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 116 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:43:10] [INFO ] Deduced a trap composed of 138 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 131 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 127 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 143 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:43:11] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 3 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 20/273 constraints. Problems are: Problem set: 4 solved, 378 unsolved
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 131 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:12] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:43:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:43:14] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
[2024-06-02 22:43:15] [INFO ] Deduced a trap composed of 130 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:43:15] [INFO ] Deduced a trap composed of 127 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 8/281 constraints. Problems are: Problem set: 18 solved, 364 unsolved
[2024-06-02 22:43:15] [INFO ] Deduced a trap composed of 142 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:43:15] [INFO ] Deduced a trap composed of 156 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:43:15] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:43:16] [INFO ] Deduced a trap composed of 119 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:43:16] [INFO ] Deduced a trap composed of 134 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:43:16] [INFO ] Deduced a trap composed of 153 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:43:16] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 3 ms to minimize.
[2024-06-02 22:43:16] [INFO ] Deduced a trap composed of 153 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 144 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 3 ms to minimize.
[2024-06-02 22:43:18] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:43:18] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:43:19] [INFO ] Deduced a trap composed of 142 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 14/295 constraints. Problems are: Problem set: 18 solved, 364 unsolved
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 133 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 133 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 146 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 6/301 constraints. Problems are: Problem set: 18 solved, 364 unsolved
[2024-06-02 22:43:24] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/303 constraints. Problems are: Problem set: 18 solved, 364 unsolved
[2024-06-02 22:43:27] [INFO ] Deduced a trap composed of 148 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:43:27] [INFO ] Deduced a trap composed of 149 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 2/305 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/305 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 11 (OVERLAPS) 383/631 variables, 248/553 constraints. Problems are: Problem set: 18 solved, 364 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/631 variables, and 553 constraints, problems are : Problem set: 18 solved, 364 unsolved in 30030 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 18 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 6/248 variables, 5/247 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 6/253 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 52/305 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/305 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 383/631 variables, 248/553 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 364/917 constraints. Problems are: Problem set: 18 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/917 constraints. Problems are: Problem set: 18 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 917 constraints, problems are : Problem set: 18 solved, 364 unsolved in 30021 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 364/382 constraints, Known Traps: 52/52 constraints]
After SMT, in 60263ms problems are : Problem set: 18 solved, 364 unsolved
Search for dead transitions found 18 dead transitions in 60292ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 248/248 places, 365/383 transitions.
[2024-06-02 22:44:05] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60459 ms. Remains : 248/248 places, 365/383 transitions.
Final net has 248 places and 365 transitions.
[2024-06-02 22:44:05] [INFO ] Flatten gal took : 57 ms
[2024-06-02 22:44:05] [INFO ] Applying decomposition
[2024-06-02 22:44:05] [INFO ] Flatten gal took : 22 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/graph13016674702721270449.txt' '-o' '/tmp/graph13016674702721270449.bin' '-w' '/tmp/graph13016674702721270449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13016674702721270449.bin' '-l' '-1' '-v' '-w' '/tmp/graph13016674702721270449.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:44:05] [INFO ] Decomposing Gal with order
[2024-06-02 22:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:44:05] [INFO ] Removed a total of 276 redundant transitions.
[2024-06-02 22:44:05] [INFO ] Flatten gal took : 61 ms
[2024-06-02 22:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 12 ms.
[2024-06-02 22:44:05] [INFO ] Time to serialize gal into /tmp/StateSpace6510610496536137035.gal : 8 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/StateSpace6510610496536137035.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 ...219
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,3.51283e+06,1.19751,39660,1242,266,59292,5107,800,129169,162,27033,0
Total reachable state count : 3512832

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 5
STATE_SPACE MAX_TOKEN_PER_MARKING 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 3512832
STATE_SPACE STATES 3512832 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 62472 ms.

BK_STOP 1717368246877

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-15"
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-15, 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-171734899000288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;