Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631150900036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DatabaseWithMutex-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631150900036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 152K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 711K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 11 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 433K Apr 11 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 48K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 174K Apr 11 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 808K Apr 11 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 176K Apr 11 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 887K Apr 11 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 840K May 18 16:42 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 DatabaseWithMutex-PT-10-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716409872033

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 20:31:13] [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]
[2024-05-22 20:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 20:31:13] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-22 20:31:13] [INFO ] Transformed 830 places.
[2024-05-22 20:31:13] [INFO ] Transformed 800 transitions.
[2024-05-22 20:31:13] [INFO ] Found NUPN structural information;
[2024-05-22 20:31:13] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA DatabaseWithMutex-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 800 rows 830 cols
[2024-05-22 20:31:13] [INFO ] Computed 130 invariants in 61 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :109
FORMULA DatabaseWithMutex-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :85
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :94
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :64
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :62
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :61
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :62
[2024-05-22 20:31:14] [INFO ] Invariant cache hit.
[2024-05-22 20:31:14] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-22 20:31:14] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 59 ms returned sat
[2024-05-22 20:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:15] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-22 20:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-22 20:31:15] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 52 ms returned sat
[2024-05-22 20:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:15] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-22 20:31:15] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 51 ms.
[2024-05-22 20:31:20] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 3 ms to minimize.
[2024-05-22 20:31:20] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:31:20] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-22 20:31:20] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 47 ms returned sat
[2024-05-22 20:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:20] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-22 20:31:21] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 46 ms.
[2024-05-22 20:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-22 20:31:21] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 44 ms returned sat
[2024-05-22 20:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:21] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-22 20:31:21] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 54 ms.
[2024-05-22 20:31:25] [INFO ] Added : 363 causal constraints over 73 iterations in 3877 ms. Result :sat
Minimization took 555 ms.
[2024-05-22 20:31:26] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-22 20:31:26] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 47 ms returned sat
[2024-05-22 20:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:26] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-05-22 20:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 43 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:27] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-22 20:31:27] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 36 ms.
[2024-05-22 20:31:31] [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 3
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:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:31:32] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-22 20:31:32] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 27 ms returned unsat
[2024-05-22 20:31:32] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-22 20:31:32] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 10, -1, 10, 10, 10, 10] Max seen :[9, 15, 10, 61, 10, 10, 10, 10]
FORMULA DatabaseWithMutex-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 800/800 transitions.
Free-agglomeration rule applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 1 with 100 rules applied. Total rules applied 300 place count 730 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 173 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 630/830 places, 600/800 transitions.
// Phase 1: matrix 600 rows 630 cols
[2024-05-22 20:31:35] [INFO ] Computed 130 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16231 ms. (steps per millisecond=61 ) properties (out of 3) seen :91
Finished Best-First random walk after 890023 steps, including 2 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=177 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4152 ms. (steps per millisecond=240 ) properties (out of 3) seen :138
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4454 ms. (steps per millisecond=224 ) properties (out of 3) seen :101
[2024-05-22 20:32:05] [INFO ] Invariant cache hit.
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 38 ms returned unsat
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 76 ms returned unsat
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-22 20:32:05] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 68 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 90, 90] Max seen :[10, 90, 90]
FORMULA DatabaseWithMutex-PT-10-UpperBounds-03 90 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-01 90 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 52492 ms.

BK_STOP 1716409926876

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="DatabaseWithMutex-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DatabaseWithMutex-PT-10, 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 r153-tall-171631150900036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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