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

About the Execution of Marcie+red for Diffusion2D-PT-D30N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
680.876 73276.00 92314.00 588.50 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 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.r138-smll-167819419800189.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 marciexred
Input is Diffusion2D-PT-D30N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419800189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:20 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.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 04:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 04:22 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-D30N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678628314938

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 13:38:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:38:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:38:38] [INFO ] Load time of PNML (sax parser for PT used): 558 ms
[2023-03-12 13:38:38] [INFO ] Transformed 900 places.
[2023-03-12 13:38:38] [INFO ] Transformed 6844 transitions.
[2023-03-12 13:38:38] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 720 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-12 13:38:38] [INFO ] Computed 1 place invariants in 105 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :62
FORMULA Diffusion2D-PT-D30N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) 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 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :2
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
[2023-03-12 13:38:39] [INFO ] Invariant cache hit.
[2023-03-12 13:38:39] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2023-03-12 13:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:41] [INFO ] [Real]Absence check using state equation in 2046 ms returned sat
[2023-03-12 13:38:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:38:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-12 13:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:43] [INFO ] [Nat]Absence check using state equation in 1750 ms returned sat
[2023-03-12 13:38:44] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 708 ms.
[2023-03-12 13:38:45] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-12 13:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:46] [INFO ] [Real]Absence check using state equation in 1860 ms returned sat
[2023-03-12 13:38:47] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 591 ms.
[2023-03-12 13:38:48] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:49] [INFO ] [Real]Absence check using state equation in 1712 ms returned sat
[2023-03-12 13:38:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:38:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-12 13:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:51] [INFO ] [Nat]Absence check using state equation in 1712 ms returned sat
[2023-03-12 13:38:52] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 506 ms.
[2023-03-12 13:38:52] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:54] [INFO ] [Real]Absence check using state equation in 1514 ms returned sat
[2023-03-12 13:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:38:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 13:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:56] [INFO ] [Nat]Absence check using state equation in 1493 ms returned sat
[2023-03-12 13:38:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 485 ms.
[2023-03-12 13:38:57] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-12 13:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:38:58] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2023-03-12 13:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:38:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:00] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2023-03-12 13:39:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 494 ms.
[2023-03-12 13:39:01] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:03] [INFO ] [Real]Absence check using state equation in 1638 ms returned sat
[2023-03-12 13:39:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 13:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:05] [INFO ] [Nat]Absence check using state equation in 1759 ms returned sat
[2023-03-12 13:39:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 453 ms.
[2023-03-12 13:39:05] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:07] [INFO ] [Real]Absence check using state equation in 1820 ms returned sat
[2023-03-12 13:39:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:09] [INFO ] [Nat]Absence check using state equation in 1828 ms returned sat
[2023-03-12 13:39:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 472 ms.
[2023-03-12 13:39:10] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:12] [INFO ] [Real]Absence check using state equation in 1518 ms returned sat
[2023-03-12 13:39:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:14] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2023-03-12 13:39:15] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 600 ms.
[2023-03-12 13:39:15] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:17] [INFO ] [Real]Absence check using state equation in 1705 ms returned sat
[2023-03-12 13:39:17] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 506 ms.
[2023-03-12 13:39:18] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:19] [INFO ] [Real]Absence check using state equation in 1745 ms returned sat
[2023-03-12 13:39:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:21] [INFO ] [Nat]Absence check using state equation in 1785 ms returned sat
[2023-03-12 13:39:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 511 ms.
[2023-03-12 13:39:22] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-12 13:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:24] [INFO ] [Real]Absence check using state equation in 1938 ms returned sat
[2023-03-12 13:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 13:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:27] [INFO ] [Nat]Absence check using state equation in 1940 ms returned sat
[2023-03-12 13:39:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 598 ms.
[2023-03-12 13:39:28] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:30] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2023-03-12 13:39:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 13:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:32] [INFO ] [Nat]Absence check using state equation in 1968 ms returned sat
[2023-03-12 13:39:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 578 ms.
[2023-03-12 13:39:33] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-12 13:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:35] [INFO ] [Real]Absence check using state equation in 1732 ms returned sat
[2023-03-12 13:39:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:37] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2023-03-12 13:39:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 533 ms.
[2023-03-12 13:39:37] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-12 13:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:39] [INFO ] [Real]Absence check using state equation in 1600 ms returned sat
[2023-03-12 13:39:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-12 13:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:41] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2023-03-12 13:39:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 458 ms.
[2023-03-12 13:39:42] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2023-03-12 13:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:44] [INFO ] [Real]Absence check using state equation in 1389 ms returned sat
[2023-03-12 13:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:39:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-12 13:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:39:46] [INFO ] [Nat]Absence check using state equation in 1671 ms returned sat
[2023-03-12 13:39:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 462 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[8, 1, 9, 8, 0, 0, 0, 8, 2, 0, 0, 0, 8, 0, 9]
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 6614 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 22 ms
Free SCC test removed 884 places
Drop transitions removed 6614 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 6810 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 16 transition count 28
Applied a total of 7 rules in 57 ms. Remains 16 /900 variables (removed 884) and now considering 28/6844 (removed 6816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 16/900 places, 28/6844 transitions.
// Phase 1: matrix 28 rows 16 cols
[2023-03-12 13:39:46] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 15) seen :150
FORMULA Diffusion2D-PT-D30N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 69203 ms.
ITS solved all properties within timeout

BK_STOP 1678628388214

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D30N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Diffusion2D-PT-D30N010, 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 r138-smll-167819419800189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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