fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853300479
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.640 3600000.00 21402.00 41.60 TTTFFTFFFFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300479.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ParamProductionCell-PT-1, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K Mar 24 05:37 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 ParamProductionCell-PT-1-ReachabilityFireability-00
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-01
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-02
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-03
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-04
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-05
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-06
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-07
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-08
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-09
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-10
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-11
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-12
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-13
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-14
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591150943006

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:22:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:22:25] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2020-06-03 02:22:25] [INFO ] Transformed 231 places.
[2020-06-03 02:22:25] [INFO ] Transformed 202 transitions.
[2020-06-03 02:22:25] [INFO ] Found NUPN structural information;
[2020-06-03 02:22:25] [INFO ] Parsed PT model containing 231 places and 202 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:22:26] [INFO ] Computed 59 place invariants in 16 ms
[2020-06-03 02:22:26] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 02:22:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:26] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2020-06-03 02:22:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-06-03 02:22:26] [INFO ] [Real]Added 68 Read/Feed constraints in 50 ms returned sat
[2020-06-03 02:22:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 02:22:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:27] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-06-03 02:22:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2020-06-03 02:22:27] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2020-06-03 02:22:27] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 02:22:27] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2020-06-03 02:22:27] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-06-03 02:22:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 424 ms
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned unsat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned unsat
[2020-06-03 02:22:28] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned unsat
[2020-06-03 02:22:28] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:28] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Real]Added 68 Read/Feed constraints in 57 ms returned sat
[2020-06-03 02:22:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:28] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-06-03 02:22:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 92 ms returned sat
[2020-06-03 02:22:28] [INFO ] Deduced a trap composed of 7 places in 148 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 10 places in 126 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2020-06-03 02:22:29] [INFO ] Deduced a trap composed of 74 places in 72 ms
[2020-06-03 02:22:30] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-03 02:22:30] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-06-03 02:22:30] [INFO ] Deduced a trap composed of 75 places in 100 ms
[2020-06-03 02:22:30] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-03 02:22:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1683 ms
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned unsat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned unsat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned unsat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:30] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Real]Added 68 Read/Feed constraints in 21 ms returned sat
[2020-06-03 02:22:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 02:22:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-03 02:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:31] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-03 02:22:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2020-06-03 02:22:31] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2020-06-03 02:22:31] [INFO ] Deduced a trap composed of 10 places in 156 ms
[2020-06-03 02:22:31] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 41 places in 105 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 10 places in 108 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-06-03 02:22:32] [INFO ] Deduced a trap composed of 42 places in 87 ms
[2020-06-03 02:22:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1434 ms
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is ParamProductionCell-PT-1, 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 r174-csrt-158987853300479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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