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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
640.779 79420.00 97900.00 529.10 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410400205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Diffusion2D-PT-D30N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410400205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.7K Feb 26 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:55 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 26K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 03:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:58 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-D30N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678349439651

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N100
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 08:10:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 08:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:10:42] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2023-03-09 08:10:42] [INFO ] Transformed 900 places.
[2023-03-09 08:10:42] [INFO ] Transformed 6844 transitions.
[2023-03-09 08:10:42] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 08:10:42] [INFO ] Computed 1 place invariants in 103 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :100
FORMULA Diffusion2D-PT-D30N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) 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 15) seen :0
[2023-03-09 08:10:43] [INFO ] Invariant cache hit.
[2023-03-09 08:10:43] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2023-03-09 08:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:45] [INFO ] [Real]Absence check using state equation in 1953 ms returned sat
[2023-03-09 08:10:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:10:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 08:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:48] [INFO ] [Nat]Absence check using state equation in 1959 ms returned sat
[2023-03-09 08:10:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 732 ms.
[2023-03-09 08:10:49] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:51] [INFO ] [Real]Absence check using state equation in 1650 ms returned sat
[2023-03-09 08:10:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:10:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:53] [INFO ] [Nat]Absence check using state equation in 1584 ms returned sat
[2023-03-09 08:10:54] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 791 ms.
[2023-03-09 08:10:54] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:56] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2023-03-09 08:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:10:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:10:58] [INFO ] [Nat]Absence check using state equation in 1817 ms returned sat
[2023-03-09 08:10:59] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 567 ms.
[2023-03-09 08:10:59] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-09 08:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:01] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2023-03-09 08:11:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:03] [INFO ] [Nat]Absence check using state equation in 1729 ms returned sat
[2023-03-09 08:11:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 655 ms.
[2023-03-09 08:11:04] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:06] [INFO ] [Real]Absence check using state equation in 2317 ms returned sat
[2023-03-09 08:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:09] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2023-03-09 08:11:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 673 ms.
[2023-03-09 08:11:10] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 08:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:12] [INFO ] [Real]Absence check using state equation in 1794 ms returned sat
[2023-03-09 08:11:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:14] [INFO ] [Nat]Absence check using state equation in 1745 ms returned sat
[2023-03-09 08:11:14] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 425 ms.
[2023-03-09 08:11:14] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 08:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:16] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2023-03-09 08:11:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:19] [INFO ] [Nat]Absence check using state equation in 1771 ms returned sat
[2023-03-09 08:11:19] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 564 ms.
[2023-03-09 08:11:19] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:21] [INFO ] [Real]Absence check using state equation in 2017 ms returned sat
[2023-03-09 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 08:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:24] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2023-03-09 08:11:25] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 537 ms.
[2023-03-09 08:11:25] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 08:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:27] [INFO ] [Real]Absence check using state equation in 1935 ms returned sat
[2023-03-09 08:11:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 615 ms.
[2023-03-09 08:11:28] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 08:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:30] [INFO ] [Real]Absence check using state equation in 2053 ms returned sat
[2023-03-09 08:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 08:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:32] [INFO ] [Nat]Absence check using state equation in 1869 ms returned sat
[2023-03-09 08:11:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 595 ms.
[2023-03-09 08:11:33] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2023-03-09 08:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:35] [INFO ] [Real]Absence check using state equation in 1792 ms returned sat
[2023-03-09 08:11:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 08:11:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:37] [INFO ] [Nat]Absence check using state equation in 1742 ms returned sat
[2023-03-09 08:11:38] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 546 ms.
[2023-03-09 08:11:38] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 08:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:40] [INFO ] [Real]Absence check using state equation in 1859 ms returned sat
[2023-03-09 08:11:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:42] [INFO ] [Nat]Absence check using state equation in 1675 ms returned sat
[2023-03-09 08:11:43] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 478 ms.
[2023-03-09 08:11:43] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-09 08:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:45] [INFO ] [Real]Absence check using state equation in 1772 ms returned sat
[2023-03-09 08:11:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:47] [INFO ] [Nat]Absence check using state equation in 1911 ms returned sat
[2023-03-09 08:11:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 641 ms.
[2023-03-09 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:50] [INFO ] [Real]Absence check using state equation in 1703 ms returned sat
[2023-03-09 08:11:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 08:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:52] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2023-03-09 08:11:52] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 526 ms.
[2023-03-09 08:11:53] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 08:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:54] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2023-03-09 08:11:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 08:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:57] [INFO ] [Nat]Absence check using state equation in 1914 ms returned sat
[2023-03-09 08:11:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 466 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0]
Support contains 15 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6608 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 31 ms
Free SCC test removed 884 places
Drop transitions removed 6608 transitions
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 6810 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 16 transition count 28
Applied a total of 7 rules in 68 ms. Remains 16 /900 variables (removed 884) and now considering 28/6844 (removed 6816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 16/900 places, 28/6844 transitions.
// Phase 1: matrix 28 rows 16 cols
[2023-03-09 08:11:57] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000026 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=5263 ) properties (out of 15) seen :1500
FORMULA Diffusion2D-PT-D30N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 76109 ms.

BK_STOP 1678349519071

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r133-smll-167819410400205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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