About the Execution of ITS-Tools for Diffusion2D-PT-D30N050
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772500789.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D30N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772500789
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 7.6K Apr 30 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 04:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:33 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-D30N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652654581686
Running Version 202205111006
[2022-05-15 22:43:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 22:43:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:43:03] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2022-05-15 22:43:03] [INFO ] Transformed 900 places.
[2022-05-15 22:43:03] [INFO ] Transformed 6844 transitions.
[2022-05-15 22:43:03] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:43:03] [INFO ] Computed 1 place invariants in 80 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :249
FORMULA Diffusion2D-PT-D30N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :0
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:43:03] [INFO ] Computed 1 place invariants in 34 ms
[2022-05-15 22:43:03] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-05-15 22:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:04] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2022-05-15 22:43:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:06] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2022-05-15 22:43:06] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 455 ms.
[2022-05-15 22:43:07] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:08] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2022-05-15 22:43:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-15 22:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:09] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2022-05-15 22:43:09] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 393 ms.
[2022-05-15 22:43:09] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:10] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2022-05-15 22:43:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:12] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2022-05-15 22:43:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 303 ms.
[2022-05-15 22:43:12] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-05-15 22:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:13] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2022-05-15 22:43:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:14] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2022-05-15 22:43:15] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 328 ms.
[2022-05-15 22:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:16] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2022-05-15 22:43:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:17] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2022-05-15 22:43:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 285 ms.
[2022-05-15 22:43:18] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:19] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2022-05-15 22:43:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-05-15 22:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:20] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2022-05-15 22:43:20] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 252 ms.
[2022-05-15 22:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:22] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2022-05-15 22:43:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:23] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2022-05-15 22:43:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 281 ms.
[2022-05-15 22:43:23] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:24] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2022-05-15 22:43:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-15 22:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:26] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2022-05-15 22:43:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 274 ms.
[2022-05-15 22:43:26] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:27] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2022-05-15 22:43:27] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 296 ms.
[2022-05-15 22:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:28] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2022-05-15 22:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:30] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2022-05-15 22:43:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 287 ms.
[2022-05-15 22:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:31] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2022-05-15 22:43:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:32] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2022-05-15 22:43:32] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 301 ms.
[2022-05-15 22:43:33] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:34] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2022-05-15 22:43:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-05-15 22:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:35] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2022-05-15 22:43:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 285 ms.
[2022-05-15 22:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-15 22:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:36] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2022-05-15 22:43:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:43:37] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2022-05-15 22:43:38] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 304 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 0, 49, 0, 0, 0, 0, 0, 2, 0, 0, 49, 0]
Support contains 13 out of 900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6650 edges and 900 vertex of which 887 / 900 are part of one of the 1 SCC in 14 ms
Free SCC test removed 886 places
Drop transitions removed 6650 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 6816 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 14 transition count 25
Applied a total of 4 rules in 33 ms. Remains 14 /900 variables (removed 886) and now considering 25/6844 (removed 6819) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/900 places, 25/6844 transitions.
// Phase 1: matrix 25 rows 14 cols
[2022-05-15 22:43:38] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000018 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 13) seen :650
FORMULA Diffusion2D-PT-D30N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 35658 ms.
BK_STOP 1652654618520
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-D30N050"
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-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N050, 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 r060-tall-165254772500789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N050.tgz
mv Diffusion2D-PT-D30N050 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 '
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 ;