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

About the Execution of LTSMin+red for Diffusion2D-PT-D40N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1555.340 125715.00 147212.00 243.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-171631132400309.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-D40N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132400309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.1K 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.6K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 14:19 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 4.7M 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-D40N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D40N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717189700125

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-D40N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:08:21] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2024-05-31 21:08:21] [INFO ] Transformed 1600 places.
[2024-05-31 21:08:21] [INFO ] Transformed 12324 transitions.
[2024-05-31 21:08:21] [INFO ] Parsed PT model containing 1600 places and 12324 transitions and 24648 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 12324 rows 1600 cols
[2024-05-31 21:08:22] [INFO ] Computed 1 invariants in 132 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 10006 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 114 ms. (1391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 48, 0, 0, 0, 0, 1, 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]
[2024-05-31 21:08:22] [INFO ] Invariant cache hit.
[2024-05-31 21:08:22] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2024-05-31 21:08:25] [INFO ] [Real]Absence check using state equation in 2418 ms returned sat
[2024-05-31 21:08:26] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 826 ms.
[2024-05-31 21:08:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Nat]Absence check using state equation in 2379 ms returned sat
[2024-05-31 21:08:30] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 719 ms.
Minimization took 1073 ms.
[2024-05-31 21:08:31] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2024-05-31 21:08:33] [INFO ] [Real]Absence check using state equation in 2177 ms returned sat
[2024-05-31 21:08:34] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 717 ms.
[2024-05-31 21:08:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:08:37] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2024-05-31 21:08:38] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 721 ms.
Minimization took 1066 ms.
[2024-05-31 21:08:39] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:08:41] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2024-05-31 21:08:42] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 713 ms.
[2024-05-31 21:08:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using state equation in 2221 ms returned sat
[2024-05-31 21:08:46] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 609 ms.
Minimization took 1026 ms.
[2024-05-31 21:08:47] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:08:49] [INFO ] [Real]Absence check using state equation in 2002 ms returned sat
[2024-05-31 21:08:50] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 610 ms.
[2024-05-31 21:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-31 21:08:52] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2024-05-31 21:08:53] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 629 ms.
Minimization took 1363 ms.
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:08:56] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2024-05-31 21:08:57] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 653 ms.
[2024-05-31 21:08:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:00] [INFO ] [Nat]Absence check using state equation in 2044 ms returned sat
[2024-05-31 21:09:01] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 617 ms.
Minimization took 1058 ms.
[2024-05-31 21:09:02] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:04] [INFO ] [Real]Absence check using state equation in 1997 ms returned sat
[2024-05-31 21:09:05] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 569 ms.
[2024-05-31 21:09:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-31 21:09:07] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2024-05-31 21:09:08] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 663 ms.
Minimization took 1437 ms.
[2024-05-31 21:09:10] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:12] [INFO ] [Real]Absence check using state equation in 1852 ms returned sat
[2024-05-31 21:09:13] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 622 ms.
[2024-05-31 21:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:15] [INFO ] [Nat]Absence check using state equation in 2074 ms returned sat
[2024-05-31 21:09:16] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 620 ms.
Minimization took 1058 ms.
[2024-05-31 21:09:17] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:19] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2024-05-31 21:09:20] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 629 ms.
[2024-05-31 21:09:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:22] [INFO ] [Nat]Absence check using state equation in 1927 ms returned sat
[2024-05-31 21:09:23] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 666 ms.
Minimization took 1425 ms.
[2024-05-31 21:09:25] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:27] [INFO ] [Real]Absence check using state equation in 2040 ms returned sat
[2024-05-31 21:09:28] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 613 ms.
[2024-05-31 21:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:30] [INFO ] [Nat]Absence check using state equation in 2310 ms returned sat
[2024-05-31 21:09:31] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 639 ms.
Minimization took 1439 ms.
[2024-05-31 21:09:33] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:35] [INFO ] [Real]Absence check using state equation in 2054 ms returned sat
[2024-05-31 21:09:36] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 638 ms.
[2024-05-31 21:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:38] [INFO ] [Nat]Absence check using state equation in 1973 ms returned sat
[2024-05-31 21:09:39] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 600 ms.
Minimization took 1095 ms.
[2024-05-31 21:09:40] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:09:42] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2024-05-31 21:09:43] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 613 ms.
[2024-05-31 21:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:46] [INFO ] [Nat]Absence check using state equation in 2001 ms returned sat
[2024-05-31 21:09:46] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 632 ms.
Minimization took 1408 ms.
[2024-05-31 21:09:48] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:50] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2024-05-31 21:09:51] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 557 ms.
[2024-05-31 21:09:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:09:53] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2024-05-31 21:09:54] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 584 ms.
Minimization took 1081 ms.
[2024-05-31 21:09:55] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2024-05-31 21:09:57] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2024-05-31 21:09:58] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 624 ms.
[2024-05-31 21:09:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:10:00] [INFO ] [Nat]Absence check using state equation in 2071 ms returned sat
[2024-05-31 21:10:01] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 550 ms.
Minimization took 1065 ms.
[2024-05-31 21:10:02] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:10:04] [INFO ] [Real]Absence check using state equation in 1932 ms returned sat
[2024-05-31 21:10:05] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 594 ms.
[2024-05-31 21:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:10:07] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2024-05-31 21:10:08] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 591 ms.
Minimization took 1065 ms.
[2024-05-31 21:10:10] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:10:12] [INFO ] [Real]Absence check using state equation in 2135 ms returned sat
[2024-05-31 21:10:13] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 607 ms.
[2024-05-31 21:10:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:10:15] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2024-05-31 21:10:16] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 556 ms.
Minimization took 1055 ms.
[2024-05-31 21:10:17] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-31 21:10:19] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2024-05-31 21:10:20] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 610 ms.
[2024-05-31 21:10:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-31 21:10:22] [INFO ] [Nat]Absence check using state equation in 1995 ms returned sat
[2024-05-31 21:10:23] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 642 ms.
Minimization took 1416 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 48, 0, 0, 0, 0, 1, 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 48, 0, 0, 0, 0, 1, 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]
Support contains 16 out of 1600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12076 edges and 1600 vertex of which 1584 / 1600 are part of one of the 1 SCC in 20 ms
Free SCC test removed 1583 places
Drop transitions (Empty/Sink Transition effects.) removed 12076 transitions
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 12290 transitions.
Drop transitions (Redundant composition of simpler 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 17 transition count 31
Applied a total of 4 rules in 69 ms. Remains 17 /1600 variables (removed 1583) and now considering 31/12324 (removed 12293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 17/1600 places, 31/12324 transitions.
// Phase 1: matrix 31 rows 17 cols
[2024-05-31 21:10:25] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 48, 0, 0, 0, 0, 1, 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 1000036 steps (2 resets) in 181 ms. (5494 steps per ms)
FORMULA Diffusion2D-PT-D40N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 369 ms. (2702 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 124436 ms.
ITS solved all properties within timeout

BK_STOP 1717189825840

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-D40N050"
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-D40N050, 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-171631132400309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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