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.r071-smll-167814397900389.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 lolaxred
Input is CloudDeployment-PT-3b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397900389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 308K 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 CloudDeployment-PT-3b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-3b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678276347673

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:52:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 11:52:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:52:30] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-08 11:52:30] [INFO ] Transformed 859 places.
[2023-03-08 11:52:30] [INFO ] Transformed 1152 transitions.
[2023-03-08 11:52:30] [INFO ] Found NUPN structural information;
[2023-03-08 11:52:30] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 1152 rows 859 cols
[2023-03-08 11:52:30] [INFO ] Computed 13 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 105 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :11
FORMULA CloudDeployment-PT-3b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-08 11:52:31] [INFO ] Invariant cache hit.
[2023-03-08 11:52:31] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 42 ms returned sat
[2023-03-08 11:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:32] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-08 11:52:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:52:32] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 26 ms returned sat
[2023-03-08 11:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:33] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2023-03-08 11:52:33] [INFO ] Computed and/alt/rep : 1070/2452/1070 causal constraints (skipped 81 transitions) in 141 ms.
[2023-03-08 11:52:37] [INFO ] Added : 260 causal constraints over 52 iterations in 3976 ms. Result :unknown
[2023-03-08 11:52:37] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 21 ms returned sat
[2023-03-08 11:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:38] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2023-03-08 11:52:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:52:38] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 26 ms returned sat
[2023-03-08 11:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:39] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-08 11:52:39] [INFO ] Computed and/alt/rep : 1070/2452/1070 causal constraints (skipped 81 transitions) in 83 ms.
[2023-03-08 11:52:43] [INFO ] Added : 255 causal constraints over 51 iterations in 4257 ms. Result :unknown
[2023-03-08 11:52:43] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 24 ms returned sat
[2023-03-08 11:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:44] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-08 11:52:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:52:44] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 25 ms returned sat
[2023-03-08 11:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:45] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-08 11:52:45] [INFO ] Computed and/alt/rep : 1070/2452/1070 causal constraints (skipped 81 transitions) in 117 ms.
[2023-03-08 11:52:49] [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 2
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.refineWithCausalOrder(DeadlockTester.java:1186)
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)
[2023-03-08 11:52:49] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 38 ms returned sat
[2023-03-08 11:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:50] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2023-03-08 11:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:52:51] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 33 ms returned sat
[2023-03-08 11:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:51] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2023-03-08 11:52:51] [INFO ] Computed and/alt/rep : 1070/2452/1070 causal constraints (skipped 81 transitions) in 90 ms.
[2023-03-08 11:52:55] [INFO ] Added : 215 causal constraints over 43 iterations in 4092 ms. Result :unknown
[2023-03-08 11:52:56] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 35 ms returned sat
[2023-03-08 11:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:56] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2023-03-08 11:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:52:57] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 26 ms returned sat
[2023-03-08 11:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:52:57] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2023-03-08 11:52:57] [INFO ] Computed and/alt/rep : 1070/2452/1070 causal constraints (skipped 81 transitions) in 112 ms.
[2023-03-08 11:53:01] [INFO ] Added : 250 causal constraints over 50 iterations in 4188 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Graph (trivial) has 865 edges and 859 vertex of which 238 / 859 are part of one of the 22 SCC in 8 ms
Free SCC test removed 216 places
Drop transitions removed 329 transitions
Reduce isomorphic transitions removed 329 transitions.
Graph (complete) has 1586 edges and 643 vertex of which 622 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 325 rules applied. Total rules applied 327 place count 622 transition count 496
Reduce places removed 314 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 316 rules applied. Total rules applied 643 place count 308 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 645 place count 306 transition count 494
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 645 place count 306 transition count 482
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 669 place count 294 transition count 482
Discarding 108 places :
Symmetric choice reduction at 3 with 108 rule applications. Total rules 777 place count 186 transition count 374
Iterating global reduction 3 with 108 rules applied. Total rules applied 885 place count 186 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 891 place count 186 transition count 368
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 891 place count 186 transition count 354
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 919 place count 172 transition count 354
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 920 place count 171 transition count 353
Iterating global reduction 4 with 1 rules applied. Total rules applied 921 place count 171 transition count 353
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1009 place count 127 transition count 309
Performed 21 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1051 place count 106 transition count 372
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1058 place count 106 transition count 365
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 1111 place count 106 transition count 312
Free-agglomeration rule applied 31 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 31 rules applied. Total rules applied 1142 place count 106 transition count 275
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 33 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 419 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 83 rules applied. Total rules applied 1225 place count 74 transition count 224
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1226 place count 74 transition count 223
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1229 place count 71 transition count 211
Iterating global reduction 7 with 3 rules applied. Total rules applied 1232 place count 71 transition count 211
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1259 place count 71 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1260 place count 70 transition count 183
Applied a total of 1260 rules in 243 ms. Remains 70 /859 variables (removed 789) and now considering 183/1152 (removed 969) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 70/859 places, 183/1152 transitions.
Normalized transition count is 120 out of 183 initially.
// Phase 1: matrix 120 rows 70 cols
[2023-03-08 11:53:02] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 22406 resets, run finished after 1495 ms. (steps per millisecond=668 ) properties (out of 5) seen :5
FORMULA CloudDeployment-PT-3b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33291 ms.
ITS solved all properties within timeout

BK_STOP 1678276384678

--------------------
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="CloudDeployment-PT-3b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CloudDeployment-PT-3b, 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 r071-smll-167814397900389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3b.tgz
mv CloudDeployment-PT-3b 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 ;