Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r352-tall-167889221100151.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is RERS2020-PT-pb104, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-tall-167889221100151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 81M
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 80M Mar 5 18:23 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 1679148576752

Running Version 202205111006
[2023-03-18 14:09:37] [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]
[2023-03-18 14:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:09:40] [INFO ] Load time of PNML (sax parser for PT used): 2516 ms
[2023-03-18 14:09:40] [INFO ] Transformed 1353 places.
[2023-03-18 14:09:41] [INFO ] Transformed 143642 transitions.
[2023-03-18 14:09:41] [INFO ] Found NUPN structural information;
[2023-03-18 14:09:41] [INFO ] Parsed PT model containing 1353 places and 143642 transitions in 3126 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13930 transitions
Reduce redundant transitions removed 13930 transitions.
Built sparse matrix representations for Structural reductions in 43 ms.253259KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1353/1353 places, 129712/129712 transitions.
Computed a total of 397 stabilizing places and 51386 stable transitions
Ensure Unique test removed 8 places
Computed a total of 389 stabilizing places and 51386 stable transitions
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1345 transition count 129712
Computed a total of 389 stabilizing places and 51386 stable transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 8 place count 1345 transition count 129703
Deduced a syphon composed of 9 places in 68 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 1336 transition count 129703
Computed a total of 381 stabilizing places and 51378 stable transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 65 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 70 place count 1314 transition count 129681
Computed a total of 369 stabilizing places and 51366 stable transitions
Computed a total of 369 stabilizing places and 51366 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1313 transition count 129680
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 71 rules in 5555 ms. Remains 1313 /1353 variables (removed 40) and now considering 129680/129712 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 1313/1353 places, 129680/129712 transitions.
Interrupted Random walk after 327922 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 14:10:18] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-18 14:10:18] [INFO ] Computed 9 place invariants in 563 ms
[2023-03-18 14:10:28] [INFO ] [Real]Absence check using 9 positive place invariants in 40 ms returned sat
[2023-03-18 14:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:10:54] [INFO ] [Real]Absence check using state equation in 26181 ms returned sat
[2023-03-18 14:10:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:11:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 66 ms returned sat
[2023-03-18 14:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:11:29] [INFO ] [Nat]Absence check using state equation in 25068 ms returned sat
[2023-03-18 14:11:31] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2023-03-18 14:11:41] [INFO ] [Nat]Added 3453 Read/Feed constraints in 10888 ms returned sat
[2023-03-18 14:11:53] [INFO ] Deduced a trap composed of 231 places in 10540 ms of which 10 ms to minimize.
[2023-03-18 14:12:06] [INFO ] Deduced a trap composed of 43 places in 10997 ms of which 3 ms to minimize.
[2023-03-18 14:12:18] [INFO ] Deduced a trap composed of 52 places in 11140 ms of which 2 ms to minimize.
[2023-03-18 14:12:30] [INFO ] Deduced a trap composed of 35 places in 11005 ms of which 2 ms to minimize.
[2023-03-18 14:12:42] [INFO ] Deduced a trap composed of 102 places in 11002 ms of which 2 ms to minimize.
[2023-03-18 14:12:54] [INFO ] Deduced a trap composed of 188 places in 10708 ms of which 2 ms to minimize.
[2023-03-18 14:13:07] [INFO ] Deduced a trap composed of 242 places in 10771 ms of which 1 ms to minimize.
[2023-03-18 14:13:19] [INFO ] Deduced a trap composed of 247 places in 11409 ms of which 3 ms to minimize.
[2023-03-18 14:13:31] [INFO ] Deduced a trap composed of 51 places in 10272 ms of which 2 ms to minimize.
[2023-03-18 14:13:42] [INFO ] Deduced a trap composed of 61 places in 10256 ms of which 2 ms to minimize.
[2023-03-18 14:13:54] [INFO ] Deduced a trap composed of 119 places in 10266 ms of which 2 ms to minimize.
[2023-03-18 14:14:06] [INFO ] Deduced a trap composed of 150 places in 11028 ms of which 2 ms to minimize.
[2023-03-18 14:14:19] [INFO ] Deduced a trap composed of 74 places in 11257 ms of which 2 ms to minimize.
[2023-03-18 14:14:30] [INFO ] Deduced a trap composed of 407 places in 10473 ms of which 2 ms to minimize.
[2023-03-18 14:14:39] [INFO ] Deduced a trap composed of 142 places in 7963 ms of which 1 ms to minimize.
[2023-03-18 14:14:49] [INFO ] Deduced a trap composed of 38 places in 8597 ms of which 2 ms to minimize.
[2023-03-18 14:15:00] [INFO ] Deduced a trap composed of 21 places in 9123 ms of which 2 ms to minimize.
[2023-03-18 14:15:10] [INFO ] Deduced a trap composed of 90 places in 8900 ms of which 1 ms to minimize.
[2023-03-18 14:15:18] [INFO ] Deduced a trap composed of 71 places in 7166 ms of which 1 ms to minimize.
[2023-03-18 14:15:27] [INFO ] Deduced a trap composed of 104 places in 7073 ms of which 2 ms to minimize.
[2023-03-18 14:15:36] [INFO ] Deduced a trap composed of 102 places in 8340 ms of which 2 ms to minimize.
[2023-03-18 14:15:44] [INFO ] Deduced a trap composed of 338 places in 6444 ms of which 1 ms to minimize.
[2023-03-18 14:15:51] [INFO ] Deduced a trap composed of 285 places in 6021 ms of which 1 ms to minimize.
[2023-03-18 14:15:58] [INFO ] Deduced a trap composed of 155 places in 6161 ms of which 1 ms to minimize.
[2023-03-18 14:15:58] [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 222179 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 355220 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 225249 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=7 )
Interrupted Random walk after 365910 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 0 rules in 1295 ms. Remains 1313 /1313 variables (removed 0) and now considering 129680/129680 (removed 0) transitions.
[2023-03-18 14:18:00] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-18 14:18:00] [INFO ] Computed 9 place invariants in 421 ms
[2023-03-18 14:18:05] [INFO ] Implicit Places using invariants in 5008 ms returned []
Implicit Place search using SMT only with invariants took 5010 ms to find 0 implicit places.
[2023-03-18 14:18:05] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-18 14:18:05] [INFO ] Computed 9 place invariants in 444 ms
[2023-03-18 14:18:35] [INFO ] Performed 80402/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 14:18:54] [INFO ] Dead Transitions using invariants and state equation in 48847 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1313/1313 places, 129680/129680 transitions.
Interrupted Random walk after 359685 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 14:19:24] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-18 14:19:24] [INFO ] Computed 9 place invariants in 430 ms
[2023-03-18 14:19:33] [INFO ] [Real]Absence check using 9 positive place invariants in 40 ms returned sat
[2023-03-18 14:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:20:00] [INFO ] [Real]Absence check using state equation in 26663 ms returned sat
[2023-03-18 14:20:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:20:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 66 ms returned sat
[2023-03-18 14:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:20:36] [INFO ] [Nat]Absence check using state equation in 25583 ms returned sat
[2023-03-18 14:20:37] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2023-03-18 14:20:48] [INFO ] [Nat]Added 3453 Read/Feed constraints in 11540 ms returned sat
[2023-03-18 14:21:01] [INFO ] Deduced a trap composed of 231 places in 11256 ms of which 1 ms to minimize.
[2023-03-18 14:21:13] [INFO ] Deduced a trap composed of 43 places in 10639 ms of which 1 ms to minimize.
[2023-03-18 14:21:25] [INFO ] Deduced a trap composed of 52 places in 11179 ms of which 2 ms to minimize.
[2023-03-18 14:21:38] [INFO ] Deduced a trap composed of 35 places in 11265 ms of which 2 ms to minimize.
[2023-03-18 14:21:50] [INFO ] Deduced a trap composed of 102 places in 10806 ms of which 2 ms to minimize.
[2023-03-18 14:22:02] [INFO ] Deduced a trap composed of 188 places in 10550 ms of which 2 ms to minimize.
[2023-03-18 14:22:14] [INFO ] Deduced a trap composed of 242 places in 10752 ms of which 2 ms to minimize.
[2023-03-18 14:22:26] [INFO ] Deduced a trap composed of 247 places in 10922 ms of which 2 ms to minimize.
[2023-03-18 14:22:37] [INFO ] Deduced a trap composed of 51 places in 9975 ms of which 2 ms to minimize.
[2023-03-18 14:22:49] [INFO ] Deduced a trap composed of 61 places in 10323 ms of which 2 ms to minimize.
[2023-03-18 14:23:00] [INFO ] Deduced a trap composed of 119 places in 10088 ms of which 2 ms to minimize.
[2023-03-18 14:23:12] [INFO ] Deduced a trap composed of 150 places in 10867 ms of which 2 ms to minimize.
[2023-03-18 14:23:24] [INFO ] Deduced a trap composed of 74 places in 10829 ms of which 2 ms to minimize.
[2023-03-18 14:23:36] [INFO ] Deduced a trap composed of 407 places in 10091 ms of which 2 ms to minimize.
[2023-03-18 14:23:45] [INFO ] Deduced a trap composed of 142 places in 7898 ms of which 1 ms to minimize.
[2023-03-18 14:23:54] [INFO ] Deduced a trap composed of 38 places in 8362 ms of which 2 ms to minimize.
[2023-03-18 14:24:05] [INFO ] Deduced a trap composed of 21 places in 9058 ms of which 1 ms to minimize.
[2023-03-18 14:24:15] [INFO ] Deduced a trap composed of 90 places in 8987 ms of which 2 ms to minimize.
[2023-03-18 14:24:23] [INFO ] Deduced a trap composed of 71 places in 7045 ms of which 1 ms to minimize.
[2023-03-18 14:24:32] [INFO ] Deduced a trap composed of 104 places in 7018 ms of which 1 ms to minimize.
[2023-03-18 14:24:41] [INFO ] Deduced a trap composed of 102 places in 8340 ms of which 1 ms to minimize.
[2023-03-18 14:24:49] [INFO ] Deduced a trap composed of 338 places in 6323 ms of which 1 ms to minimize.
[2023-03-18 14:24:56] [INFO ] Deduced a trap composed of 285 places in 5933 ms of which 1 ms to minimize.
[2023-03-18 14:25:03] [INFO ] Deduced a trap composed of 155 places in 6281 ms of which 1 ms to minimize.
[2023-03-18 14:25:03] [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 232348 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 375714 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 236368 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 365302 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
[2023-03-18 14:27:09] [INFO ] Flatten gal took : 4331 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin939076132278282177
[2023-03-18 14:27:11] [INFO ] Too many transitions (129712) to apply POR reductions. Disabling POR matrices.
[2023-03-18 14:27:13] [INFO ] Built C files in 2174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin939076132278282177
Running compilation step : cd /tmp/ltsmin939076132278282177;'/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'
[2023-03-18 14:27:14] [INFO ] Applying decomposition
[2023-03-18 14:27:19] [INFO ] Flatten gal took : 4357 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/graph5528780107068227224.txt' '-o' '/tmp/graph5528780107068227224.bin' '-w' '/tmp/graph5528780107068227224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5528780107068227224.bin' '-l' '-1' '-v' '-w' '/tmp/graph5528780107068227224.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:27:27] [INFO ] Decomposing Gal with order
[2023-03-18 14:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:27:42] [INFO ] Removed a total of 243458 redundant transitions.
[2023-03-18 14:27:43] [INFO ] Flatten gal took : 12815 ms
[2023-03-18 14:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4889 labels/synchronizations in 8177 ms.
[2023-03-18 14:27:55] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11118225290671809910.gal : 560 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/ReachabilityDeadlock11118225290671809910.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...226
No direction supplied, using forward translation only.

BK_STOP 1679149986140

--------------------
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-pb104"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is RERS2020-PT-pb104, 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 r352-tall-167889221100151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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