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.r047-tajo-171620398400511.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 greatspnxred
Input is BusinessProcesses-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K 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 BusinessProcesses-PT-08-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716304439195

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:14:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:14:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:14:00] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-21 15:14:00] [INFO ] Transformed 393 places.
[2024-05-21 15:14:00] [INFO ] Transformed 344 transitions.
[2024-05-21 15:14:00] [INFO ] Found NUPN structural information;
[2024-05-21 15:14:00] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 13 transitions.
RANDOM walk for 40000 steps (333 resets) in 1071 ms. (37 steps per ms) remains 3/16 properties
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (69 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 1208 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
// Phase 1: matrix 331 rows 380 cols
[2024-05-21 15:14:02] [INFO ] Computed 58 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 280/351 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 280/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/380 variables, 14/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 29/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 331/711 variables, 380/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:14:03] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 30 ms to minimize.
[2024-05-21 15:14:03] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:14:03] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
Problem BusinessProcesses-PT-08-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/711 variables, 3/821 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/711 variables, 0/821 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/711 variables, 0/821 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 711/711 variables, and 821 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1621 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem BusinessProcesses-PT-08-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 288/348 variables, 44/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 288/392 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:14:03] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 4 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:14:04] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 4 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 4 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:14:05] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/412 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:14:06] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 5 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 7 ms to minimize.
[2024-05-21 15:14:07] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 6 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:14:08] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 6832ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (complete) has 734 edges and 380 vertex of which 371 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 371 transition count 261
Reduce places removed 68 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 303 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 142 place count 301 transition count 259
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 301 transition count 188
Deduced a syphon composed of 71 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 294 place count 220 transition count 188
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 362 place count 152 transition count 120
Iterating global reduction 3 with 68 rules applied. Total rules applied 430 place count 152 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 432 place count 152 transition count 118
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 434 place count 151 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 434 place count 151 transition count 112
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 446 place count 144 transition count 112
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 546 place count 94 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 547 place count 93 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 548 place count 92 transition count 61
Applied a total of 548 rules in 154 ms. Remains 92 /380 variables (removed 288) and now considering 61/331 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 92/380 places, 61/331 transitions.
RANDOM walk for 30036 steps (6 resets) in 782 ms. (38 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8645 ms.
ITS solved all properties within timeout

BK_STOP 1716304449568

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r047-tajo-171620398400511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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