fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477500482
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldPPPs-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.020 3600000.00 3136842.00 1145.80 ?T???F?TF?TF??TT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477500482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldPPPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477500482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 3.7K May 14 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 172K May 12 20: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 ShieldPPPs-PT-010B-00
FORMULA_NAME ShieldPPPs-PT-010B-01
FORMULA_NAME ShieldPPPs-PT-010B-02
FORMULA_NAME ShieldPPPs-PT-010B-03
FORMULA_NAME ShieldPPPs-PT-010B-04
FORMULA_NAME ShieldPPPs-PT-010B-05
FORMULA_NAME ShieldPPPs-PT-010B-06
FORMULA_NAME ShieldPPPs-PT-010B-07
FORMULA_NAME ShieldPPPs-PT-010B-08
FORMULA_NAME ShieldPPPs-PT-010B-09
FORMULA_NAME ShieldPPPs-PT-010B-10
FORMULA_NAME ShieldPPPs-PT-010B-11
FORMULA_NAME ShieldPPPs-PT-010B-12
FORMULA_NAME ShieldPPPs-PT-010B-13
FORMULA_NAME ShieldPPPs-PT-010B-14
FORMULA_NAME ShieldPPPs-PT-010B-15

=== Now, execution of the tool begins

BK_START 1591308928056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 22:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 22:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 22:15:30] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2020-06-04 22:15:30] [INFO ] Transformed 683 places.
[2020-06-04 22:15:30] [INFO ] Transformed 633 transitions.
[2020-06-04 22:15:30] [INFO ] Found NUPN structural information;
[2020-06-04 22:15:30] [INFO ] Parsed PT model containing 683 places and 633 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 61 resets, run finished after 484 ms. (steps per millisecond=206 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 633 rows 683 cols
[2020-06-04 22:15:31] [INFO ] Computed 111 place invariants in 21 ms
[2020-06-04 22:15:31] [INFO ] [Real]Absence check using 111 positive place invariants in 167 ms returned sat
[2020-06-04 22:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:15:33] [INFO ] [Real]Absence check using state equation in 1378 ms returned sat
[2020-06-04 22:15:33] [INFO ] Deduced a trap composed of 17 places in 627 ms
[2020-06-04 22:15:34] [INFO ] Deduced a trap composed of 17 places in 395 ms
[2020-06-04 22:15:34] [INFO ] Deduced a trap composed of 10 places in 273 ms
[2020-06-04 22:15:34] [INFO ] Deduced a trap composed of 21 places in 248 ms
[2020-06-04 22:15:35] [INFO ] Deduced a trap composed of 19 places in 205 ms
[2020-06-04 22:15:35] [INFO ] Deduced a trap composed of 23 places in 187 ms
[2020-06-04 22:15:35] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-06-04 22:15:35] [INFO ] Deduced a trap composed of 26 places in 169 ms
[2020-06-04 22:15:35] [INFO ] Deduced a trap composed of 36 places in 186 ms
[2020-06-04 22:15:36] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-06-04 22:15:36] [INFO ] Deduced a trap composed of 36 places in 156 ms
[2020-06-04 22:15:36] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2020-06-04 22:15:36] [INFO ] Deduced a trap composed of 33 places in 208 ms
[2020-06-04 22:15:36] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2020-06-04 22:15:37] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-06-04 22:15:37] [INFO ] Deduced a trap composed of 32 places in 142 ms
[2020-06-04 22:15:37] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-06-04 22:15:37] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-04 22:15:37] [INFO ] Deduced a trap composed of 33 places in 178 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 40 places in 140 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 24 places in 159 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 25 places in 134 ms
[2020-06-04 22:15:38] [INFO ] Deduced a trap composed of 40 places in 133 ms
[2020-06-04 22:15:38] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5760 ms
[2020-06-04 22:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:15:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 179 ms returned sat
[2020-06-04 22:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:15:40] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-06-04 22:15:40] [INFO ] Deduced a trap composed of 25 places in 397 ms
[2020-06-04 22:15:41] [INFO ] Deduced a trap composed of 17 places in 435 ms
[2020-06-04 22:15:41] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-06-04 22:15:41] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2020-06-04 22:15:41] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 22 places in 243 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 26 places in 188 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 25 places in 213 ms
[2020-06-04 22:15:42] [INFO ] Deduced a trap composed of 10 places in 134 ms
[2020-06-04 22:15:43] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-06-04 22:15:43] [INFO ] Deduced a trap composed of 23 places in 220 ms
[2020-06-04 22:15:43] [INFO ] Deduced a trap composed of 27 places in 209 ms
[2020-06-04 22:15:43] [INFO ] Deduced a trap composed of 27 places in 215 ms
[2020-06-04 22:15:44] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2020-06-04 22:15:44] [INFO ] Deduced a trap composed of 28 places in 190 ms
[2020-06-04 22:15:44] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-06-04 22:15:44] [INFO ] Deduced a trap composed of 22 places in 202 ms
[2020-06-04 22:15:44] [INFO ] Deduced a trap composed of 27 places in 190 ms
[2020-06-04 22:15:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4719 ms
[2020-06-04 22:15:44] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 44 ms.
[2020-06-04 22:15:58] [INFO ] Added : 613 causal constraints over 126 iterations in 13229 ms. Result :unknown
[2020-06-04 22:15:58] [INFO ] [Real]Absence check using 111 positive place invariants in 80 ms returned sat
[2020-06-04 22:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:15:59] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2020-06-04 22:15:59] [INFO ] Deduced a trap composed of 20 places in 245 ms
[2020-06-04 22:15:59] [INFO ] Deduced a trap composed of 17 places in 252 ms
[2020-06-04 22:16:00] [INFO ] Deduced a trap composed of 28 places in 231 ms
[2020-06-04 22:16:00] [INFO ] Deduced a trap composed of 25 places in 240 ms
[2020-06-04 22:16:00] [INFO ] Deduced a trap composed of 26 places in 269 ms
[2020-06-04 22:16:01] [INFO ] Deduced a trap composed of 34 places in 252 ms
[2020-06-04 22:16:01] [INFO ] Deduced a trap composed of 34 places in 287 ms
[2020-06-04 22:16:01] [INFO ] Deduced a trap composed of 27 places in 265 ms
[2020-06-04 22:16:01] [INFO ] Deduced a trap composed of 19 places in 249 ms
[2020-06-04 22:16:02] [INFO ] Deduced a trap composed of 17 places in 251 ms
[2020-06-04 22:16:02] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-06-04 22:16:02] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-06-04 22:16:03] [INFO ] Deduced a trap composed of 24 places in 245 ms
[2020-06-04 22:16:03] [INFO ] Deduced a trap composed of 22 places in 205 ms
[2020-06-04 22:16:03] [INFO ] Deduced a trap composed of 23 places in 226 ms
[2020-06-04 22:16:03] [INFO ] Deduced a trap composed of 24 places in 192 ms
[2020-06-04 22:16:03] [INFO ] Deduced a trap composed of 24 places in 184 ms
[2020-06-04 22:16:04] [INFO ] Deduced a trap composed of 25 places in 212 ms
[2020-06-04 22:16:04] [INFO ] Deduced a trap composed of 24 places in 183 ms
[2020-06-04 22:16:04] [INFO ] Deduced a trap composed of 31 places in 187 ms
[2020-06-04 22:16:04] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-06-04 22:16:05] [INFO ] Deduced a trap composed of 22 places in 207 ms
[2020-06-04 22:16:05] [INFO ] Deduced a trap composed of 28 places in 206 ms
[2020-06-04 22:16:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6021 ms
[2020-06-04 22:16:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:16:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 179 ms returned sat
[2020-06-04 22:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:16:06] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2020-06-04 22:16:06] [INFO ] Deduced a trap composed of 21 places in 248 ms
[2020-06-04 22:16:07] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2020-06-04 22:16:07] [INFO ] Deduced a trap composed of 19 places in 249 ms
[2020-06-04 22:16:07] [INFO ] Deduced a trap composed of 23 places in 262 ms
[2020-06-04 22:16:07] [INFO ] Deduced a trap composed of 23 places in 238 ms
[2020-06-04 22:16:08] [INFO ] Deduced a trap composed of 33 places in 265 ms
[2020-06-04 22:16:08] [INFO ] Deduced a trap composed of 31 places in 235 ms
[2020-06-04 22:16:08] [INFO ] Deduced a trap composed of 33 places in 202 ms
[2020-06-04 22:16:08] [INFO ] Deduced a trap composed of 21 places in 202 ms
[2020-06-04 22:16:09] [INFO ] Deduced a trap composed of 24 places in 263 ms
[2020-06-04 22:16:09] [INFO ] Deduced a trap composed of 23 places in 254 ms
[2020-06-04 22:16:09] [INFO ] Deduced a trap composed of 23 places in 213 ms
[2020-06-04 22:16:10] [INFO ] Deduced a trap composed of 22 places in 221 ms
[2020-06-04 22:16:10] [INFO ] Deduced a trap composed of 26 places in 241 ms
[2020-06-04 22:16:10] [INFO ] Deduced a trap composed of 17 places in 236 ms
[2020-06-04 22:16:10] [INFO ] Deduced a trap composed of 27 places in 239 ms
[2020-06-04 22:16:11] [INFO ] Deduced a trap composed of 23 places in 207 ms
[2020-06-04 22:16:11] [INFO ] Deduced a trap composed of 29 places in 237 ms
[2020-06-04 22:16:11] [INFO ] Deduced a trap composed of 25 places in 247 ms
[2020-06-04 22:16:11] [INFO ] Deduced a trap composed of 10 places in 273 ms
[2020-06-04 22:16:12] [INFO ] Deduced a trap composed of 19 places in 233 ms
[2020-06-04 22:16:12] [INFO ] Deduced a trap composed of 22 places in 244 ms
[2020-06-04 22:16:12] [INFO ] Deduced a trap composed of 44 places in 233 ms
[2020-06-04 22:16:12] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-06-04 22:16:13] [INFO ] Deduced a trap composed of 24 places in 244 ms
[2020-06-04 22:16:13] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-06-04 22:16:13] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2020-06-04 22:16:13] [INFO ] Deduced a trap composed of 26 places in 244 ms
[2020-06-04 22:16:14] [INFO ] Deduced a trap composed of 22 places in 244 ms
[2020-06-04 22:16:14] [INFO ] Deduced a trap composed of 40 places in 203 ms
[2020-06-04 22:16:14] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-06-04 22:16:14] [INFO ] Deduced a trap composed of 23 places in 210 ms
[2020-06-04 22:16:15] [INFO ] Deduced a trap composed of 25 places in 199 ms
[2020-06-04 22:16:15] [INFO ] Deduced a trap composed of 39 places in 184 ms
[2020-06-04 22:16:15] [INFO ] Deduced a trap composed of 28 places in 237 ms
[2020-06-04 22:16:15] [INFO ] Deduced a trap composed of 28 places in 201 ms
[2020-06-04 22:16:16] [INFO ] Deduced a trap composed of 23 places in 218 ms
[2020-06-04 22:16:16] [INFO ] Deduced a trap composed of 27 places in 168 ms
[2020-06-04 22:16:16] [INFO ] Deduced a trap composed of 37 places in 176 ms
[2020-06-04 22:16:16] [INFO ] Deduced a trap composed of 27 places in 273 ms
[2020-06-04 22:16:17] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2020-06-04 22:16:17] [INFO ] Deduced a trap composed of 31 places in 198 ms
[2020-06-04 22:16:17] [INFO ] Deduced a trap composed of 17 places in 202 ms
[2020-06-04 22:16:17] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-06-04 22:16:17] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 11157 ms
[2020-06-04 22:16:17] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 44 ms.
[2020-06-04 22:16:22] [INFO ] Added : 620 causal constraints over 126 iterations in 5224 ms. Result :sat
[2020-06-04 22:16:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 22:16:23] [INFO ] Flatten gal took : 107 ms
FORMULA ShieldPPPs-PT-010B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 22:16:23] [INFO ] Applying decomposition
[2020-06-04 22:16:23] [INFO ] Flatten gal took : 42 ms
[2020-06-04 22:16:23] [INFO ] Decomposing Gal with order
[2020-06-04 22:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 22:16:23] [INFO ] Removed a total of 60 redundant transitions.
[2020-06-04 22:16:23] [INFO ] Flatten gal took : 107 ms
[2020-06-04 22:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 16 ms.
[2020-06-04 22:16:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 22:16:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPs-PT-010B @ 3570 seconds

FORMULA ShieldPPPs-PT-010B-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11030412 kB
After kill :
MemTotal: 16427456 kB
MemFree: 11031856 kB

--------------------
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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPs-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477500482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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