About the Execution of Smart+red for GPPP-PT-C1000N0000000100
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.r171-tall-167838859300893.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 GPPP-PT-C1000N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859300893
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679518484872
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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000100
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 20:54:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 20:54:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:54:46] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-22 20:54:46] [INFO ] Transformed 33 places.
[2023-03-22 20:54:46] [INFO ] Transformed 22 transitions.
[2023-03-22 20:54:46] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-22 20:54:46] [INFO ] Invariants computation overflowed in 12 ms
Incomplete random walk after 10008 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :27419
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :26896
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :26899
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :25131
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :27218
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :26995
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :25018
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :26947
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :26916
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :26886
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :26910
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :26923
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :26926
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :26943
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :25123
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :26907
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :26931
// Phase 1: matrix 22 rows 33 cols
[2023-03-22 20:54:46] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-22 20:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:46] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2023-03-22 20:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:46] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2023-03-22 20:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:46] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-22 20:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:46] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 20:54:47] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 20:54:47] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 20:54:47] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 20:54:47] [INFO ] Added : 17 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-22 20:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 20:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [200, 7000, 200, 7400, 2000, -1, 3, 1, 7000, 7, 1, 7, -1, 3000, 1, 7] Max seen :[200, 7000, 200, 7400, 2000, 199, 3, 1, 7000, 7, 1, 7, 406, 3000, 1, 7]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-13 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-08 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-03 7400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-01 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 25 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-22 20:54:48] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-22 20:54:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-22 20:54:48] [INFO ] Invariants computation overflowed in 1 ms
Incomplete random walk after 1000128 steps, including 795 resets, run finished after 271 ms. (steps per millisecond=3690 ) properties (out of 2) seen :799
Incomplete Best-First random walk after 1000001 steps, including 291 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 2) seen :807
Incomplete Best-First random walk after 1000001 steps, including 331 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 2) seen :408
// Phase 1: matrix 14 rows 24 cols
[2023-03-22 20:54:49] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-22 20:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 20:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2023-03-22 20:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 20:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:54:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [407, 407] Max seen :[407, 407]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-12 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-05 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3044 ms.
ITS solved all properties within timeout
BK_STOP 1679518490142
--------------------
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 UpperBounds -timeout 360 -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="GPPP-PT-C1000N0000000100"
export BK_EXAMINATION="UpperBounds"
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 GPPP-PT-C1000N0000000100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838859300893"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;