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-171649611400399.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-S64C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611400399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K 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 14M 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-S64C3-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716550943299

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 11:42:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 11:42:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:42:25] [INFO ] Load time of PNML (sax parser for PT used): 681 ms
[2024-05-24 11:42:25] [INFO ] Transformed 21462 places.
[2024-05-24 11:42:25] [INFO ] Transformed 21129 transitions.
[2024-05-24 11:42:25] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 895 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1541 resets) in 3627 ms. (11 steps per ms) remains 12/16 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (56 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (57 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 447 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 549 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 497 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 144 ms. (275 steps per ms) remains 11/12 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 197 ms. (202 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 142 ms. (279 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 157 ms. (253 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 11:42:30] [INFO ] Computed 333 invariants in 2576 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 14/140 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19728/19868 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19868/42591 variables, and 112 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5084 ms.
Refiners :[Positive P Invariants (semi-flows): 14/67 constraints, Generalized P Invariants (flows): 98/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 14/140 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19728/19868 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 11:44:01] [INFO ] Deduced a trap composed of 361 places in 81687 ms of which 882 ms to minimize.
SMT process timed out in 93731ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 10194 are kept as prefixes of interest. Removing 11268 places using SCC suffix rule.35 ms
Discarding 11268 places :
Also discarding 5583 output transitions
Drop transitions (Output transitions of discarded places.) removed 5583 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1402 transitions
Reduce isomorphic transitions removed 1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3613 transitions
Trivial Post-agglo rules discarded 3613 transitions
Performed 3613 trivial Post agglomeration. Transition count delta: 3613
Iterating post reduction 0 with 5015 rules applied. Total rules applied 5016 place count 10194 transition count 10531
Reduce places removed 3614 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 3619 rules applied. Total rules applied 8635 place count 6580 transition count 10526
Reduce places removed 5 places and 0 transitions.
Performed 828 Post agglomeration using F-continuation condition.Transition count delta: 828
Iterating post reduction 2 with 833 rules applied. Total rules applied 9468 place count 6575 transition count 9698
Reduce places removed 828 places and 0 transitions.
Iterating post reduction 3 with 828 rules applied. Total rules applied 10296 place count 5747 transition count 9698
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 10296 place count 5747 transition count 9631
Deduced a syphon composed of 67 places in 8 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 10430 place count 5680 transition count 9631
Discarding 2679 places :
Symmetric choice reduction at 4 with 2679 rule applications. Total rules 13109 place count 3001 transition count 6952
Iterating global reduction 4 with 2679 rules applied. Total rules applied 15788 place count 3001 transition count 6952
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 15818 place count 2971 transition count 6922
Iterating global reduction 4 with 30 rules applied. Total rules applied 15848 place count 2971 transition count 6922
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 15860 place count 2971 transition count 6910
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 15872 place count 2959 transition count 6910
Partial Free-agglomeration rule applied 185 times.
Drop transitions (Partial Free agglomeration) removed 185 transitions
Iterating global reduction 5 with 185 rules applied. Total rules applied 16057 place count 2959 transition count 6910
Applied a total of 16057 rules in 3254 ms. Remains 2959 /21462 variables (removed 18503) and now considering 6910/21129 (removed 14219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3269 ms. Remains : 2959/21462 places, 6910/21129 transitions.
RANDOM walk for 40000 steps (2983 resets) in 1155 ms. (34 steps per ms) remains 2/8 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 688 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
[2024-05-24 11:44:05] [INFO ] Flow matrix only has 5238 transitions (discarded 1672 similar events)
// Phase 1: matrix 5238 rows 2959 cols
[2024-05-24 11:44:05] [INFO ] Computed 115 invariants in 102 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 712/786 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/787 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1672/2459 variables, 787/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2459 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4091/6550 variables, 538/1353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6550 variables, 6/1359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6550 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1480/8030 variables, 81/1440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8030 variables, 1465/2905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8030 variables, 0/2905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 167/8197 variables, 169/3074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8197 variables, 0/3074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/8197 variables, 0/3074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8197/8197 variables, and 3074 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2920 ms.
Refiners :[Generalized P Invariants (flows): 115/115 constraints, State Equation: 2959/2959 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 712/786 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/787 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1672/2459 variables, 787/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2459 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4091/6550 variables, 538/1353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6550 variables, 6/1359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6550 variables, 2/1361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6550 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1480/8030 variables, 81/1442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8030 variables, 1465/2907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8030 variables, 0/2907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 167/8197 variables, 169/3076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8197 variables, 0/3076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/8197 variables, 0/3076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8197/8197 variables, and 3076 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4505 ms.
Refiners :[Generalized P Invariants (flows): 115/115 constraints, State Equation: 2959/2959 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 7623ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 20 ms.
All properties solved without resorting to model-checking.
Total runtime 108535 ms.
ITS solved all properties within timeout

BK_STOP 1716551052989

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-S64C3"
export BK_EXAMINATION="ReachabilityFireability"
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-S64C3, examination is ReachabilityFireability"
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-171649611400399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C3.tgz
mv LeafsetExtension-PT-S64C3 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;