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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
279.747 9178.00 17280.00 346.20 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/mcc2021-input.r147-tall-162089137800157.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 itstools
Input is NoC3x3-PT-2B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089137800157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 548K May 5 16:51 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 1620947502672

Running Version 0
[2021-05-13 23:11:44] [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]
[2021-05-13 23:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:11:44] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2021-05-13 23:11:44] [INFO ] Transformed 2003 places.
[2021-05-13 23:11:44] [INFO ] Transformed 2292 transitions.
[2021-05-13 23:11:44] [INFO ] Found NUPN structural information;
[2021-05-13 23:11:44] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 188 ms.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1634 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 10 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 405 transitions
Trivial Post-agglo rules discarded 405 transitions
Performed 405 trivial Post agglomeration. Transition count delta: 405
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 1931 transition count 1824
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 1 with 405 rules applied. Total rules applied 820 place count 1526 transition count 1824
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1800
Deduced a syphon composed of 24 places in 23 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1800
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 1218 place count 1152 transition count 1450
Iterating global reduction 2 with 350 rules applied. Total rules applied 1568 place count 1152 transition count 1450
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 1568 place count 1152 transition count 1418
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 1632 place count 1120 transition count 1418
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 1741 place count 1011 transition count 1309
Iterating global reduction 2 with 109 rules applied. Total rules applied 1850 place count 1011 transition count 1309
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 1976 place count 885 transition count 1169
Iterating global reduction 2 with 126 rules applied. Total rules applied 2102 place count 885 transition count 1169
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2152 place count 835 transition count 1075
Iterating global reduction 2 with 50 rules applied. Total rules applied 2202 place count 835 transition count 1075
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 2 with 18 rules applied. Total rules applied 2220 place count 833 transition count 1059
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2222 place count 831 transition count 1059
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 2258 place count 795 transition count 1023
Iterating global reduction 4 with 36 rules applied. Total rules applied 2294 place count 795 transition count 1023
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 4 with 4 rules applied. Total rules applied 2298 place count 793 transition count 1021
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2300 place count 791 transition count 1021
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 2325 place count 766 transition count 971
Iterating global reduction 6 with 25 rules applied. Total rules applied 2350 place count 766 transition count 971
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 2375 place count 741 transition count 946
Iterating global reduction 6 with 25 rules applied. Total rules applied 2400 place count 741 transition count 946
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 31 rules applied. Total rules applied 2431 place count 738 transition count 918
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2434 place count 735 transition count 918
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 8 with 594 rules applied. Total rules applied 3028 place count 438 transition count 621
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3040 place count 426 transition count 609
Iterating global reduction 8 with 12 rules applied. Total rules applied 3052 place count 426 transition count 609
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3061 place count 417 transition count 591
Iterating global reduction 8 with 9 rules applied. Total rules applied 3070 place count 417 transition count 591
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3072 place count 415 transition count 581
Iterating global reduction 8 with 2 rules applied. Total rules applied 3074 place count 415 transition count 581
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 3118 place count 393 transition count 673
Applied a total of 3118 rules in 748 ms. Remains 393 /2003 variables (removed 1610) and now considering 673/2292 (removed 1619) transitions.
[2021-05-13 23:11:45] [INFO ] Flow matrix only has 609 transitions (discarded 64 similar events)
// Phase 1: matrix 609 rows 393 cols
[2021-05-13 23:11:45] [INFO ] Computed 53 place invariants in 24 ms
[2021-05-13 23:11:45] [INFO ] Implicit Places using invariants in 390 ms returned [11, 47, 91, 125, 184, 257, 300, 332, 373]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 417 ms to find 9 implicit places.
[2021-05-13 23:11:45] [INFO ] Flow matrix only has 609 transitions (discarded 64 similar events)
// Phase 1: matrix 609 rows 384 cols
[2021-05-13 23:11:45] [INFO ] Computed 44 place invariants in 4 ms
[2021-05-13 23:11:45] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Starting structural reductions, iteration 1 : 384/2003 places, 673/2292 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 360 transition count 649
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 88 place count 360 transition count 609
Applied a total of 88 rules in 13 ms. Remains 360 /384 variables (removed 24) and now considering 609/673 (removed 64) transitions.
[2021-05-13 23:11:46] [INFO ] Flow matrix only has 545 transitions (discarded 64 similar events)
// Phase 1: matrix 545 rows 360 cols
[2021-05-13 23:11:46] [INFO ] Computed 44 place invariants in 3 ms
[2021-05-13 23:11:46] [INFO ] Implicit Places using invariants in 254 ms returned []
[2021-05-13 23:11:46] [INFO ] Flow matrix only has 545 transitions (discarded 64 similar events)
// Phase 1: matrix 545 rows 360 cols
[2021-05-13 23:11:46] [INFO ] Computed 44 place invariants in 4 ms
[2021-05-13 23:11:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-13 23:11:47] [INFO ] Implicit Places using invariants and state equation in 761 ms returned [5, 10, 30, 32, 35, 36, 41, 43, 79, 82, 83, 101, 102, 109, 111, 114, 143, 144, 145, 146, 149, 150, 151, 156, 158, 160, 165, 167, 169, 226, 227, 230, 231, 232, 235, 236, 237, 271, 276, 292, 293, 294, 297, 303, 305, 337, 338, 341, 342]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1029 ms to find 49 implicit places.
Starting structural reductions, iteration 2 : 311/2003 places, 609/2292 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 310 transition count 608
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 98 place count 262 transition count 560
Applied a total of 98 rules in 37 ms. Remains 262 /311 variables (removed 49) and now considering 560/609 (removed 49) transitions.
[2021-05-13 23:11:47] [INFO ] Flow matrix only has 496 transitions (discarded 64 similar events)
// Phase 1: matrix 496 rows 262 cols
[2021-05-13 23:11:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-13 23:11:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2021-05-13 23:11:47] [INFO ] Flow matrix only has 496 transitions (discarded 64 similar events)
// Phase 1: matrix 496 rows 262 cols
[2021-05-13 23:11:47] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-13 23:11:47] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-13 23:11:47] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 262/2003 places, 560/2292 transitions.
Discarding 318 transitions out of 560. Remains 242
[2021-05-13 23:11:47] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 241) seen :211
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2021-05-13 23:11:48] [INFO ] Flow matrix only has 496 transitions (discarded 64 similar events)
// Phase 1: matrix 496 rows 262 cols
[2021-05-13 23:11:48] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-13 23:11:48] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-13 23:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:11:48] [INFO ] [Real]Absence check using state equation in 411 ms returned unsat :3 sat :27 real:0
[2021-05-13 23:11:48] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-13 23:11:48] [INFO ] [Real]Added 71 Read/Feed constraints in 6 ms returned sat
[2021-05-13 23:11:49] [INFO ] SMT Verify possible in real domain returnedunsat :3 sat :0 real:27
[2021-05-13 23:11:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-13 23:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:11:50] [INFO ] [Nat]Absence check using state equation in 386 ms returned unsat :0 sat :30
[2021-05-13 23:11:50] [INFO ] [Nat]Added 71 Read/Feed constraints in 5 ms returned sat
Attempting to minimize the solution found.
Minimization took 320 ms.
[2021-05-13 23:11:50] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :30
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL INITIAL_STATE SAT_SMT

BK_STOP 1620947511850

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-2B"
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-2B, 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 r147-tall-162089137800157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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