fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r227-tall-162098230900133
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldIIPs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5176.132 3600000.00 3625174.00 11290.60 TFT????FFTFTT?TF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098230900133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldIIPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230900133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 332K May 5 16:52 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 ShieldIIPs-PT-020B-00
FORMULA_NAME ShieldIIPs-PT-020B-01
FORMULA_NAME ShieldIIPs-PT-020B-02
FORMULA_NAME ShieldIIPs-PT-020B-03
FORMULA_NAME ShieldIIPs-PT-020B-04
FORMULA_NAME ShieldIIPs-PT-020B-05
FORMULA_NAME ShieldIIPs-PT-020B-06
FORMULA_NAME ShieldIIPs-PT-020B-07
FORMULA_NAME ShieldIIPs-PT-020B-08
FORMULA_NAME ShieldIIPs-PT-020B-09
FORMULA_NAME ShieldIIPs-PT-020B-10
FORMULA_NAME ShieldIIPs-PT-020B-11
FORMULA_NAME ShieldIIPs-PT-020B-12
FORMULA_NAME ShieldIIPs-PT-020B-13
FORMULA_NAME ShieldIIPs-PT-020B-14
FORMULA_NAME ShieldIIPs-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621131384970

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 02:16:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 02:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 02:16:26] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2021-05-16 02:16:26] [INFO ] Transformed 1203 places.
[2021-05-16 02:16:26] [INFO ] Transformed 1183 transitions.
[2021-05-16 02:16:26] [INFO ] Found NUPN structural information;
[2021-05-16 02:16:26] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 39 resets, run finished after 825 ms. (steps per millisecond=121 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 1183 rows 1203 cols
[2021-05-16 02:16:27] [INFO ] Computed 181 place invariants in 100 ms
[2021-05-16 02:16:28] [INFO ] [Real]Absence check using 181 positive place invariants in 157 ms returned sat
[2021-05-16 02:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:16:31] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2021-05-16 02:16:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:16:31] [INFO ] [Nat]Absence check using 181 positive place invariants in 42 ms returned unsat
[2021-05-16 02:16:31] [INFO ] [Real]Absence check using 181 positive place invariants in 152 ms returned sat
[2021-05-16 02:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:16:34] [INFO ] [Real]Absence check using state equation in 2775 ms returned sat
[2021-05-16 02:16:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:16:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 254 ms returned sat
[2021-05-16 02:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:16:37] [INFO ] [Nat]Absence check using state equation in 2581 ms returned sat
[2021-05-16 02:16:38] [INFO ] Deduced a trap composed of 21 places in 539 ms
[2021-05-16 02:16:38] [INFO ] Deduced a trap composed of 20 places in 525 ms
[2021-05-16 02:16:39] [INFO ] Deduced a trap composed of 34 places in 522 ms
[2021-05-16 02:16:39] [INFO ] Deduced a trap composed of 19 places in 500 ms
[2021-05-16 02:16:40] [INFO ] Deduced a trap composed of 16 places in 473 ms
[2021-05-16 02:16:40] [INFO ] Deduced a trap composed of 26 places in 474 ms
[2021-05-16 02:16:41] [INFO ] Deduced a trap composed of 24 places in 473 ms
[2021-05-16 02:16:41] [INFO ] Deduced a trap composed of 19 places in 479 ms
[2021-05-16 02:16:42] [INFO ] Deduced a trap composed of 23 places in 474 ms
[2021-05-16 02:16:42] [INFO ] Deduced a trap composed of 28 places in 466 ms
[2021-05-16 02:16:43] [INFO ] Deduced a trap composed of 16 places in 473 ms
[2021-05-16 02:16:43] [INFO ] Deduced a trap composed of 25 places in 473 ms
[2021-05-16 02:16:44] [INFO ] Deduced a trap composed of 22 places in 486 ms
[2021-05-16 02:16:45] [INFO ] Deduced a trap composed of 18 places in 476 ms
[2021-05-16 02:16:45] [INFO ] Deduced a trap composed of 25 places in 474 ms
[2021-05-16 02:16:46] [INFO ] Deduced a trap composed of 22 places in 477 ms
[2021-05-16 02:16:46] [INFO ] Deduced a trap composed of 20 places in 458 ms
[2021-05-16 02:16:47] [INFO ] Deduced a trap composed of 30 places in 448 ms
[2021-05-16 02:16:47] [INFO ] Deduced a trap composed of 25 places in 446 ms
[2021-05-16 02:16:47] [INFO ] Deduced a trap composed of 21 places in 445 ms
[2021-05-16 02:16:48] [INFO ] Deduced a trap composed of 30 places in 429 ms
[2021-05-16 02:16:48] [INFO ] Deduced a trap composed of 21 places in 423 ms
[2021-05-16 02:16:49] [INFO ] Deduced a trap composed of 20 places in 411 ms
[2021-05-16 02:16:49] [INFO ] Deduced a trap composed of 29 places in 406 ms
[2021-05-16 02:16:50] [INFO ] Deduced a trap composed of 29 places in 401 ms
[2021-05-16 02:16:50] [INFO ] Deduced a trap composed of 30 places in 383 ms
[2021-05-16 02:16:51] [INFO ] Deduced a trap composed of 26 places in 381 ms
[2021-05-16 02:16:51] [INFO ] Deduced a trap composed of 19 places in 499 ms
[2021-05-16 02:16:52] [INFO ] Deduced a trap composed of 21 places in 455 ms
[2021-05-16 02:16:52] [INFO ] Deduced a trap composed of 25 places in 392 ms
[2021-05-16 02:16:53] [INFO ] Deduced a trap composed of 13 places in 368 ms
[2021-05-16 02:16:53] [INFO ] Deduced a trap composed of 17 places in 381 ms
[2021-05-16 02:16:53] [INFO ] Deduced a trap composed of 25 places in 376 ms
[2021-05-16 02:16:54] [INFO ] Deduced a trap composed of 17 places in 368 ms
[2021-05-16 02:16:54] [INFO ] Deduced a trap composed of 18 places in 407 ms
[2021-05-16 02:16:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1144 s1145 s1162 s1163 s1164 s1183 s1184 s1185 s1186 s1187 s1188 s1189 s1190 s1192 s1200 s1201 s1202) 0)") while checking expression at index 1
[2021-05-16 02:16:55] [INFO ] [Real]Absence check using 181 positive place invariants in 143 ms returned sat
[2021-05-16 02:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:16:57] [INFO ] [Real]Absence check using state equation in 2772 ms returned sat
[2021-05-16 02:16:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:16:58] [INFO ] [Nat]Absence check using 181 positive place invariants in 38 ms returned unsat
[2021-05-16 02:16:58] [INFO ] [Real]Absence check using 181 positive place invariants in 139 ms returned sat
[2021-05-16 02:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:01] [INFO ] [Real]Absence check using state equation in 2761 ms returned sat
[2021-05-16 02:17:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:17:01] [INFO ] [Nat]Absence check using 181 positive place invariants in 35 ms returned unsat
[2021-05-16 02:17:01] [INFO ] [Real]Absence check using 181 positive place invariants in 137 ms returned sat
[2021-05-16 02:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:04] [INFO ] [Real]Absence check using state equation in 2743 ms returned sat
[2021-05-16 02:17:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:17:04] [INFO ] [Nat]Absence check using 181 positive place invariants in 252 ms returned sat
[2021-05-16 02:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:07] [INFO ] [Nat]Absence check using state equation in 2629 ms returned sat
[2021-05-16 02:17:08] [INFO ] Deduced a trap composed of 14 places in 510 ms
[2021-05-16 02:17:08] [INFO ] Deduced a trap composed of 13 places in 521 ms
[2021-05-16 02:17:09] [INFO ] Deduced a trap composed of 10 places in 513 ms
[2021-05-16 02:17:09] [INFO ] Deduced a trap composed of 25 places in 510 ms
[2021-05-16 02:17:10] [INFO ] Deduced a trap composed of 17 places in 505 ms
[2021-05-16 02:17:10] [INFO ] Deduced a trap composed of 27 places in 484 ms
[2021-05-16 02:17:11] [INFO ] Deduced a trap composed of 21 places in 443 ms
[2021-05-16 02:17:11] [INFO ] Deduced a trap composed of 17 places in 437 ms
[2021-05-16 02:17:12] [INFO ] Deduced a trap composed of 50 places in 446 ms
[2021-05-16 02:17:12] [INFO ] Deduced a trap composed of 19 places in 447 ms
[2021-05-16 02:17:13] [INFO ] Deduced a trap composed of 26 places in 427 ms
[2021-05-16 02:17:13] [INFO ] Deduced a trap composed of 37 places in 429 ms
[2021-05-16 02:17:14] [INFO ] Deduced a trap composed of 21 places in 421 ms
[2021-05-16 02:17:14] [INFO ] Deduced a trap composed of 19 places in 411 ms
[2021-05-16 02:17:15] [INFO ] Deduced a trap composed of 18 places in 423 ms
[2021-05-16 02:17:15] [INFO ] Deduced a trap composed of 23 places in 423 ms
[2021-05-16 02:17:15] [INFO ] Deduced a trap composed of 29 places in 387 ms
[2021-05-16 02:17:16] [INFO ] Deduced a trap composed of 18 places in 404 ms
[2021-05-16 02:17:16] [INFO ] Deduced a trap composed of 28 places in 374 ms
[2021-05-16 02:17:17] [INFO ] Deduced a trap composed of 27 places in 371 ms
[2021-05-16 02:17:17] [INFO ] Deduced a trap composed of 26 places in 363 ms
[2021-05-16 02:17:17] [INFO ] Deduced a trap composed of 26 places in 360 ms
[2021-05-16 02:17:18] [INFO ] Deduced a trap composed of 23 places in 410 ms
[2021-05-16 02:17:18] [INFO ] Deduced a trap composed of 32 places in 409 ms
[2021-05-16 02:17:19] [INFO ] Deduced a trap composed of 30 places in 401 ms
[2021-05-16 02:17:19] [INFO ] Deduced a trap composed of 21 places in 370 ms
[2021-05-16 02:17:20] [INFO ] Deduced a trap composed of 27 places in 453 ms
[2021-05-16 02:17:20] [INFO ] Deduced a trap composed of 40 places in 390 ms
[2021-05-16 02:17:21] [INFO ] Deduced a trap composed of 29 places in 361 ms
[2021-05-16 02:17:21] [INFO ] Deduced a trap composed of 26 places in 357 ms
[2021-05-16 02:17:21] [INFO ] Deduced a trap composed of 30 places in 342 ms
[2021-05-16 02:17:22] [INFO ] Deduced a trap composed of 27 places in 354 ms
[2021-05-16 02:17:22] [INFO ] Deduced a trap composed of 25 places in 319 ms
[2021-05-16 02:17:22] [INFO ] Deduced a trap composed of 31 places in 332 ms
[2021-05-16 02:17:23] [INFO ] Deduced a trap composed of 31 places in 326 ms
[2021-05-16 02:17:23] [INFO ] Deduced a trap composed of 25 places in 331 ms
[2021-05-16 02:17:24] [INFO ] Deduced a trap composed of 29 places in 315 ms
[2021-05-16 02:17:24] [INFO ] Deduced a trap composed of 30 places in 316 ms
[2021-05-16 02:17:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s318 s319 s320 s321 s322 s323 s339 s398 s399 s400 s416 s417 s419 s422 s423) 0)") while checking expression at index 4
[2021-05-16 02:17:24] [INFO ] [Real]Absence check using 181 positive place invariants in 138 ms returned sat
[2021-05-16 02:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:27] [INFO ] [Real]Absence check using state equation in 2760 ms returned sat
[2021-05-16 02:17:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:17:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 35 ms returned unsat
[2021-05-16 02:17:28] [INFO ] [Real]Absence check using 181 positive place invariants in 144 ms returned sat
[2021-05-16 02:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:30] [INFO ] [Real]Absence check using state equation in 2822 ms returned sat
[2021-05-16 02:17:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:17:31] [INFO ] [Nat]Absence check using 181 positive place invariants in 34 ms returned unsat
[2021-05-16 02:17:31] [INFO ] [Real]Absence check using 181 positive place invariants in 140 ms returned sat
[2021-05-16 02:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:17:34] [INFO ] [Real]Absence check using state equation in 2775 ms returned sat
[2021-05-16 02:17:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:17:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 36 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-16 02:17:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-16 02:17:34] [INFO ] Flatten gal took : 123 ms
FORMULA ShieldIIPs-PT-020B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 02:17:34] [INFO ] Applying decomposition
[2021-05-16 02:17:34] [INFO ] Flatten gal took : 64 ms
[2021-05-16 02:17:34] [INFO ] Decomposing Gal with order
[2021-05-16 02:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:17:35] [INFO ] Removed a total of 320 redundant transitions.
[2021-05-16 02:17:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 02:17:35] [INFO ] Flatten gal took : 122 ms
[2021-05-16 02:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 34 ms.
[2021-05-16 02:17:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPs-PT-020B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 02:17:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 02:17:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPs-PT-020B @ 3570 seconds

FORMULA ShieldIIPs-PT-020B-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 12675728 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16138068 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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is ShieldIIPs-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098230900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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