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

About the Execution of 2023-gold for Diffusion2D-PT-D30N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
604.768 43009.00 56800.00 374.60 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.r153-tall-171631151200171.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 gold2023
Input is Diffusion2D-PT-D30N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151200171
=====================================================================

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716417726846

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N050
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 22:42:08] [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]
[2024-05-22 22:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:42:08] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-05-22 22:42:08] [INFO ] Transformed 900 places.
[2024-05-22 22:42:08] [INFO ] Transformed 6844 transitions.
[2024-05-22 22:42:09] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 6844 rows 900 cols
[2024-05-22 22:42:09] [INFO ] Computed 1 invariants in 86 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :100
FORMULA Diffusion2D-PT-D30N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) 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 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :3
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 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 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
[2024-05-22 22:42:09] [INFO ] Invariant cache hit.
[2024-05-22 22:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-22 22:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:10] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2024-05-22 22:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:12] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2024-05-22 22:42:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 393 ms.
[2024-05-22 22:42:12] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:13] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2024-05-22 22:42:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2024-05-22 22:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:15] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2024-05-22 22:42:15] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 418 ms.
[2024-05-22 22:42:15] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:16] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2024-05-22 22:42:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:18] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2024-05-22 22:42:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 327 ms.
[2024-05-22 22:42:18] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:19] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2024-05-22 22:42:20] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 335 ms.
[2024-05-22 22:42:20] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:21] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2024-05-22 22:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:22] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2024-05-22 22:42:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 370 ms.
[2024-05-22 22:42:23] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:24] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2024-05-22 22:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:25] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2024-05-22 22:42:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 310 ms.
[2024-05-22 22:42:26] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:27] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2024-05-22 22:42:27] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 342 ms.
[2024-05-22 22:42:27] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:28] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2024-05-22 22:42:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 317 ms.
[2024-05-22 22:42:29] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:30] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2024-05-22 22:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-22 22:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:31] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2024-05-22 22:42:32] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 320 ms.
[2024-05-22 22:42:32] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:33] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2024-05-22 22:42:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:34] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2024-05-22 22:42:34] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 302 ms.
[2024-05-22 22:42:34] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:36] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2024-05-22 22:42:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:37] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2024-05-22 22:42:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 299 ms.
[2024-05-22 22:42:37] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:38] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2024-05-22 22:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:39] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2024-05-22 22:42:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 306 ms.
[2024-05-22 22:42:40] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:41] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2024-05-22 22:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:42] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2024-05-22 22:42:43] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 311 ms.
[2024-05-22 22:42:43] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:44] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2024-05-22 22:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:45] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2024-05-22 22:42:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 299 ms.
[2024-05-22 22:42:46] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-22 22:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:47] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2024-05-22 22:42:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:42:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:42:48] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-05-22 22:42:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 281 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[49, 0, 0, 1, 0, 0, 1, 1, 0, 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 6644 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 20 ms
Free SCC test removed 884 places
Drop transitions removed 6644 transitions
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 6814 transitions.
Applied a total of 1 rules in 41 ms. Remains 16 /900 variables (removed 884) and now considering 30/6844 (removed 6814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 16/900 places, 30/6844 transitions.
// Phase 1: matrix 30 rows 16 cols
[2024-05-22 22:42:48] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000028 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=7692 ) properties (out of 15) seen :750
FORMULA Diffusion2D-PT-D30N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 40363 ms.

BK_STOP 1716417769855

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-D30N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Diffusion2D-PT-D30N050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151200171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N050.tgz
mv Diffusion2D-PT-D30N050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;