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.r005-oct2-167813592500013.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 itstools
Input is ASLink-PT-01a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-UpperBounds-00
FORMULA_NAME ASLink-PT-01a-UpperBounds-01
FORMULA_NAME ASLink-PT-01a-UpperBounds-02
FORMULA_NAME ASLink-PT-01a-UpperBounds-03
FORMULA_NAME ASLink-PT-01a-UpperBounds-04
FORMULA_NAME ASLink-PT-01a-UpperBounds-05
FORMULA_NAME ASLink-PT-01a-UpperBounds-06
FORMULA_NAME ASLink-PT-01a-UpperBounds-07
FORMULA_NAME ASLink-PT-01a-UpperBounds-08
FORMULA_NAME ASLink-PT-01a-UpperBounds-09
FORMULA_NAME ASLink-PT-01a-UpperBounds-10
FORMULA_NAME ASLink-PT-01a-UpperBounds-11
FORMULA_NAME ASLink-PT-01a-UpperBounds-12
FORMULA_NAME ASLink-PT-01a-UpperBounds-13
FORMULA_NAME ASLink-PT-01a-UpperBounds-14
FORMULA_NAME ASLink-PT-01a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678485890079

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 22:04:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 22:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:04:52] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-10 22:04:52] [INFO ] Transformed 431 places.
[2023-03-10 22:04:52] [INFO ] Transformed 735 transitions.
[2023-03-10 22:04:52] [INFO ] Found NUPN structural information;
[2023-03-10 22:04:52] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
// Phase 1: matrix 728 rows 431 cols
[2023-03-10 22:04:53] [INFO ] Computed 80 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 205 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :11
FORMULA ASLink-PT-01a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :4
FORMULA ASLink-PT-01a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 22:04:53] [INFO ] Invariant cache hit.
[2023-03-10 22:04:53] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-10 22:04:53] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2023-03-10 22:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:04:53] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-10 22:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:04:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-10 22:04:54] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 18 ms returned sat
[2023-03-10 22:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:04:54] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2023-03-10 22:04:55] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2023-03-10 22:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-10 22:04:55] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 82 ms.
[2023-03-10 22:04:59] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 2 ms to minimize.
[2023-03-10 22:04:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 431 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 727/727 transitions.
Graph (complete) has 1766 edges and 431 vertex of which 430 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 424 transition count 695
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 71 place count 392 transition count 695
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 71 place count 392 transition count 666
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 140 place count 352 transition count 666
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 352 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 351 transition count 665
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 347 transition count 648
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 346 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 157 place count 345 transition count 643
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 342 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 161 place count 341 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 341 transition count 635
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 163 place count 340 transition count 627
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 340 transition count 627
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 339 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 339 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 338 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 338 transition count 611
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 169 place count 337 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 337 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 171 place count 336 transition count 595
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 336 transition count 595
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 335 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 335 transition count 587
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 175 place count 334 transition count 579
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 334 transition count 579
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 177 place count 333 transition count 571
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 333 transition count 571
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 179 place count 332 transition count 563
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 332 transition count 563
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 181 place count 331 transition count 555
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 331 transition count 555
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 183 place count 330 transition count 547
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 330 transition count 547
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 185 place count 329 transition count 539
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 329 transition count 539
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 187 place count 328 transition count 531
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 328 transition count 531
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 189 place count 327 transition count 523
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 327 transition count 523
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 326 transition count 515
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 326 transition count 515
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 206 place count 319 transition count 508
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 208 place count 319 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 318 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 211 place count 316 transition count 507
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 211 place count 316 transition count 503
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 220 place count 311 transition count 503
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 222 place count 309 transition count 503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 222 place count 309 transition count 502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 224 place count 308 transition count 502
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 228 place count 306 transition count 500
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 229 place count 305 transition count 499
Iterating global reduction 8 with 1 rules applied. Total rules applied 230 place count 305 transition count 499
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 305 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 232 place count 304 transition count 498
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 233 place count 304 transition count 498
Applied a total of 233 rules in 388 ms. Remains 304 /431 variables (removed 127) and now considering 498/727 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 304/431 places, 498/727 transitions.
// Phase 1: matrix 498 rows 304 cols
[2023-03-10 22:04:59] [INFO ] Computed 55 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 21039 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties (out of 1) seen :1
FORMULA ASLink-PT-01a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8638 ms.

BK_STOP 1678485901599

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ASLink-PT-01a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-01a, 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 r005-oct2-167813592500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;