fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r319-tall-165472290500646
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Szymanski-PT-b02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4327.151 118813.00 248832.00 505.50 T 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.r319-tall-165472290500646.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 Szymanski-PT-b02, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-165472290500646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M Jun 6 12:11 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1654731912123

Running Version 202205111006
[2022-06-08 23:45:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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-06-08 23:45:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:45:13] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2022-06-08 23:45:13] [INFO ] Transformed 568 places.
[2022-06-08 23:45:13] [INFO ] Transformed 8320 transitions.
[2022-06-08 23:45:13] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 499 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
Built sparse matrix representations for Structural reductions in 13 ms.23314KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Graph (complete) has 12652 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.58 ms
Discarding 2 places :
Also discarding 0 output transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 305 transition count 7936
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Applied a total of 3 rules in 598 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7936/8064 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3227 ms (no deadlock found). (steps per millisecond=387 )
Random directed walk for 1250002 steps, including 0 resets, run took 4581 ms (no deadlock found). (steps per millisecond=272 )
[2022-06-08 23:45:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-08 23:45:22] [INFO ] Computed 1 place invariants in 48 ms
[2022-06-08 23:45:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-08 23:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:23] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2022-06-08 23:45:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:45:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-08 23:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:25] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2022-06-08 23:45:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-08 23:45:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 23:45:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 6054 ms returned unknown
Random directed walk for 500002 steps, including 0 resets, run took 1895 ms (no deadlock found). (steps per millisecond=263 )
Random walk for 500001 steps, including 0 resets, run took 1218 ms (no deadlock found). (steps per millisecond=410 )
Random directed walk for 500002 steps, including 0 resets, run took 1753 ms (no deadlock found). (steps per millisecond=285 )
Random walk for 500000 steps, including 0 resets, run took 1211 ms (no deadlock found). (steps per millisecond=412 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Applied a total of 0 rules in 365 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-08 23:45:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-08 23:45:38] [INFO ] Computed 1 place invariants in 27 ms
[2022-06-08 23:45:38] [INFO ] Implicit Places using invariants in 880 ms returned []
[2022-06-08 23:45:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-08 23:45:38] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-08 23:45:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-08 23:45:45] [INFO ] Implicit Places using invariants and state equation in 6984 ms returned []
Implicit Place search using SMT with State Equation took 7871 ms to find 0 implicit places.
[2022-06-08 23:45:46] [INFO ] Redundant transitions in 932 ms returned []
[2022-06-08 23:45:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-08 23:45:46] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-08 23:45:48] [INFO ] Dead Transitions using invariants and state equation in 2191 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Random walk for 1250001 steps, including 0 resets, run took 3148 ms (no deadlock found). (steps per millisecond=397 )
Random directed walk for 1250001 steps, including 0 resets, run took 4661 ms (no deadlock found). (steps per millisecond=268 )
[2022-06-08 23:45:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-08 23:45:56] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-08 23:45:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-08 23:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:57] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-08 23:45:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:45:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-08 23:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:59] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2022-06-08 23:45:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-08 23:46:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 23:46:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 6067 ms returned unknown
Random directed walk for 500001 steps, including 0 resets, run took 1712 ms (no deadlock found). (steps per millisecond=292 )
Random walk for 500000 steps, including 0 resets, run took 1196 ms (no deadlock found). (steps per millisecond=418 )
Random directed walk for 500000 steps, including 0 resets, run took 1727 ms (no deadlock found). (steps per millisecond=289 )
Random walk for 500000 steps, including 0 resets, run took 1207 ms (no deadlock found). (steps per millisecond=414 )
[2022-06-08 23:46:12] [INFO ] Flatten gal took : 854 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3254330409639522022
[2022-06-08 23:46:13] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2022-06-08 23:46:13] [INFO ] Applying decomposition
[2022-06-08 23:46:13] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3254330409639522022
Running compilation step : cd /tmp/ltsmin3254330409639522022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 23:46:13] [INFO ] Flatten gal took : 506 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17307208331581193826.txt' '-o' '/tmp/graph17307208331581193826.bin' '-w' '/tmp/graph17307208331581193826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17307208331581193826.bin' '-l' '-1' '-v' '-w' '/tmp/graph17307208331581193826.weights' '-q' '0' '-e' '0.001'
[2022-06-08 23:46:15] [INFO ] Decomposing Gal with order
[2022-06-08 23:46:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:46:17] [INFO ] Removed a total of 18249 redundant transitions.
[2022-06-08 23:46:17] [INFO ] Flatten gal took : 1916 ms
[2022-06-08 23:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1083 labels/synchronizations in 748 ms.
[2022-06-08 23:46:18] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1198310420526444957.gal : 136 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock1198310420526444957.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
No direction supplied, using forward translation only.
Compilation finished in 34964 ms.
Running link step : cd /tmp/ltsmin3254330409639522022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 307 ms.
Running LTSmin : cd /tmp/ltsmin3254330409639522022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,277943,37.7854,773276,2370,1609,908855,302042,8429,2.57648e+06,403,1.51855e+06,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,7125,39.5874,773276,309,182,908855,302042,29506,2.57648e+06,1804,1.51855e+06,374003

System contains 7125 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 7125 states ] showing 10 first states
[ i7={[ u40={[ ]
} u39={[ ]
} u59={[ ]
} u58={[ ]
} u57={[ ]
} u30={[ ]
} u28={[ ]
} u19={[ ]
} u17={[ ]
} u8={[ ]
} u6={[ ]
} ]
} i6={[ i1={[ u56={[ ]
} u55={[ ]
} u38={[ ]
} u36={[ ]
} ]
} i0={[ u35={[ ]
} u24={[ ]
} u13={[ ]
} u2={[ ]
} ]
} ]
} i5={[ u61={[ ]
} u43={[ ]
} u42={[ ]
} u32={[ ]
} u21={[ ]
} u20={[ ]
} u10={[ ]
} ]
} i4={[ u27={[ ]
} u60={[ p512=1 ]
} u53={[ l54=1 l23=1 ]
} u52={[ ]
} u25={[ ]
} u16={[ ]
} u14={[ ]
} u5={[ ]
} u3={[ ]
} ]
} i3={[ u51={[ ]
} u50={[ ]
} u49={[ ]
} ]
} i2={[ u48={[ ]
} u41={[ ]
} u47={[ ]
} u31={[ ]
} u29={[ ]
} u18={[ ]
} u9={[ ]
} u7={[ ]
} ]
} i1={[ u54={[ ]
} u37={[ ]
} u26={[ ]
} u15={[ ]
} u4={[ ]
} ]
} i0={[ i1={[ u46={[ l6=1 ]
[ l7=1 ]
} u45={[ ]
} u44={[ ]
} u34={[ ]
} u23={[ ]
} u12={[ ]
} u1={[ ]
} ]
} i0={[ u33={[ ]
} u22={[ ]
} u11={[ ]
} u0={[ ]
} ]
} ]
} ]
[ i7={[ u40={[ ]
} u39={[ ]
} u59={[ ]
} u58={[ ]
} u57={[ ]
} u30={[ ]
} u28={[ ]
} u19={[ ]
} u17={[ ]
} u8={[ ]
} u6={[ ]
} ]
} i6={[ i1={[ u56={[ ]
} u55={[ ]
} u38={[ ]
} u36={[ ]
} ]
} i0={[ u35={[ ]
} u24={[ ]
} u13={[ ]
} u2={[ ]
} ]
} ]
} i5={[ u61={[ ]
} u43={[ ]
} u42={[ ]
} u32={[ ]
} u21={[ ]
} u20={[ ]
} u10={[ ]
} ]
} i4={[ u27={[ ]
} u60={[ p512=1 ]
} u53={[ l54=1 l23=1 ]
} u52={[ ]
} u25={[ ]
} u16={[ ]
} u14={[ ]
} u5={[ ]
} u3={[ ]
} ]
} i3={[ u51={[ ]
} u50={[ ]
} u49={[ ]
} ]
} i2={[ u48={[ ]
} u41={[ ]
} u47={[ l8=1 ]
[ l9=1 ]
[ l10=1 ]
} u31={[ ]
} u29={[ ]
} u18={[ ]
} u9={[ ]
} u7={[ ]
} ]
} i1={[ u54={[ ]
} u37={[ ]
} u26={[ ]
} u15={[ ]
} u4={[ ]
} ]
} i0={[ i1={[ u46={[ ]
} u45={[ ]
} u44={[ ]
} u34={[ ]
} u23={[ ]
} u12={[ ]
} u1={[ ]
} ]
} i0={[ u33={[ ]
} u22={[ ]
} u11={[ ]
} u0={[ ]
} ]
} ]
} ]
[ i7={[ u40={[ ]
} u39={[ ]
} u59={[ ]
} u58={[ ]
} u57={[ ]
} u30={[ ]
} u28={[ ]
} u19={[ ]
} u17={[ ]
} u8={[ ]
} u6={[ ]
} ]
} i6={[ i1={[ u56={[ ]
} u55={[ ]
} u38={[ ]
} u36={[ ]
} ]
} i0={[ u35={[ ]
} u24={[ ]
} u13={[ ]
} u2={[ ]
} ]
} ]
} i5={[ u61={[ ]
} u43={[ ]
} u42={[ ]
} u32={[ ]
} u21={[ ]
} u20={[ ]
} u10={[ ]
} ]
} i4={[ u27={[ ]
} u60={[ p512=1 ]
} u53={[ l54=1 ]
} u52={[ ]
} u25={[ ]
} u16={[ ]
} u14={[ ]
} u5={[ ]
} u3={[ ]
} ]
} i3={[ u51={[ ]
} u50={[ ]
} u49={[ ]
} ]
} i2={[ u48={[ ]
} u41={[ ]
} u47={[ ]
} u31={[ ]
} u29={[ ]
} u18={[ ]
} u9={[ ]
} u7={[ ]
} ]
} i1={[ u54={[ l25=1 ]
[ l27=1 ]
[ l26=1 ]
[ l28=1 ]
} u37={[ ]
} u26={[ ]
} u15={[ ]
} u4={[ ]
} ]
} i0={[ i1={[ u46={[ ]
} u45={[ l3=1 ]
[ l4=1 ]
} u44={[ ]
} u34={[ ]
} u23={[ ]
} u12={[ ]
} u1={[ ]
} ]
[ u46={[ l5=1 ]
[ l6=1 ]
[ l7=1 ]
} u45={[ ]
} u44={[ ]
} u34={[ ]
} u23={[ ]
} u12={[ ]
} u1={[ ]
} ]
} i0={[ u33={[ ]
} u22={[ ]
} u11={[ ]
} u0={[ ]
} ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 117638 ms.

BK_STOP 1654732030936

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -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 ReachabilityDeadlock -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="Szymanski-PT-b02"
export BK_EXAMINATION="ReachabilityDeadlock"
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 Szymanski-PT-b02, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r319-tall-165472290500646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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