About the Execution of Marcie+red for GPUForwardProgress-PT-40b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9981.571 | 2950131.00 | 2977326.00 | 7425.60 | TTFFTTFTTTTTFTFF | normal |
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.r202-smll-167840348300158.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 marciexred
Input is GPUForwardProgress-PT-40b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348300158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 199K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-00
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-01
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-02
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-03
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-04
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-05
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-06
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-07
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-08
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-09
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-10
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-11
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-12
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-13
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-14
FORMULA_NAME GPUForwardProgress-PT-40b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678634595681
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 15:23:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:23:19] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-12 15:23:19] [INFO ] Transformed 796 places.
[2023-03-12 15:23:19] [INFO ] Transformed 837 transitions.
[2023-03-12 15:23:19] [INFO ] Found NUPN structural information;
[2023-03-12 15:23:19] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 29 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 14) seen :4
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 837 rows 796 cols
[2023-03-12 15:23:21] [INFO ] Computed 42 place invariants in 47 ms
[2023-03-12 15:23:22] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 15:23:23] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 67 ms returned sat
[2023-03-12 15:23:25] [INFO ] After 1489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 15:23:26] [INFO ] After 3064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 939 ms.
[2023-03-12 15:23:27] [INFO ] After 4982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 326 ms.
Support contains 42 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 837/837 transitions.
Graph (trivial) has 636 edges and 796 vertex of which 7 / 796 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 377 transitions
Trivial Post-agglo rules discarded 377 transitions
Performed 377 trivial Post agglomeration. Transition count delta: 377
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 789 transition count 452
Reduce places removed 377 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 431 rules applied. Total rules applied 810 place count 412 transition count 398
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 835 place count 387 transition count 398
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 835 place count 387 transition count 326
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 979 place count 315 transition count 326
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 988 place count 306 transition count 317
Iterating global reduction 3 with 9 rules applied. Total rules applied 997 place count 306 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1001 place count 306 transition count 313
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1001 place count 306 transition count 309
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1009 place count 302 transition count 309
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 1191 place count 211 transition count 218
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1205 place count 204 transition count 218
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1213 place count 204 transition count 210
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1218 place count 204 transition count 205
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1223 place count 199 transition count 205
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1225 place count 199 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1226 place count 198 transition count 204
Applied a total of 1226 rules in 349 ms. Remains 198 /796 variables (removed 598) and now considering 204/837 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 198/796 places, 204/837 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 15:23:29] [INFO ] Flow matrix only has 183 transitions (discarded 21 similar events)
// Phase 1: matrix 183 rows 198 cols
[2023-03-12 15:23:29] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-12 15:23:29] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 15:23:29] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-12 15:23:29] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 15:23:29] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-12 15:23:29] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
Support contains 16 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 204/204 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 198 transition count 192
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 186 transition count 192
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 24 place count 186 transition count 179
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 173 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 171 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 171 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 171 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 56 place count 171 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 169 transition count 172
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 94 place count 152 transition count 153
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 128 place count 152 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 152 transition count 119
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 152 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 151 transition count 117
Applied a total of 131 rules in 48 ms. Remains 151 /198 variables (removed 47) and now considering 117/204 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 151/198 places, 117/204 transitions.
Finished random walk after 7860 steps, including 209 resets, run visited all 2 properties in 26 ms. (steps per millisecond=302 )
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10569 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: GPUForwardProgress_PT_40b
(NrP: 796 NrTr: 837 NrArc: 2077)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.106sec
net check time: 0m 0.000sec
init dd package: 0m 3.484sec
before gc: list nodes free: 1716598
after gc: idd nodes used:37225841, unused:26774159; list nodes free:115856746
RS generation: 48m24.964sec
-> last computed set: #nodes 37225047 (3.7e+07) #states 49,101,290,767,910,230,600,982,679,953 (28)
CANNOT_COMPUTE
BK_STOP 1678637545812
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.003sec
idd.cc:820: DD Exception: No free nodes
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="GPUForwardProgress-PT-40b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 marciexred"
echo " Input is GPUForwardProgress-PT-40b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-40b.tgz
mv GPUForwardProgress-PT-40b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;