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

About the Execution of Smart+red for Diffusion2D-PT-D30N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
744.615 73214.00 93018.00 561.30 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 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.r139-smll-167819422200197.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Diffusion2D-PT-D30N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819422200197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 04:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 04:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 04:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 04:27 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 3.0M 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-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 1678335945196

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N050
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 04:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:25:49] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2023-03-09 04:25:49] [INFO ] Transformed 900 places.
[2023-03-09 04:25:49] [INFO ] Transformed 6844 transitions.
[2023-03-09 04:25:49] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 04:25:49] [INFO ] Computed 1 place invariants in 110 ms
Incomplete random walk after 10048 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=772 ) properties (out of 16) seen :149
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 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) 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 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 14) seen :0
[2023-03-09 04:25:49] [INFO ] Invariant cache hit.
[2023-03-09 04:25:50] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2023-03-09 04:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:25:52] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2023-03-09 04:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:25:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-09 04:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:25:55] [INFO ] [Nat]Absence check using state equation in 2041 ms returned sat
[2023-03-09 04:25:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 823 ms.
[2023-03-09 04:25:56] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:25:58] [INFO ] [Real]Absence check using state equation in 1841 ms returned sat
[2023-03-09 04:25:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:25:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:00] [INFO ] [Nat]Absence check using state equation in 1868 ms returned sat
[2023-03-09 04:26:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 803 ms.
[2023-03-09 04:26:01] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:03] [INFO ] [Real]Absence check using state equation in 1853 ms returned sat
[2023-03-09 04:26:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:05] [INFO ] [Nat]Absence check using state equation in 1849 ms returned sat
[2023-03-09 04:26:06] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 662 ms.
[2023-03-09 04:26:06] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 04:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:08] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2023-03-09 04:26:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:11] [INFO ] [Nat]Absence check using state equation in 2079 ms returned sat
[2023-03-09 04:26:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 739 ms.
[2023-03-09 04:26:12] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-09 04:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:14] [INFO ] [Real]Absence check using state equation in 1914 ms returned sat
[2023-03-09 04:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:16] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2023-03-09 04:26:17] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 558 ms.
[2023-03-09 04:26:17] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:19] [INFO ] [Real]Absence check using state equation in 1660 ms returned sat
[2023-03-09 04:26:19] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 605 ms.
[2023-03-09 04:26:20] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:21] [INFO ] [Real]Absence check using state equation in 1597 ms returned sat
[2023-03-09 04:26:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:23] [INFO ] [Nat]Absence check using state equation in 1651 ms returned sat
[2023-03-09 04:26:24] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 358 ms.
[2023-03-09 04:26:24] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:26] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2023-03-09 04:26:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 441 ms.
[2023-03-09 04:26:27] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:28] [INFO ] [Real]Absence check using state equation in 1646 ms returned sat
[2023-03-09 04:26:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-09 04:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:30] [INFO ] [Nat]Absence check using state equation in 1484 ms returned sat
[2023-03-09 04:26:31] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 629 ms.
[2023-03-09 04:26:31] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:33] [INFO ] [Real]Absence check using state equation in 2002 ms returned sat
[2023-03-09 04:26:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:35] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2023-03-09 04:26:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 649 ms.
[2023-03-09 04:26:37] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:38] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2023-03-09 04:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-09 04:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:41] [INFO ] [Nat]Absence check using state equation in 1951 ms returned sat
[2023-03-09 04:26:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 601 ms.
[2023-03-09 04:26:42] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:43] [INFO ] [Real]Absence check using state equation in 1628 ms returned sat
[2023-03-09 04:26:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:45] [INFO ] [Nat]Absence check using state equation in 1788 ms returned sat
[2023-03-09 04:26:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 690 ms.
[2023-03-09 04:26:47] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:48] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2023-03-09 04:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:51] [INFO ] [Nat]Absence check using state equation in 1812 ms returned sat
[2023-03-09 04:26:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 618 ms.
[2023-03-09 04:26:52] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:53] [INFO ] [Real]Absence check using state equation in 1849 ms returned sat
[2023-03-09 04:26:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:26:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:26:55] [INFO ] [Nat]Absence check using state equation in 1780 ms returned sat
[2023-03-09 04:26:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 601 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 0, 0, 49, 0, 3, 0, 1, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6632 edges and 900 vertex of which 886 / 900 are part of one of the 1 SCC in 30 ms
Free SCC test removed 885 places
Drop transitions removed 6632 transitions
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 6816 transitions.
Applied a total of 1 rules in 79 ms. Remains 15 /900 variables (removed 885) and now considering 28/6844 (removed 6816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 15/900 places, 28/6844 transitions.
// Phase 1: matrix 28 rows 15 cols
[2023-03-09 04:26:56] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 14) seen :700
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-12 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 68638 ms.
ITS solved all properties within timeout

BK_STOP 1678336018410

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is 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 r139-smll-167819422200197"
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 '' 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 ;