fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772600829
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1146.535 89741.00 111176.00 256.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/mcc2022-input.r060-tall-165254772600829.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D40N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772600829
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 8.2K Apr 30 04:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 04:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 04:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D40N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652661788729

Running Version 202205111006
[2022-05-16 00:43:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:43:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:43:10] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2022-05-16 00:43:10] [INFO ] Transformed 1600 places.
[2022-05-16 00:43:10] [INFO ] Transformed 12324 transitions.
[2022-05-16 00:43:10] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 562 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:43:10] [INFO ] Computed 1 place invariants in 146 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) 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 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) 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 16) 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 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) 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 16) 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 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :1
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:43:11] [INFO ] Computed 1 place invariants in 70 ms
[2022-05-16 00:43:11] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:14] [INFO ] [Real]Absence check using state equation in 2703 ms returned sat
[2022-05-16 00:43:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:17] [INFO ] [Nat]Absence check using state equation in 2798 ms returned sat
[2022-05-16 00:43:18] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 735 ms.
[2022-05-16 00:43:18] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2022-05-16 00:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:20] [INFO ] [Real]Absence check using state equation in 2196 ms returned sat
[2022-05-16 00:43:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:23] [INFO ] [Nat]Absence check using state equation in 1946 ms returned sat
[2022-05-16 00:43:24] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 609 ms.
[2022-05-16 00:43:24] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:26] [INFO ] [Real]Absence check using state equation in 2086 ms returned sat
[2022-05-16 00:43:27] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 564 ms.
[2022-05-16 00:43:27] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:29] [INFO ] [Real]Absence check using state equation in 2293 ms returned sat
[2022-05-16 00:43:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:32] [INFO ] [Nat]Absence check using state equation in 2357 ms returned sat
[2022-05-16 00:43:33] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 566 ms.
[2022-05-16 00:43:33] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2022-05-16 00:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:35] [INFO ] [Real]Absence check using state equation in 2352 ms returned sat
[2022-05-16 00:43:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:38] [INFO ] [Nat]Absence check using state equation in 2413 ms returned sat
[2022-05-16 00:43:39] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 620 ms.
[2022-05-16 00:43:39] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2022-05-16 00:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:41] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2022-05-16 00:43:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:44] [INFO ] [Nat]Absence check using state equation in 1930 ms returned sat
[2022-05-16 00:43:44] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 550 ms.
[2022-05-16 00:43:45] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:46] [INFO ] [Real]Absence check using state equation in 1863 ms returned sat
[2022-05-16 00:43:47] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 524 ms.
[2022-05-16 00:43:47] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:50] [INFO ] [Real]Absence check using state equation in 2509 ms returned sat
[2022-05-16 00:43:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:53] [INFO ] [Nat]Absence check using state equation in 2522 ms returned sat
[2022-05-16 00:43:54] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 535 ms.
[2022-05-16 00:43:54] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:56] [INFO ] [Real]Absence check using state equation in 2515 ms returned sat
[2022-05-16 00:43:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:43:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:43:59] [INFO ] [Nat]Absence check using state equation in 2513 ms returned sat
[2022-05-16 00:44:00] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 565 ms.
[2022-05-16 00:44:00] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:02] [INFO ] [Real]Absence check using state equation in 1879 ms returned sat
[2022-05-16 00:44:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:04] [INFO ] [Nat]Absence check using state equation in 1901 ms returned sat
[2022-05-16 00:44:05] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 517 ms.
[2022-05-16 00:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:08] [INFO ] [Real]Absence check using state equation in 2571 ms returned sat
[2022-05-16 00:44:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:11] [INFO ] [Nat]Absence check using state equation in 2619 ms returned sat
[2022-05-16 00:44:12] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 528 ms.
[2022-05-16 00:44:12] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:14] [INFO ] [Real]Absence check using state equation in 1929 ms returned sat
[2022-05-16 00:44:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:16] [INFO ] [Nat]Absence check using state equation in 1915 ms returned sat
[2022-05-16 00:44:17] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 503 ms.
[2022-05-16 00:44:17] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:19] [INFO ] [Real]Absence check using state equation in 1897 ms returned sat
[2022-05-16 00:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:21] [INFO ] [Nat]Absence check using state equation in 1938 ms returned sat
[2022-05-16 00:44:22] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 555 ms.
[2022-05-16 00:44:22] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:25] [INFO ] [Real]Absence check using state equation in 2644 ms returned sat
[2022-05-16 00:44:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:28] [INFO ] [Nat]Absence check using state equation in 2580 ms returned sat
[2022-05-16 00:44:29] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 553 ms.
[2022-05-16 00:44:29] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:32] [INFO ] [Real]Absence check using state equation in 2823 ms returned sat
[2022-05-16 00:44:32] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 492 ms.
[2022-05-16 00:44:33] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:35] [INFO ] [Real]Absence check using state equation in 1946 ms returned sat
[2022-05-16 00:44:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:44:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:44:37] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2022-05-16 00:44:38] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 506 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0]
Support contains 16 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12080 edges and 1600 vertex of which 1584 / 1600 are part of one of the 1 SCC in 21 ms
Free SCC test removed 1583 places
Drop transitions removed 12080 transitions
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 12292 transitions.
Applied a total of 1 rules in 54 ms. Remains 17 /1600 variables (removed 1583) and now considering 32/12324 (removed 12292) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/1600 places, 32/12324 transitions.
// Phase 1: matrix 32 rows 17 cols
[2022-05-16 00:44:38] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000035 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 16) seen :1600
FORMULA Diffusion2D-PT-D40N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 88501 ms.

BK_STOP 1652661878470

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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