fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r488-tall-171631132300277
Last Updated
July 7, 2024

About the Execution of LTSMin+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
1069.359 55794.00 72794.00 226.50 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/mcc2024-input.r488-tall-171631132300277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r488-tall-171631132300277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1717188659153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:51:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:51:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:51:00] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-31 20:51:00] [INFO ] Transformed 900 places.
[2024-05-31 20:51:00] [INFO ] Transformed 6844 transitions.
[2024-05-31 20:51:00] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 6844 rows 900 cols
[2024-05-31 20:51:00] [INFO ] Computed 1 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
FORMULA Diffusion2D-PT-D30N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140014 steps (28 resets) in 101 ms. (1372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-31 20:51:00] [INFO ] Invariant cache hit.
[2024-05-31 20:51:01] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-31 20:51:02] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2024-05-31 20:51:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 519 ms.
[2024-05-31 20:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:04] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2024-05-31 20:51:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 382 ms.
Minimization took 600 ms.
[2024-05-31 20:51:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:06] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2024-05-31 20:51:07] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 376 ms.
[2024-05-31 20:51:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:08] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2024-05-31 20:51:09] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 340 ms.
Minimization took 586 ms.
[2024-05-31 20:51:09] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2024-05-31 20:51:11] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 382 ms.
[2024-05-31 20:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:12] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2024-05-31 20:51:13] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 316 ms.
Minimization took 585 ms.
[2024-05-31 20:51:13] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:14] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2024-05-31 20:51:15] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 299 ms.
[2024-05-31 20:51:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:16] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2024-05-31 20:51:16] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 366 ms.
Minimization took 584 ms.
[2024-05-31 20:51:17] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:18] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2024-05-31 20:51:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 307 ms.
[2024-05-31 20:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:20] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2024-05-31 20:51:20] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 310 ms.
Minimization took 584 ms.
[2024-05-31 20:51:21] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:22] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2024-05-31 20:51:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 304 ms.
[2024-05-31 20:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:23] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2024-05-31 20:51:24] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 299 ms.
Minimization took 584 ms.
[2024-05-31 20:51:24] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-31 20:51:25] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2024-05-31 20:51:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 309 ms.
[2024-05-31 20:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-31 20:51:27] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2024-05-31 20:51:27] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 311 ms.
Minimization took 584 ms.
[2024-05-31 20:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-31 20:51:29] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2024-05-31 20:51:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 337 ms.
[2024-05-31 20:51:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:31] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2024-05-31 20:51:31] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 300 ms.
Minimization took 587 ms.
[2024-05-31 20:51:32] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:33] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2024-05-31 20:51:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 327 ms.
[2024-05-31 20:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:34] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2024-05-31 20:51:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 304 ms.
Minimization took 587 ms.
[2024-05-31 20:51:36] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:37] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2024-05-31 20:51:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 310 ms.
[2024-05-31 20:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:38] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2024-05-31 20:51:39] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 304 ms.
Minimization took 584 ms.
[2024-05-31 20:51:39] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-31 20:51:40] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2024-05-31 20:51:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 302 ms.
[2024-05-31 20:51:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:42] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2024-05-31 20:51:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 332 ms.
Minimization took 589 ms.
[2024-05-31 20:51:43] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:44] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2024-05-31 20:51:44] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 300 ms.
[2024-05-31 20:51:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:45] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2024-05-31 20:51:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 309 ms.
Minimization took 585 ms.
[2024-05-31 20:51:47] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:47] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2024-05-31 20:51:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 306 ms.
[2024-05-31 20:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:49] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2024-05-31 20:51:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 293 ms.
Minimization took 585 ms.
[2024-05-31 20:51:50] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:51] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2024-05-31 20:51:52] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 310 ms.
[2024-05-31 20:51:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-31 20:51:53] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2024-05-31 20:51:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 304 ms.
Minimization took 585 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
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 6660 edges and 900 vertex of which 886 / 900 are part of one of the 1 SCC in 14 ms
Free SCC test removed 885 places
Drop transitions (Empty/Sink Transition effects.) removed 6660 transitions
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 6816 transitions.
Applied a total of 1 rules in 53 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 63 ms. Remains : 15/900 places, 28/6844 transitions.
// Phase 1: matrix 28 rows 15 cols
[2024-05-31 20:51:54] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000044 steps (2 resets) in 135 ms. (7353 steps per ms)
FORMULA Diffusion2D-PT-D30N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 407 ms. (2450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 54575 ms.
ITS solved all properties within timeout

BK_STOP 1717188714947

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r488-tall-171631132300277"
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 ;