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-165472290100391.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 RERS2020-PT-pb101, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-165472290100391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 83M
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Jun 7 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 82M 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 1654724379230

Running Version 202205111006
[2022-06-08 21:39:40] [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 21:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 21:39:43] [INFO ] Load time of PNML (sax parser for PT used): 2598 ms
[2022-06-08 21:39:43] [INFO ] Transformed 906 places.
[2022-06-08 21:39:43] [INFO ] Transformed 149363 transitions.
[2022-06-08 21:39:43] [INFO ] Found NUPN structural information;
[2022-06-08 21:39:43] [INFO ] Parsed PT model containing 906 places and 149363 transitions in 3249 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2798 transitions
Reduce redundant transitions removed 2798 transitions.
Built sparse matrix representations for Structural reductions in 54 ms.216677KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 906/906 places, 146565/146565 transitions.
Computed a total of 144 stabilizing places and 28382 stable transitions
Ensure Unique test removed 4 places
Computed a total of 140 stabilizing places and 28382 stable transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 902 transition count 146565
Computed a total of 140 stabilizing places and 28382 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 902 transition count 146564
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 901 transition count 146564
Computed a total of 139 stabilizing places and 28381 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 56 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 48 place count 880 transition count 146543
Ensure Unique test removed 1161 transitions
Reduce isomorphic transitions removed 1161 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Iterating post reduction 1 with 1161 rules applied. Total rules applied 1209 place count 880 transition count 145382
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 1209 rules in 5090 ms. Remains 880 /906 variables (removed 26) and now considering 145382/146565 (removed 1183) transitions.
Finished structural reductions, in 1 iterations. Remains : 880/906 places, 145382/146565 transitions.
Interrupted Random walk after 426733 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2022-06-08 21:40:19] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2022-06-08 21:40:20] [INFO ] Computed 5 place invariants in 512 ms
[2022-06-08 21:40:28] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2022-06-08 21:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:41:01] [INFO ] [Real]Absence check using state equation in 32067 ms returned sat
[2022-06-08 21:41:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:41:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 42 ms returned sat
[2022-06-08 21:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:41:42] [INFO ] [Nat]Absence check using state equation in 31461 ms returned sat
[2022-06-08 21:41:45] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2022-06-08 21:42:01] [INFO ] [Nat]Added 2563 Read/Feed constraints in 16873 ms returned sat
[2022-06-08 21:42:16] [INFO ] Deduced a trap composed of 83 places in 12917 ms of which 7 ms to minimize.
[2022-06-08 21:42:31] [INFO ] Deduced a trap composed of 242 places in 13165 ms of which 5 ms to minimize.
[2022-06-08 21:42:45] [INFO ] Deduced a trap composed of 226 places in 13088 ms of which 2 ms to minimize.
[2022-06-08 21:42:59] [INFO ] Deduced a trap composed of 196 places in 12338 ms of which 3 ms to minimize.
[2022-06-08 21:43:13] [INFO ] Deduced a trap composed of 54 places in 12503 ms of which 2 ms to minimize.
[2022-06-08 21:43:27] [INFO ] Deduced a trap composed of 494 places in 12830 ms of which 2 ms to minimize.
[2022-06-08 21:43:41] [INFO ] Deduced a trap composed of 495 places in 11913 ms of which 1 ms to minimize.
[2022-06-08 21:43:49] [INFO ] Deduced a trap composed of 192 places in 7052 ms of which 1 ms to minimize.
[2022-06-08 21:43:59] [INFO ] Deduced a trap composed of 441 places in 8506 ms of which 1 ms to minimize.
[2022-06-08 21:44:13] [INFO ] Deduced a trap composed of 27 places in 12532 ms of which 2 ms to minimize.
[2022-06-08 21:44:23] [INFO ] Deduced a trap composed of 249 places in 8515 ms of which 1 ms to minimize.
[2022-06-08 21:44:33] [INFO ] Deduced a trap composed of 499 places in 7947 ms of which 1 ms to minimize.
[2022-06-08 21:44:47] [INFO ] Deduced a trap composed of 502 places in 12179 ms of which 0 ms to minimize.
[2022-06-08 21:45:01] [INFO ] Deduced a trap composed of 53 places in 12572 ms of which 2 ms to minimize.
[2022-06-08 21:45:15] [INFO ] Deduced a trap composed of 145 places in 12335 ms of which 2 ms to minimize.
[2022-06-08 21:45:28] [INFO ] Deduced a trap composed of 142 places in 12256 ms of which 2 ms to minimize.
[2022-06-08 21:45:42] [INFO ] Deduced a trap composed of 60 places in 12346 ms of which 2 ms to minimize.
[2022-06-08 21:45:56] [INFO ] Deduced a trap composed of 408 places in 12081 ms of which 1 ms to minimize.
[2022-06-08 21:46:09] [INFO ] Deduced a trap composed of 134 places in 11289 ms of which 1 ms to minimize.
[2022-06-08 21:46:09] [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 close... while checking Deadlocks.
Interrupted Random directed walk after 310513 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 427110 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Interrupted Random directed walk after 313411 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 419588 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 880/880 places, 145382/145382 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 0 rules in 1443 ms. Remains 880 /880 variables (removed 0) and now considering 145382/145382 (removed 0) transitions.
[2022-06-08 21:48:10] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2022-06-08 21:48:11] [INFO ] Computed 5 place invariants in 391 ms
[2022-06-08 21:48:20] [INFO ] Implicit Places using invariants in 9976 ms returned []
Implicit Place search using SMT only with invariants took 9977 ms to find 0 implicit places.
[2022-06-08 21:48:20] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2022-06-08 21:48:21] [INFO ] Computed 5 place invariants in 391 ms
[2022-06-08 21:48:51] [INFO ] Performed 95796/145382 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-08 21:49:06] [INFO ] Dead Transitions using invariants and state equation in 45592 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 880/880 places, 145382/145382 transitions.
Interrupted Random walk after 415813 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
[2022-06-08 21:49:36] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2022-06-08 21:49:36] [INFO ] Computed 5 place invariants in 398 ms
[2022-06-08 21:49:45] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2022-06-08 21:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:50:18] [INFO ] [Real]Absence check using state equation in 32240 ms returned sat
[2022-06-08 21:50:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:50:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 44 ms returned sat
[2022-06-08 21:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:51:00] [INFO ] [Nat]Absence check using state equation in 31951 ms returned sat
[2022-06-08 21:51:02] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2022-06-08 21:51:19] [INFO ] [Nat]Added 2563 Read/Feed constraints in 17659 ms returned sat
[2022-06-08 21:51:34] [INFO ] Deduced a trap composed of 83 places in 12845 ms of which 2 ms to minimize.
[2022-06-08 21:51:47] [INFO ] Deduced a trap composed of 242 places in 12209 ms of which 2 ms to minimize.
[2022-06-08 21:52:01] [INFO ] Deduced a trap composed of 226 places in 12400 ms of which 3 ms to minimize.
[2022-06-08 21:52:15] [INFO ] Deduced a trap composed of 196 places in 12061 ms of which 1 ms to minimize.
[2022-06-08 21:52:29] [INFO ] Deduced a trap composed of 54 places in 12542 ms of which 2 ms to minimize.
[2022-06-08 21:52:43] [INFO ] Deduced a trap composed of 494 places in 12525 ms of which 2 ms to minimize.
[2022-06-08 21:52:56] [INFO ] Deduced a trap composed of 495 places in 12291 ms of which 2 ms to minimize.
[2022-06-08 21:53:05] [INFO ] Deduced a trap composed of 192 places in 7087 ms of which 0 ms to minimize.
[2022-06-08 21:53:13] [INFO ] Deduced a trap composed of 441 places in 7013 ms of which 1 ms to minimize.
[2022-06-08 21:53:27] [INFO ] Deduced a trap composed of 27 places in 12388 ms of which 2 ms to minimize.
[2022-06-08 21:53:36] [INFO ] Deduced a trap composed of 249 places in 7203 ms of which 1 ms to minimize.
[2022-06-08 21:53:44] [INFO ] Deduced a trap composed of 499 places in 6588 ms of which 1 ms to minimize.
[2022-06-08 21:53:56] [INFO ] Deduced a trap composed of 502 places in 10668 ms of which 1 ms to minimize.
[2022-06-08 21:54:09] [INFO ] Deduced a trap composed of 53 places in 11675 ms of which 1 ms to minimize.
[2022-06-08 21:54:21] [INFO ] Deduced a trap composed of 145 places in 10583 ms of which 1 ms to minimize.
[2022-06-08 21:54:33] [INFO ] Deduced a trap composed of 142 places in 10510 ms of which 1 ms to minimize.
[2022-06-08 21:54:46] [INFO ] Deduced a trap composed of 60 places in 10642 ms of which 1 ms to minimize.
[2022-06-08 21:54:57] [INFO ] Deduced a trap composed of 408 places in 10232 ms of which 1 ms to minimize.
[2022-06-08 21:55:09] [INFO ] Deduced a trap composed of 134 places in 10607 ms of which 1 ms to minimize.
[2022-06-08 21:55:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 234261 ms
[2022-06-08 21:55:43] [INFO ] Computed and/alt/rep : 151/1131/151 causal constraints (skipped 112155 transitions) in 29405 ms.
[2022-06-08 21:55:43] [INFO ] Added : 0 causal constraints over 0 iterations in 29409 ms. Result :unknown
Interrupted Parikh directed walk after 13387 steps, including 13387 resets, run timeout after 30002 ms. (steps per millisecond=0 )
Parikh directed walk for 13387 steps, including 13387 resets, run took 30002 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 309073 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 421660 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Interrupted Random directed walk after 290464 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random walk after 428714 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2022-06-08 21:58:19] [INFO ] Flatten gal took : 4915 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12924295247415026810
[2022-06-08 21:58:22] [INFO ] Too many transitions (146565) to apply POR reductions. Disabling POR matrices.
[2022-06-08 21:58:23] [INFO ] Built C files in 1518ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12924295247415026810
Running compilation step : cd /tmp/ltsmin12924295247415026810;'/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 21:58:25] [INFO ] Applying decomposition
[2022-06-08 21:58:30] [INFO ] Flatten gal took : 4693 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/graph12030497508987553636.txt' '-o' '/tmp/graph12030497508987553636.bin' '-w' '/tmp/graph12030497508987553636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12030497508987553636.bin' '-l' '-1' '-v' '-w' '/tmp/graph12030497508987553636.weights' '-q' '0' '-e' '0.001'
[2022-06-08 21:58:38] [INFO ] Decomposing Gal with order
[2022-06-08 21:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 21:58:49] [INFO ] Removed a total of 378243 redundant transitions.
[2022-06-08 21:58:51] [INFO ] Flatten gal took : 8888 ms
[2022-06-08 21:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2494 labels/synchronizations in 17889 ms.
[2022-06-08 21:59:11] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8922341842443512063.gal : 255 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/ReachabilityDeadlock8922341842443512063.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.
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,345421,68.4586,276392,4801,509,265833,9732,72016,315078,774,29399,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,0,70.8148,276392,1,0,265833,9732,150919,315078,2776,29399,585824

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1241910 ms.

BK_STOP 1654725622437

--------------------
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="RERS2020-PT-pb101"
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 RERS2020-PT-pb101, 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-165472290100391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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