Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300070.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Planning-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml
-rw-r--r-- 1 mcc users 1 May 18 16:43 unfinite

--------------------
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 Planning-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME Planning-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716903233092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Planning-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 13:33:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:33:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:33:54] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-28 13:33:54] [INFO ] Transformed 126 places.
[2024-05-28 13:33:54] [INFO ] Transformed 128 transitions.
[2024-05-28 13:33:54] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 2 places and 0 transitions.
[2024-05-28 13:33:54] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:33:55] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:33:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13649675954092228657.gal : 17 ms
[2024-05-28 13:33:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12739746998342892227.prop : 9 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/ReachabilityCardinality13649675954092228657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12739746998342892227.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...330
Loading property file /tmp/ReachabilityCardinality12739746998342892227.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :16 after 256
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :256 after 2688
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :2688 after 14400
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :14400 after 63488
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :63488 after 262144
RANDOM walk for 40000 steps (8 resets) in 2346 ms. (17 steps per ms) remains 13/16 properties
FORMULA Planning-PT-none-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :262144 after 1.05677e+06
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/13 properties
FORMULA Planning-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.05677e+06 after 4.22714e+06
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
[2024-05-28 13:33:56] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 124 cols
[2024-05-28 13:33:56] [INFO ] Computed 42 invariants in 5 ms
[2024-05-28 13:33:56] [INFO ] State equation strengthened by 32 read => feed constraints.
Problem Planning-PT-none-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-08 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 29/29 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/31 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem Planning-PT-none-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 7/118 variables, 7/38 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/39 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/121 variables, 3/42 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/42 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem Planning-PT-none-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem Planning-PT-none-ReachabilityCardinality-2024-15 is UNSAT
FORMULA Planning-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 112/233 variables, 121/163 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 32/195 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/195 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/236 variables, 3/198 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/198 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/236 variables, 0/198 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 198 constraints, problems are : Problem set: 11 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 13:33:56] [INFO ] Deduced a trap composed of 1 places in 37 ms of which 7 ms to minimize.
[2024-05-28 13:33:56] [INFO ] Deduced a trap composed of 1 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:33:56] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2024-05-28 13:33:56] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2024-05-28 13:33:56] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 5/8 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/68 variables, 22/30 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/31 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/70 variables, 2/33 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/86 variables, 5/38 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 4 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 0 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2024-05-28 13:33:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 8/46 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/87 variables, 1/47 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/47 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 85/172 variables, 87/134 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 16/150 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/150 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/188 variables, 13/163 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/188 variables, 0/163 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/199 variables, 16/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/199 variables, 0/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 25/224 variables, 18/197 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/224 variables, 5/202 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/224 variables, 1/203 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/224 variables, 0/203 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/224 variables, 0/203 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/236 variables, and 203 constraints, problems are : Problem set: 11 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 33/36 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 118/124 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 13/13 constraints]
After SMT, in 1003ms problems are : Problem set: 11 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
FORMULA Planning-PT-none-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 3030 ms.

BK_STOP 1716903237404

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Planning-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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 Planning-PT-none, 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 r290-tajo-171654446300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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