Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611300382.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LeafsetExtension-PT-S32C4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716548387200

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 10:59:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 10:59:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:59:48] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2024-05-24 10:59:48] [INFO ] Transformed 5622 places.
[2024-05-24 10:59:48] [INFO ] Transformed 5449 transitions.
[2024-05-24 10:59:48] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1201 resets) in 2548 ms. (15 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (66 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (68 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 518 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (68 resets) in 320 ms. (124 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (69 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (68 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 809 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (32 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 10:59:51] [INFO ] Computed 173 invariants in 402 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 5269/5448 variables, 94/95 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5448 variables, 0/95 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 34/5482 variables, 34/129 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5482 variables, 0/129 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/5622 variables, 44/173 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11071/11071 variables, and 5795 constraints, problems are : Problem set: 9 solved, 1 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5003/5027 variables, 28/28 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-24 11:00:02] [INFO ] Deduced a trap composed of 166 places in 5681 ms of which 245 ms to minimize.
SMT process timed out in 11710ms, After SMT, problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 579 are kept as prefixes of interest. Removing 5043 places using SCC suffix rule.11 ms
Discarding 5043 places :
Also discarding 2840 output transitions
Drop transitions (Output transitions of discarded places.) removed 2840 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1058 transitions
Reduce isomorphic transitions removed 1058 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 1247 rules applied. Total rules applied 1248 place count 579 transition count 1362
Reduce places removed 191 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 201 rules applied. Total rules applied 1449 place count 388 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1459 place count 378 transition count 1352
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 1459 place count 378 transition count 1338
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1487 place count 364 transition count 1338
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1502 place count 349 transition count 1323
Iterating global reduction 3 with 15 rules applied. Total rules applied 1517 place count 349 transition count 1323
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1521 place count 349 transition count 1319
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1525 place count 345 transition count 1319
Partial Free-agglomeration rule applied 135 times.
Drop transitions (Partial Free agglomeration) removed 135 transitions
Iterating global reduction 4 with 135 rules applied. Total rules applied 1660 place count 345 transition count 1319
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 4 with 9 rules applied. Total rules applied 1669 place count 336 transition count 1319
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1675 place count 336 transition count 1313
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1681 place count 330 transition count 1313
Applied a total of 1681 rules in 231 ms. Remains 330 /5622 variables (removed 5292) and now considering 1313/5449 (removed 4136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 330/5622 places, 1313/5449 transitions.
RANDOM walk for 40000 steps (3565 resets) in 1328 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (154 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194360 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194360 steps, saw 53126 distinct states, run finished after 3011 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-24 11:00:05] [INFO ] Flow matrix only has 493 transitions (discarded 820 similar events)
// Phase 1: matrix 493 rows 330 cols
[2024-05-24 11:00:05] [INFO ] Computed 3 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/237 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 460/697 variables, 223/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 126/823 variables, 81/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/823 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/237 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 460/697 variables, 223/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 126/823 variables, 81/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/823 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1064ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 18636 ms.
ITS solved all properties within timeout

BK_STOP 1716548407127

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../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="LeafsetExtension-PT-S32C4"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LeafsetExtension-PT-S32C4, 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 r223-tall-171649611300382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C4.tgz
mv LeafsetExtension-PT-S32C4 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 ;