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.r549-tall-171734898200287.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 FireWire-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

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

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

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

=== Now, execution of the tool begins

BK_START 1717371368187

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:36:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:36:09] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 23:36:09] [INFO ] Transformed 248 places.
[2024-06-02 23:36:09] [INFO ] Transformed 383 transitions.
[2024-06-02 23:36:09] [INFO ] Found NUPN structural information;
[2024-06-02 23:36:09] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (9 resets) in 1429 ms. (27 steps per ms) remains 15/16 properties
FORMULA FireWire-PT-15-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000 steps (13 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 14/15 properties
FORMULA FireWire-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000 steps (13 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (10 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (12 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (10 resets) in 90 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 152 ms. (26 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (9 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (12 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (11 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
// Phase 1: matrix 383 rows 248 cols
[2024-06-02 23:36:10] [INFO ] Computed 5 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem FireWire-PT-15-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-15-ReachabilityFireability-2024-11 is UNSAT
FORMULA FireWire-PT-15-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 129/248 variables, 5/124 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 129/253 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 383/631 variables, 248/501 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/631 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 501 constraints, problems are : Problem set: 2 solved, 12 unsolved in 1219 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem FireWire-PT-15-ReachabilityFireability-2024-07 is UNSAT
FORMULA FireWire-PT-15-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 136/248 variables, 5/117 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 136/253 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 25 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 3 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 121 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
Problem FireWire-PT-15-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/259 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 3/262 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 1/263 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 383/631 variables, 248/511 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 10/521 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/521 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/631 variables, 0/521 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 521 constraints, problems are : Problem set: 4 solved, 10 unsolved in 3399 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 10/10 constraints]
After SMT, in 4810ms problems are : Problem set: 4 solved, 10 unsolved
Parikh walk visited 0 properties in 9785 ms.
Support contains 89 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 73 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 667 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 234 transition count 361
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 226 transition count 357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 222 transition count 357
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 27 place count 222 transition count 352
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 37 place count 217 transition count 352
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 76 place count 178 transition count 313
Iterating global reduction 3 with 39 rules applied. Total rules applied 115 place count 178 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 178 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 117 place count 178 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 177 transition count 310
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 125 place count 171 transition count 303
Iterating global reduction 4 with 6 rules applied. Total rules applied 131 place count 171 transition count 303
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 149 place count 162 transition count 294
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 159 place count 157 transition count 327
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 157 transition count 323
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 167 place count 153 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 153 transition count 322
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 153 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 152 transition count 321
Applied a total of 171 rules in 103 ms. Remains 152 /248 variables (removed 96) and now considering 321/383 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 152/248 places, 321/383 transitions.
RANDOM walk for 40000 steps (1770 resets) in 401 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (626 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (628 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (609 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (645 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (642 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (636 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (650 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (550 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (629 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (655 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
Probably explored full state space saw : 220099 states, properties seen :8
Probabilistic random walk after 995822 steps, saw 220099 distinct states, run finished after 2520 ms. (steps per millisecond=395 ) properties seen :8
FORMULA FireWire-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 220099 states, properties seen :0
Exhaustive walk after 995822 steps, saw 220099 distinct states, run finished after 2251 ms. (steps per millisecond=442 ) properties seen :0
FORMULA FireWire-PT-15-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA FireWire-PT-15-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 21027 ms.
ITS solved all properties within timeout

BK_STOP 1717371390315

--------------------
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="FireWire-PT-15"
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 FireWire-PT-15, 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 r549-tall-171734898200287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "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 ;