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

About the Execution of 2022-gold for Diffusion2D-PT-D30N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
650.871 76748.00 99618.00 447.50 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.r159-smll-167819445100026.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 gold2022
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 r159-smll-167819445100026
=====================================================================

--------------------
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 1678465013958

Running Version 202205111006
[2023-03-10 16:16:56] [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]
[2023-03-10 16:16:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:16:56] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2023-03-10 16:16:56] [INFO ] Transformed 900 places.
[2023-03-10 16:16:56] [INFO ] Transformed 6844 transitions.
[2023-03-10 16:16:56] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 742 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-10 16:16:57] [INFO ] Computed 1 place invariants in 114 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :200
FORMULA Diffusion2D-PT-D30N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :0
// Phase 1: matrix 6844 rows 900 cols
[2023-03-10 16:16:57] [INFO ] Computed 1 place invariants in 104 ms
[2023-03-10 16:16:58] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-10 16:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:00] [INFO ] [Real]Absence check using state equation in 2280 ms returned sat
[2023-03-10 16:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:02] [INFO ] [Nat]Absence check using state equation in 1860 ms returned sat
[2023-03-10 16:17:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 775 ms.
[2023-03-10 16:17:04] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:06] [INFO ] [Real]Absence check using state equation in 1855 ms returned sat
[2023-03-10 16:17:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2023-03-10 16:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:08] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2023-03-10 16:17:09] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 615 ms.
[2023-03-10 16:17:09] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-10 16:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:11] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2023-03-10 16:17:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-10 16:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:13] [INFO ] [Nat]Absence check using state equation in 2018 ms returned sat
[2023-03-10 16:17:14] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 643 ms.
[2023-03-10 16:17:15] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:16] [INFO ] [Real]Absence check using state equation in 1638 ms returned sat
[2023-03-10 16:17:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:19] [INFO ] [Nat]Absence check using state equation in 1995 ms returned sat
[2023-03-10 16:17:19] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 522 ms.
[2023-03-10 16:17:19] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:22] [INFO ] [Real]Absence check using state equation in 2279 ms returned sat
[2023-03-10 16:17:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-10 16:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:24] [INFO ] [Nat]Absence check using state equation in 2109 ms returned sat
[2023-03-10 16:17:25] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 664 ms.
[2023-03-10 16:17:25] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:28] [INFO ] [Real]Absence check using state equation in 2090 ms returned sat
[2023-03-10 16:17:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:30] [INFO ] [Nat]Absence check using state equation in 1771 ms returned sat
[2023-03-10 16:17:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 431 ms.
[2023-03-10 16:17:31] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-10 16:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:33] [INFO ] [Real]Absence check using state equation in 1994 ms returned sat
[2023-03-10 16:17:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:35] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2023-03-10 16:17:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 636 ms.
[2023-03-10 16:17:36] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-10 16:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:38] [INFO ] [Real]Absence check using state equation in 1891 ms returned sat
[2023-03-10 16:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:40] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2023-03-10 16:17:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 453 ms.
[2023-03-10 16:17:41] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-10 16:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:43] [INFO ] [Real]Absence check using state equation in 1703 ms returned sat
[2023-03-10 16:17:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-10 16:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:45] [INFO ] [Nat]Absence check using state equation in 1695 ms returned sat
[2023-03-10 16:17:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 707 ms.
[2023-03-10 16:17:46] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:48] [INFO ] [Real]Absence check using state equation in 1973 ms returned sat
[2023-03-10 16:17:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:50] [INFO ] [Nat]Absence check using state equation in 1630 ms returned sat
[2023-03-10 16:17:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 693 ms.
[2023-03-10 16:17:51] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:53] [INFO ] [Real]Absence check using state equation in 2067 ms returned sat
[2023-03-10 16:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:55] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2023-03-10 16:17:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 543 ms.
[2023-03-10 16:17:56] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:58] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2023-03-10 16:17:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:00] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2023-03-10 16:18:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 551 ms.
[2023-03-10 16:18:01] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2023-03-10 16:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:03] [INFO ] [Real]Absence check using state equation in 1648 ms returned sat
[2023-03-10 16:18:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:05] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2023-03-10 16:18:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 427 ms.
[2023-03-10 16:18:06] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:07] [INFO ] [Real]Absence check using state equation in 1588 ms returned sat
[2023-03-10 16:18:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:09] [INFO ] [Nat]Absence check using state equation in 1559 ms returned sat
[2023-03-10 16:18:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 463 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6624 edges and 900 vertex of which 886 / 900 are part of one of the 1 SCC in 26 ms
Free SCC test removed 885 places
Drop transitions removed 6624 transitions
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 6812 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 15 transition count 26
Applied a total of 7 rules in 74 ms. Remains 15 /900 variables (removed 885) and now considering 26/6844 (removed 6818) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/900 places, 26/6844 transitions.
// Phase 1: matrix 26 rows 15 cols
[2023-03-10 16:18:10] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=5319 ) properties (out of 14) seen :1400
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-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 74434 ms.

BK_STOP 1678465090706

--------------------
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-D30N100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
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 r159-smll-167819445100026"
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 ;