About the Execution of LTSMin+red for CSRepetitions-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1781.039 | 3592238.00 | 14295100.00 | 565.70 | FTFFTTTFFFTFT?FF | 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.r073-smll-167814399100094.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 ltsminxred
Input is CSRepetitions-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399100094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 409K Feb 25 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 721K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 216K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 550K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 240K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 735K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 679K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 CSRepetitions-PT-10-ReachabilityCardinality-00
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-01
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-02
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-03
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-04
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-05
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-06
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-07
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-08
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-09
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-10
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-11
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-12
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-13
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-14
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678273378154
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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 11:03:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 11:03:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:03:01] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2023-03-08 11:03:01] [INFO ] Transformed 1311 places.
[2023-03-08 11:03:01] [INFO ] Transformed 2300 transitions.
[2023-03-08 11:03:01] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 324 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10005 steps, including 55 resets, run finished after 1109 ms. (steps per millisecond=9 ) properties (out of 16) seen :6
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1009 ms. (steps per millisecond=9 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 11:03:05] [INFO ] Computed 110 place invariants in 82 ms
[2023-03-08 11:03:08] [INFO ] [Real]Absence check using 110 positive place invariants in 71 ms returned sat
[2023-03-08 11:03:08] [INFO ] After 1266ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:7
[2023-03-08 11:03:09] [INFO ] [Nat]Absence check using 110 positive place invariants in 68 ms returned sat
[2023-03-08 11:03:10] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-08 11:03:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 11:03:10] [INFO ] After 275ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :9 sat :1
[2023-03-08 11:03:10] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-08 11:03:11] [INFO ] After 2792ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 71 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1311 transition count 2203
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 4 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 1 with 258 rules applied. Total rules applied 355 place count 1139 transition count 2117
Discarding 802 places :
Symmetric choice reduction at 1 with 802 rule applications. Total rules 1157 place count 337 transition count 1315
Iterating global reduction 1 with 802 rules applied. Total rules applied 1959 place count 337 transition count 1315
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 1997 place count 299 transition count 935
Iterating global reduction 1 with 38 rules applied. Total rules applied 2035 place count 299 transition count 935
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 2073 place count 299 transition count 897
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 2093 place count 289 transition count 887
Free-agglomeration rule applied 46 times.
Iterating global reduction 2 with 46 rules applied. Total rules applied 2139 place count 289 transition count 841
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 412 transitions
Reduce isomorphic transitions removed 412 transitions.
Iterating post reduction 2 with 458 rules applied. Total rules applied 2597 place count 243 transition count 429
Applied a total of 2597 rules in 692 ms. Remains 243 /1311 variables (removed 1068) and now considering 429/2300 (removed 1871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 243/1311 places, 429/2300 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1116467 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Probabilistic random walk after 1116467 steps, saw 924085 distinct states, run finished after 3002 ms. (steps per millisecond=371 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:03:15] [INFO ] Flow matrix only has 411 transitions (discarded 18 similar events)
// Phase 1: matrix 411 rows 243 cols
[2023-03-08 11:03:15] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-08 11:03:15] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:03:15] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-08 11:03:15] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:03:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 11:03:15] [INFO ] After 90ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:03:15] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-08 11:03:15] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 71 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 429/429 transitions.
Applied a total of 0 rules in 18 ms. Remains 243 /243 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 243/243 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 429/429 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2023-03-08 11:03:15] [INFO ] Flow matrix only has 411 transitions (discarded 18 similar events)
[2023-03-08 11:03:15] [INFO ] Invariant cache hit.
[2023-03-08 11:03:16] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-08 11:03:16] [INFO ] Flow matrix only has 411 transitions (discarded 18 similar events)
[2023-03-08 11:03:16] [INFO ] Invariant cache hit.
[2023-03-08 11:03:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 11:03:16] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-08 11:03:16] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-08 11:03:16] [INFO ] Flow matrix only has 411 transitions (discarded 18 similar events)
[2023-03-08 11:03:16] [INFO ] Invariant cache hit.
[2023-03-08 11:03:16] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 243/243 places, 429/429 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 243 transition count 411
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 243 transition count 398
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 44 place count 230 transition count 398
Applied a total of 44 rules in 35 ms. Remains 230 /243 variables (removed 13) and now considering 398/429 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 398 rows 230 cols
[2023-03-08 11:03:16] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-08 11:03:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:03:17] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2023-03-08 11:03:17] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:03:17] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-08 11:03:17] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:03:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-08 11:03:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 429 transitions and 1579 arcs took 4 ms.
[2023-03-08 11:03:17] [INFO ] Flatten gal took : 113 ms
Total runtime 17008 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/496/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 14353988 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16086180 kB
Could not compute solution for formula : CSRepetitions-PT-10-ReachabilityCardinality-13
BK_STOP 1678276970392
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
rfs formula name CSRepetitions-PT-10-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/496/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 243 places, 429 transitions and 1579 arcs
pnml2lts-sym: Petri net CSRepetitions_PT_10 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 429->362 groups
pnml2lts-sym: Regrouping took 0.160 real 0.160 user 0.000 sys
pnml2lts-sym: state vector length is 243; there are 362 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 502
Killing (9) : 502
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="CSRepetitions-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CSRepetitions-PT-10, 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 r073-smll-167814399100094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 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 ;