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.r267-smll-167863541600301.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 NoC3x3-PT-5B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541600301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K Mar 5 18:23 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 NoC3x3-PT-5B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678840659036

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=NoC3x3-PT-5B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 00:37:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 00:37:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:37:42] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2023-03-15 00:37:42] [INFO ] Transformed 1571 places.
[2023-03-15 00:37:42] [INFO ] Transformed 2173 transitions.
[2023-03-15 00:37:42] [INFO ] Found NUPN structural information;
[2023-03-15 00:37:42] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 664 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 2173 rows 1571 cols
[2023-03-15 00:37:43] [INFO ] Computed 66 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-5B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-5B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
[2023-03-15 00:37:43] [INFO ] Invariant cache hit.
[2023-03-15 00:37:44] [INFO ] [Real]Absence check using 66 positive place invariants in 80 ms returned sat
[2023-03-15 00:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:37:45] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2023-03-15 00:37:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:37:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 117 ms returned sat
[2023-03-15 00:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:37:50] [INFO ] [Nat]Absence check using state equation in 4440 ms returned unknown
[2023-03-15 00:37:51] [INFO ] [Real]Absence check using 66 positive place invariants in 108 ms returned sat
[2023-03-15 00:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:37:52] [INFO ] [Real]Absence check using state equation in 1295 ms returned sat
[2023-03-15 00:37:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:37:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 67 ms returned sat
[2023-03-15 00:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:37:57] [INFO ] [Nat]Absence check using state equation in 4617 ms returned unknown
[2023-03-15 00:37:58] [INFO ] [Real]Absence check using 66 positive place invariants in 79 ms returned sat
[2023-03-15 00:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:37:59] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2023-03-15 00:37:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:38:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 86 ms returned sat
[2023-03-15 00:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:38:01] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2023-03-15 00:38:03] [INFO ] Deduced a trap composed of 59 places in 1668 ms of which 10 ms to minimize.
[2023-03-15 00:38:04] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3157 ms
[2023-03-15 00:38:04] [INFO ] [Real]Absence check using 66 positive place invariants in 67 ms returned sat
[2023-03-15 00:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:38:06] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2023-03-15 00:38:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:38:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 112 ms returned sat
[2023-03-15 00:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:38:11] [INFO ] [Nat]Absence check using state equation in 4361 ms returned unknown
[2023-03-15 00:38:11] [INFO ] [Real]Absence check using 66 positive place invariants in 107 ms returned sat
[2023-03-15 00:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:38:13] [INFO ] [Real]Absence check using state equation in 1243 ms returned sat
[2023-03-15 00:38:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:38:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 89 ms returned sat
[2023-03-15 00:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:38:16] [INFO ] [Nat]Absence check using state equation in 3074 ms returned sat
[2023-03-15 00:38:17] [INFO ] Deduced a trap composed of 13 places in 1236 ms of which 3 ms to minimize.
[2023-03-15 00:38:19] [INFO ] Deduced a trap composed of 26 places in 1477 ms of which 3 ms to minimize.
[2023-03-15 00:38:19] [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 4
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.verifyPossible(DeadlockTester.java:916)
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, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1571 transition count 1842
Reduce places removed 331 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 333 rules applied. Total rules applied 664 place count 1240 transition count 1840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 666 place count 1238 transition count 1840
Discarding 271 places :
Symmetric choice reduction at 3 with 271 rule applications. Total rules 937 place count 967 transition count 1569
Iterating global reduction 3 with 271 rules applied. Total rules applied 1208 place count 967 transition count 1569
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1208 place count 967 transition count 1536
Deduced a syphon composed of 33 places in 6 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1274 place count 934 transition count 1536
Discarding 109 places :
Symmetric choice reduction at 3 with 109 rule applications. Total rules 1383 place count 825 transition count 1345
Iterating global reduction 3 with 109 rules applied. Total rules applied 1492 place count 825 transition count 1345
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1548 place count 769 transition count 1229
Iterating global reduction 3 with 56 rules applied. Total rules applied 1604 place count 769 transition count 1229
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1628 place count 745 transition count 1181
Iterating global reduction 3 with 24 rules applied. Total rules applied 1652 place count 745 transition count 1181
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1658 place count 739 transition count 1169
Iterating global reduction 3 with 6 rules applied. Total rules applied 1664 place count 739 transition count 1169
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1667 place count 736 transition count 1163
Iterating global reduction 3 with 3 rules applied. Total rules applied 1670 place count 736 transition count 1163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1673 place count 733 transition count 1154
Iterating global reduction 3 with 3 rules applied. Total rules applied 1676 place count 733 transition count 1154
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 2018 place count 562 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2021 place count 562 transition count 980
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2223 place count 461 transition count 1009
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2237 place count 461 transition count 995
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 2309 place count 425 transition count 1005
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 5 with 64 rules applied. Total rules applied 2373 place count 425 transition count 941
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2382 place count 416 transition count 941
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 2382 place count 416 transition count 936
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2392 place count 411 transition count 936
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2428 place count 393 transition count 918
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2430 place count 392 transition count 918
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2434 place count 392 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2435 place count 391 transition count 917
Applied a total of 2435 rules in 807 ms. Remains 391 /1571 variables (removed 1180) and now considering 917/2173 (removed 1256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 809 ms. Remains : 391/1571 places, 917/2173 transitions.
Normalized transition count is 914 out of 917 initially.
// Phase 1: matrix 914 rows 391 cols
[2023-03-15 00:38:20] [INFO ] Computed 57 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 4928 resets, run finished after 4459 ms. (steps per millisecond=224 ) properties (out of 5) seen :5
FORMULA NoC3x3-PT-5B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 42802 ms.
ITS solved all properties within timeout

BK_STOP 1678840705739

--------------------
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="NoC3x3-PT-5B"
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 NoC3x3-PT-5B, 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 r267-smll-167863541600301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B 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 ;