fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r157-smll-165277001600097
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
236.964 16347.00 33171.00 118.00 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r157-smll-165277001600097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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 itstools
Input is NoC3x3-PT-3B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001600097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 581K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652861483978

Running Version 202205111006
[2022-05-18 08:11:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-18 08:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 08:11:27] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2022-05-18 08:11:27] [INFO ] Transformed 2117 places.
[2022-05-18 08:11:27] [INFO ] Transformed 2435 transitions.
[2022-05-18 08:11:27] [INFO ] Found NUPN structural information;
[2022-05-18 08:11:27] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 644 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 15 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 2049 transition count 1929
Reduce places removed 443 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 449 rules applied. Total rules applied 898 place count 1606 transition count 1923
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 901 place count 1603 transition count 1923
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 901 place count 1603 transition count 1899
Deduced a syphon composed of 24 places in 30 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 949 place count 1579 transition count 1899
Discarding 364 places :
Symmetric choice reduction at 3 with 364 rule applications. Total rules 1313 place count 1215 transition count 1535
Iterating global reduction 3 with 364 rules applied. Total rules applied 1677 place count 1215 transition count 1535
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1677 place count 1215 transition count 1503
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1741 place count 1183 transition count 1503
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 1855 place count 1069 transition count 1389
Iterating global reduction 3 with 114 rules applied. Total rules applied 1969 place count 1069 transition count 1389
Discarding 140 places :
Symmetric choice reduction at 3 with 140 rule applications. Total rules 2109 place count 929 transition count 1233
Iterating global reduction 3 with 140 rules applied. Total rules applied 2249 place count 929 transition count 1233
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2307 place count 871 transition count 1125
Iterating global reduction 3 with 58 rules applied. Total rules applied 2365 place count 871 transition count 1125
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 2385 place count 869 transition count 1107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2387 place count 867 transition count 1107
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 2429 place count 825 transition count 1065
Iterating global reduction 5 with 42 rules applied. Total rules applied 2471 place count 825 transition count 1065
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 2479 place count 821 transition count 1061
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2483 place count 817 transition count 1061
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 2514 place count 786 transition count 999
Iterating global reduction 7 with 31 rules applied. Total rules applied 2545 place count 786 transition count 999
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 2576 place count 755 transition count 968
Iterating global reduction 7 with 31 rules applied. Total rules applied 2607 place count 755 transition count 968
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 41 rules applied. Total rules applied 2648 place count 750 transition count 932
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2653 place count 745 transition count 932
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: 304
Deduced a syphon composed of 304 places in 1 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 9 with 608 rules applied. Total rules applied 3261 place count 441 transition count 628
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 3276 place count 426 transition count 613
Iterating global reduction 9 with 15 rules applied. Total rules applied 3291 place count 426 transition count 613
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 3302 place count 415 transition count 591
Iterating global reduction 9 with 11 rules applied. Total rules applied 3313 place count 415 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3315 place count 415 transition count 589
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3317 place count 413 transition count 579
Iterating global reduction 10 with 2 rules applied. Total rules applied 3319 place count 413 transition count 579
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 3363 place count 391 transition count 670
Applied a total of 3363 rules in 1294 ms. Remains 391 /2117 variables (removed 1726) and now considering 670/2435 (removed 1765) transitions.
[2022-05-18 08:11:28] [INFO ] Flow matrix only has 606 transitions (discarded 64 similar events)
// Phase 1: matrix 606 rows 391 cols
[2022-05-18 08:11:28] [INFO ] Computed 54 place invariants in 33 ms
[2022-05-18 08:11:29] [INFO ] Implicit Places using invariants in 903 ms returned [11, 47, 92, 127, 186, 259, 303, 336, 375]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 959 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 382/2117 places, 670/2435 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 358 transition count 646
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 94 place count 358 transition count 600
Applied a total of 94 rules in 33 ms. Remains 358 /382 variables (removed 24) and now considering 600/670 (removed 70) transitions.
[2022-05-18 08:11:29] [INFO ] Flow matrix only has 536 transitions (discarded 64 similar events)
// Phase 1: matrix 536 rows 358 cols
[2022-05-18 08:11:29] [INFO ] Computed 45 place invariants in 7 ms
[2022-05-18 08:11:29] [INFO ] Implicit Places using invariants in 476 ms returned []
[2022-05-18 08:11:29] [INFO ] Flow matrix only has 536 transitions (discarded 64 similar events)
// Phase 1: matrix 536 rows 358 cols
[2022-05-18 08:11:29] [INFO ] Computed 45 place invariants in 8 ms
[2022-05-18 08:11:30] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-18 08:11:31] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned [5, 10, 30, 32, 35, 36, 41, 43, 78, 80, 83, 84, 103, 104, 111, 113, 116, 145, 146, 147, 148, 151, 152, 153, 158, 160, 162, 167, 169, 171, 228, 229, 232, 233, 234, 237, 238, 239, 273, 274, 279, 296, 297, 298, 301, 307, 309, 341, 344]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1654 ms to find 49 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 309/2117 places, 600/2435 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 309 transition count 597
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 306 transition count 597
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 98 place count 260 transition count 551
Applied a total of 98 rules in 26 ms. Remains 260 /309 variables (removed 49) and now considering 551/600 (removed 49) transitions.
[2022-05-18 08:11:31] [INFO ] Flow matrix only has 487 transitions (discarded 64 similar events)
// Phase 1: matrix 487 rows 260 cols
[2022-05-18 08:11:31] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-18 08:11:31] [INFO ] Implicit Places using invariants in 361 ms returned []
[2022-05-18 08:11:31] [INFO ] Flow matrix only has 487 transitions (discarded 64 similar events)
// Phase 1: matrix 487 rows 260 cols
[2022-05-18 08:11:31] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-18 08:11:31] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-18 08:11:32] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 260/2117 places, 551/2435 transitions.
Finished structural reductions, in 3 iterations. Remains : 260/2117 places, 551/2435 transitions.
Discarding 311 transitions out of 551. Remains 240
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 1141 ms. (steps per millisecond=8 ) properties (out of 239) seen :212
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2022-05-18 08:11:33] [INFO ] Flow matrix only has 487 transitions (discarded 64 similar events)
// Phase 1: matrix 487 rows 260 cols
[2022-05-18 08:11:33] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-18 08:11:34] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-05-18 08:11:35] [INFO ] After 1157ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:23
[2022-05-18 08:11:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-18 08:11:35] [INFO ] After 99ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :3 sat :0 real:24
[2022-05-18 08:11:35] [INFO ] After 2013ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:24
[2022-05-18 08:11:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-18 08:11:37] [INFO ] After 935ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :24
[2022-05-18 08:11:38] [INFO ] After 791ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :3 sat :24
[2022-05-18 08:11:39] [INFO ] After 2019ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :24
Attempting to minimize the solution found.
Minimization took 740 ms.
[2022-05-18 08:11:40] [INFO ] After 4324ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :24
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL INITIAL_STATE SAT_SMT
Total runtime 13884 ms.

BK_STOP 1652861500325

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="NoC3x3-PT-3B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is NoC3x3-PT-3B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-165277001600097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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