fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r133-smll-167819410400181
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Diffusion2D-PT-D20N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
744.707 150409.00 167649.00 744.70 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410400181.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 itstools
Input is Diffusion2D-PT-D20N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410400181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.2K Feb 26 04:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 04:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 04:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N150-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678331204859

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N150
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 03:06:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 03:06:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:06:48] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-09 03:06:48] [INFO ] Transformed 400 places.
[2023-03-09 03:06:48] [INFO ] Transformed 2964 transitions.
[2023-03-09 03:06:48] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-09 03:06:48] [INFO ] Computed 1 place invariants in 76 ms
Incomplete random walk after 10123 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1124 ) properties (out of 16) seen :150
FORMULA Diffusion2D-PT-D20N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
[2023-03-09 03:06:48] [INFO ] Invariant cache hit.
[2023-03-09 03:06:49] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 03:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:50] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2023-03-09 03:06:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:06:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-09 03:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:51] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2023-03-09 03:06:51] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 309 ms.
Minimization took 395 ms.
[2023-03-09 03:06:52] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:53] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2023-03-09 03:06:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:06:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:54] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2023-03-09 03:06:54] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 318 ms.
Minimization took 291 ms.
[2023-03-09 03:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 03:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:55] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2023-03-09 03:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:56] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2023-03-09 03:06:57] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 216 ms.
Minimization took 475 ms.
[2023-03-09 03:06:57] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-09 03:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:06:58] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2023-03-09 03:06:59] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 207 ms.
Minimization took 360 ms.
[2023-03-09 03:06:59] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 03:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:00] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2023-03-09 03:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:07:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 03:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:01] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2023-03-09 03:07:01] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 275 ms.
Minimization took 277 ms.
[2023-03-09 03:07:02] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 03:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:02] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-09 03:07:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 171 ms.
Minimization took 379 ms.
[2023-03-09 03:07:03] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 03:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:04] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-09 03:07:04] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 201 ms.
Minimization took 385 ms.
[2023-03-09 03:07:05] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 03:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:05] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2023-03-09 03:07:06] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 272 ms.
Minimization took 386 ms.
[2023-03-09 03:07:07] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-09 03:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:08] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2023-03-09 03:07:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:07:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:09] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2023-03-09 03:07:09] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 188 ms.
Minimization took 360 ms.
[2023-03-09 03:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:10] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2023-03-09 03:07:11] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 260 ms.
Minimization took 327 ms.
[2023-03-09 03:07:11] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:12] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2023-03-09 03:07:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:07:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 03:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:13] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2023-03-09 03:07:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 323 ms.
Minimization took 406 ms.
[2023-03-09 03:07:14] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 03:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:15] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-09 03:07:16] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 291 ms.
Minimization took 544 ms.
[2023-03-09 03:07:16] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 03:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:17] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2023-03-09 03:07:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:07:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-09 03:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:18] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2023-03-09 03:07:18] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 197 ms.
Minimization took 303 ms.
[2023-03-09 03:07:19] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-09 03:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:20] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2023-03-09 03:07:21] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 309 ms.
Minimization took 626 ms.
[2023-03-09 03:07:21] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-09 03:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:07:22] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2023-03-09 03:07:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 256 ms.
Minimization took 572 ms.
Current structural bounds on expressions (after SMT) : [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150] Max seen :[0, 0, 0, 1, 0, 1, 2, 1, 0, 3, 0, 1, 0, 1, 1]
FORMULA Diffusion2D-PT-D20N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 146482 ms.

BK_STOP 1678331355268

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D20N150"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D20N150, 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 r133-smll-167819410400181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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