fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r069-smll-174854075900062
Last Updated
June 24, 2025

About the Execution of 2024-gold for Diffusion2D-PT-D20N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15686.840 57158.00 77846.00 549.30 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/mcc2025-input.r069-smll-174854075900062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Diffusion2D-PT-D20N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748605355682

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:42:37] [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]
[2025-05-30 11:42:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:42:38] [INFO ] Load time of PNML (sax parser for PT used): 467 ms
[2025-05-30 11:42:38] [INFO ] Transformed 400 places.
[2025-05-30 11:42:38] [INFO ] Transformed 2964 transitions.
[2025-05-30 11:42:38] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 659 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2964 rows 400 cols
[2025-05-30 11:42:38] [INFO ] Computed 1 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 10001 steps (2 resets) in 45 ms. (217 steps per ms)
FORMULA Diffusion2D-PT-D20N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 152 ms. (980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2025-05-30 11:42:38] [INFO ] Invariant cache hit.
[2025-05-30 11:42:39] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2025-05-30 11:42:40] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2025-05-30 11:42:41] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 603 ms.
[2025-05-30 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-05-30 11:42:42] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2025-05-30 11:42:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 358 ms.
Minimization took 652 ms.
[2025-05-30 11:42:43] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-05-30 11:42:44] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2025-05-30 11:42:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 213 ms.
[2025-05-30 11:42:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:46] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2025-05-30 11:42:46] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 360 ms.
Minimization took 558 ms.
[2025-05-30 11:42:47] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:48] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2025-05-30 11:42:49] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 330 ms.
[2025-05-30 11:42:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-05-30 11:42:50] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2025-05-30 11:42:50] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 231 ms.
Minimization took 556 ms.
[2025-05-30 11:42:51] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:42:52] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2025-05-30 11:42:52] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 206 ms.
[2025-05-30 11:42:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:53] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2025-05-30 11:42:53] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 320 ms.
Minimization took 556 ms.
[2025-05-30 11:42:54] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:55] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2025-05-30 11:42:55] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 210 ms.
[2025-05-30 11:42:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:56] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2025-05-30 11:42:57] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 330 ms.
Minimization took 555 ms.
[2025-05-30 11:42:57] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:58] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2025-05-30 11:42:58] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 253 ms.
[2025-05-30 11:42:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:42:59] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2025-05-30 11:43:00] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 200 ms.
Minimization took 554 ms.
[2025-05-30 11:43:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:01] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2025-05-30 11:43:02] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 314 ms.
[2025-05-30 11:43:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:43:03] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2025-05-30 11:43:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 307 ms.
Minimization took 544 ms.
[2025-05-30 11:43:04] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-05-30 11:43:05] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2025-05-30 11:43:05] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 336 ms.
[2025-05-30 11:43:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:43:06] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2025-05-30 11:43:07] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 329 ms.
Minimization took 556 ms.
[2025-05-30 11:43:07] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:43:08] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2025-05-30 11:43:09] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 341 ms.
[2025-05-30 11:43:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:10] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2025-05-30 11:43:10] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 249 ms.
Minimization took 558 ms.
[2025-05-30 11:43:11] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:12] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2025-05-30 11:43:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 321 ms.
[2025-05-30 11:43:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:13] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2025-05-30 11:43:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 214 ms.
Minimization took 544 ms.
[2025-05-30 11:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:43:15] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2025-05-30 11:43:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 349 ms.
[2025-05-30 11:43:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2025-05-30 11:43:16] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2025-05-30 11:43:17] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 289 ms.
Minimization took 540 ms.
[2025-05-30 11:43:18] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:18] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2025-05-30 11:43:19] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 212 ms.
[2025-05-30 11:43:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-30 11:43:19] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2025-05-30 11:43:20] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 208 ms.
Minimization took 548 ms.
[2025-05-30 11:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:21] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2025-05-30 11:43:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 320 ms.
[2025-05-30 11:43:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:23] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2025-05-30 11:43:23] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 321 ms.
Minimization took 555 ms.
[2025-05-30 11:43:24] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:43:25] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2025-05-30 11:43:25] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 341 ms.
[2025-05-30 11:43:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-05-30 11:43:26] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2025-05-30 11:43:27] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 264 ms.
Minimization took 555 ms.
[2025-05-30 11:43:27] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:43:28] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2025-05-30 11:43:29] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 315 ms.
[2025-05-30 11:43:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:30] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2025-05-30 11:43:30] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 331 ms.
Minimization took 550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[49, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2744 edges and 400 vertex of which 385 / 400 are part of one of the 1 SCC in 15 ms
Free SCC test removed 384 places
Drop transitions (Empty/Sink Transition effects.) removed 2744 transitions
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 2932 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 16 transition count 29
Applied a total of 4 rules in 91 ms. Remains 16 /400 variables (removed 384) and now considering 29/2964 (removed 2935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 16/400 places, 29/2964 transitions.
// Phase 1: matrix 29 rows 16 cols
[2025-05-30 11:43:31] [INFO ] Computed 1 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[49, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000006 steps (2 resets) in 326 ms. (3058 steps per ms)
FORMULA Diffusion2D-PT-D20N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 530 ms. (1883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-30 11:43:32] [INFO ] Flatten gal took : 211 ms
[2025-05-30 11:43:32] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:43:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2442805257173922054.gal : 9 ms
[2025-05-30 11:43:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6283222148900759698.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2442805257173922054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6283222148900759698.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 55242 ms.

BK_STOP 1748605412840

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-D20N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Diffusion2D-PT-D20N050, 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 r069-smll-174854075900062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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