About the Execution of Smart+red for Anderson-PT-11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
808.023 | 77635.00 | 96352.00 | 548.40 | TTTFFTTFFT?TFTFT | 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.r523-tall-167987247500063.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 smartxred
Input is Anderson-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247500063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-ReachabilityFireability-00
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-01
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-02
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-03
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-04
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-05
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-06
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-07
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-08
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-09
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-10
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-11
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-12
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-13
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-14
FORMULA_NAME Anderson-PT-11-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1680825853275
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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 00:04:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 00:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:04:15] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-04-07 00:04:15] [INFO ] Transformed 749 places.
[2023-04-07 00:04:15] [INFO ] Transformed 3245 transitions.
[2023-04-07 00:04:15] [INFO ] Found NUPN structural information;
[2023-04-07 00:04:15] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 16) seen :3
FORMULA Anderson-PT-11-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :1
FORMULA Anderson-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :1
FORMULA Anderson-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :2
FORMULA Anderson-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :1
FORMULA Anderson-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3245 rows 749 cols
[2023-04-07 00:04:16] [INFO ] Computed 25 invariants in 76 ms
[2023-04-07 00:04:17] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 00:04:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 00:04:18] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 14 ms returned sat
[2023-04-07 00:04:20] [INFO ] After 1765ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-04-07 00:04:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:04:21] [INFO ] After 1002ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2023-04-07 00:04:21] [INFO ] Deduced a trap composed of 294 places in 613 ms of which 9 ms to minimize.
[2023-04-07 00:04:22] [INFO ] Deduced a trap composed of 160 places in 617 ms of which 1 ms to minimize.
[2023-04-07 00:04:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1466 ms
[2023-04-07 00:04:23] [INFO ] Deduced a trap composed of 333 places in 595 ms of which 1 ms to minimize.
[2023-04-07 00:04:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 752 ms
[2023-04-07 00:04:23] [INFO ] After 3565ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-04-07 00:04:23] [INFO ] After 5949ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA Anderson-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-11-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-11-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 62 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 106 Pre rules applied. Total rules applied 0 place count 749 transition count 3139
Deduced a syphon composed of 106 places in 4 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 0 with 212 rules applied. Total rules applied 212 place count 643 transition count 3139
Discarding 188 places :
Symmetric choice reduction at 0 with 188 rule applications. Total rules 400 place count 455 transition count 1311
Iterating global reduction 0 with 188 rules applied. Total rules applied 588 place count 455 transition count 1311
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 596 place count 451 transition count 1307
Applied a total of 596 rules in 202 ms. Remains 451 /749 variables (removed 298) and now considering 1307/3245 (removed 1938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 451/749 places, 1307/3245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
FORMULA Anderson-PT-11-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1307 rows 451 cols
[2023-04-07 00:04:24] [INFO ] Computed 25 invariants in 25 ms
[2023-04-07 00:04:24] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:04:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 00:04:24] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 11 ms returned sat
[2023-04-07 00:04:25] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:25] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:04:25] [INFO ] After 430ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:25] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 00:04:25] [INFO ] After 1255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 28 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 1307/1307 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 436 transition count 992
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 436 transition count 992
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 433 transition count 989
Applied a total of 36 rules in 69 ms. Remains 433 /451 variables (removed 18) and now considering 989/1307 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 433/451 places, 989/1307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989659 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989659 steps, saw 728259 distinct states, run finished after 3003 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 989 rows 433 cols
[2023-04-07 00:04:28] [INFO ] Computed 25 invariants in 13 ms
[2023-04-07 00:04:29] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:04:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 00:04:29] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 00:04:30] [INFO ] After 1332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:30] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:04:31] [INFO ] After 646ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:31] [INFO ] After 1342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 645 ms.
[2023-04-07 00:04:32] [INFO ] After 3425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 28 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 989/989 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 989/989 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 433/433 places, 989/989 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 989/989 transitions.
Applied a total of 0 rules in 23 ms. Remains 433 /433 variables (removed 0) and now considering 989/989 (removed 0) transitions.
[2023-04-07 00:04:32] [INFO ] Invariant cache hit.
[2023-04-07 00:04:32] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-04-07 00:04:32] [INFO ] Invariant cache hit.
[2023-04-07 00:04:33] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:04:34] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-04-07 00:04:34] [INFO ] Redundant transitions in 56 ms returned []
[2023-04-07 00:04:34] [INFO ] Invariant cache hit.
[2023-04-07 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2779 ms. Remains : 433/433 places, 989/989 transitions.
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 120 Pre rules applied. Total rules applied 0 place count 433 transition count 869
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 0 with 240 rules applied. Total rules applied 240 place count 313 transition count 869
Applied a total of 240 rules in 23 ms. Remains 313 /433 variables (removed 120) and now considering 869/989 (removed 120) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 869 rows 313 cols
[2023-04-07 00:04:35] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 00:04:35] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:04:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 00:04:35] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 00:04:35] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:36] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-04-07 00:04:36] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:04:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-04-07 00:04:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 989 transitions and 3954 arcs took 7 ms.
[2023-04-07 00:04:36] [INFO ] Flatten gal took : 108 ms
Total runtime 21663 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Anderson (PT), instance 11
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 433 places, 989 transitions, 3954 arcs.
Final Score: 50315.41
Took : 52 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1680825930910
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 5395:
syntax error
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="Anderson-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Anderson-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r523-tall-167987247500063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;