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.r408-oct2-167903727200288.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-oct2-167903727200288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 349K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679767172455

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-25 17:59:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 17:59:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 17:59:34] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-25 17:59:34] [INFO ] Transformed 1363 places.
[2023-03-25 17:59:34] [INFO ] Transformed 1263 transitions.
[2023-03-25 17:59:34] [INFO ] Found NUPN structural information;
[2023-03-25 17:59:34] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 234 ms.
Structural test allowed to assert that 544 places are NOT stable. Took 17 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 819) seen :803
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2023-03-25 17:59:35] [INFO ] Computed 221 place invariants in 19 ms
[2023-03-25 17:59:36] [INFO ] After 928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-25 17:59:37] [INFO ] [Nat]Absence check using 221 positive place invariants in 251 ms returned sat
[2023-03-25 17:59:40] [INFO ] After 2286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-25 17:59:41] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 6 ms to minimize.
[2023-03-25 17:59:41] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2023-03-25 17:59:41] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 14 ms to minimize.
[2023-03-25 17:59:42] [INFO ] Deduced a trap composed of 33 places in 541 ms of which 14 ms to minimize.
[2023-03-25 17:59:42] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 14 ms to minimize.
[2023-03-25 17:59:42] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2023-03-25 17:59:43] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 3 ms to minimize.
[2023-03-25 17:59:43] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 3 ms to minimize.
[2023-03-25 17:59:44] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 1 ms to minimize.
[2023-03-25 17:59:44] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2023-03-25 17:59:44] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 0 ms to minimize.
[2023-03-25 17:59:46] [INFO ] Deduced a trap composed of 40 places in 1298 ms of which 1 ms to minimize.
[2023-03-25 17:59:46] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-25 17:59:46] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-25 17:59:46] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 0 ms to minimize.
[2023-03-25 17:59:47] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2023-03-25 17:59:47] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2023-03-25 17:59:47] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 1 ms to minimize.
[2023-03-25 17:59:47] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2023-03-25 17:59:48] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 0 ms to minimize.
[2023-03-25 17:59:48] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 1 ms to minimize.
[2023-03-25 17:59:49] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2023-03-25 17:59:49] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 3 ms to minimize.
[2023-03-25 17:59:49] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 3 ms to minimize.
[2023-03-25 17:59:50] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2023-03-25 17:59:50] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 2 ms to minimize.
[2023-03-25 17:59:50] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 1 ms to minimize.
[2023-03-25 17:59:51] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2023-03-25 17:59:51] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 0 ms to minimize.
[2023-03-25 17:59:51] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 1 ms to minimize.
[2023-03-25 17:59:52] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 0 ms to minimize.
[2023-03-25 17:59:52] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2023-03-25 17:59:52] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 1 ms to minimize.
[2023-03-25 17:59:53] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 2 ms to minimize.
[2023-03-25 17:59:53] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 0 ms to minimize.
[2023-03-25 17:59:53] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 1 ms to minimize.
[2023-03-25 17:59:53] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2023-03-25 17:59:54] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-03-25 17:59:54] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 1 ms to minimize.
[2023-03-25 17:59:54] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 0 ms to minimize.
[2023-03-25 17:59:55] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 0 ms to minimize.
[2023-03-25 17:59:55] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-25 17:59:55] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 14 ms to minimize.
[2023-03-25 17:59:56] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 0 ms to minimize.
[2023-03-25 17:59:56] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2023-03-25 17:59:56] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 0 ms to minimize.
[2023-03-25 17:59:57] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 1 ms to minimize.
[2023-03-25 17:59:57] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2023-03-25 17:59:57] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 1 ms to minimize.
[2023-03-25 17:59:58] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 1 ms to minimize.
[2023-03-25 17:59:58] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 2 ms to minimize.
[2023-03-25 17:59:58] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-25 17:59:58] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2023-03-25 17:59:59] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 19 ms to minimize.
[2023-03-25 17:59:59] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 0 ms to minimize.
[2023-03-25 17:59:59] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-25 18:00:00] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-25 18:00:00] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 0 ms to minimize.
[2023-03-25 18:00:00] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2023-03-25 18:00:00] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2023-03-25 18:00:00] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2023-03-25 18:00:01] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2023-03-25 18:00:01] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 1 ms to minimize.
[2023-03-25 18:00:01] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2023-03-25 18:00:01] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 19 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-25 18:00:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 18:00:01] [INFO ] After 25235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 2190 ms.
Support contains 16 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1363 transition count 1121
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1221 transition count 1121
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1221 transition count 1021
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1121 transition count 1021
Discarding 124 places :
Symmetric choice reduction at 2 with 124 rule applications. Total rules 608 place count 997 transition count 897
Iterating global reduction 2 with 124 rules applied. Total rules applied 732 place count 997 transition count 897
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 732 place count 997 transition count 837
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 852 place count 937 transition count 837
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1452 place count 637 transition count 537
Partial Free-agglomeration rule applied 177 times.
Drop transitions removed 177 transitions
Iterating global reduction 2 with 177 rules applied. Total rules applied 1629 place count 637 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1630 place count 636 transition count 536
Applied a total of 1630 rules in 497 ms. Remains 636 /1363 variables (removed 727) and now considering 536/1263 (removed 727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 636/1363 places, 536/1263 transitions.
Finished random walk after 346107 steps, including 1 resets, run visited all 16 properties in 2133 ms. (steps per millisecond=162 )
Able to resolve query StableMarking after proving 820 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 32052 ms.
ITS solved all properties within timeout

BK_STOP 1679767206911

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldPPPs-PT-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r408-oct2-167903727200288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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