About the Execution of 2024-gold for Diffusion2D-PT-D20N100
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-174854075900063.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-D20N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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.9K 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-D20N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748605425758
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-D20N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:43:48] [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:43:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:43:49] [INFO ] Load time of PNML (sax parser for PT used): 562 ms
[2025-05-30 11:43:49] [INFO ] Transformed 400 places.
[2025-05-30 11:43:49] [INFO ] Transformed 2964 transitions.
[2025-05-30 11:43:49] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 827 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 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:43:49] [INFO ] Computed 1 invariants in 118 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:[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
RANDOM walk for 10002 steps (2 resets) in 27 ms. (357 steps per ms)
FORMULA Diffusion2D-PT-D20N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 202 ms. (738 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 1, 0, 1, 0, 4, 0, 1, 0, 2, 0, 0] Max Struct:[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
[2025-05-30 11:43:49] [INFO ] Invariant cache hit.
[2025-05-30 11:43:50] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2025-05-30 11:43:51] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2025-05-30 11:43:52] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 495 ms.
[2025-05-30 11:43:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:53] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2025-05-30 11:43:53] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 390 ms.
Minimization took 557 ms.
[2025-05-30 11:43:54] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:55] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2025-05-30 11:43:55] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 301 ms.
[2025-05-30 11:43:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:56] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2025-05-30 11:43:57] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 227 ms.
Minimization took 549 ms.
[2025-05-30 11:43:57] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:43:58] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2025-05-30 11:43:58] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 287 ms.
[2025-05-30 11:43:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:43:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:43:59] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2025-05-30 11:44:00] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 306 ms.
Minimization took 546 ms.
[2025-05-30 11:44:00] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-30 11:44:01] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2025-05-30 11:44:02] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 255 ms.
[2025-05-30 11:44:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-30 11:44:02] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2025-05-30 11:44:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 346 ms.
Minimization took 554 ms.
[2025-05-30 11:44:04] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:44:04] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2025-05-30 11:44:05] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 251 ms.
[2025-05-30 11:44:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:06] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2025-05-30 11:44:06] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 220 ms.
Minimization took 538 ms.
[2025-05-30 11:44:07] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:44:08] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2025-05-30 11:44:08] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 342 ms.
[2025-05-30 11:44:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:09] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2025-05-30 11:44:10] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 347 ms.
Minimization took 549 ms.
[2025-05-30 11:44:10] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:11] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2025-05-30 11:44:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 249 ms.
[2025-05-30 11:44:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:44:13] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2025-05-30 11:44:13] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 322 ms.
Minimization took 555 ms.
[2025-05-30 11:44:14] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:15] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2025-05-30 11:44:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 307 ms.
[2025-05-30 11:44:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:16] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2025-05-30 11:44:17] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 338 ms.
Minimization took 537 ms.
[2025-05-30 11:44:17] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:44:18] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2025-05-30 11:44:18] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 283 ms.
[2025-05-30 11:44:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:44:20] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2025-05-30 11:44:20] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 328 ms.
Minimization took 548 ms.
[2025-05-30 11:44:21] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:22] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2025-05-30 11:44:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 256 ms.
[2025-05-30 11:44:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:23] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2025-05-30 11:44:24] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 259 ms.
Minimization took 547 ms.
[2025-05-30 11:44:24] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:44:25] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2025-05-30 11:44:26] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 332 ms.
[2025-05-30 11:44:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:44:27] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2025-05-30 11:44:27] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 329 ms.
Minimization took 551 ms.
[2025-05-30 11:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:29] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2025-05-30 11:44:29] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 346 ms.
[2025-05-30 11:44:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:30] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2025-05-30 11:44:31] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 266 ms.
Minimization took 549 ms.
[2025-05-30 11:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:32] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2025-05-30 11:44:32] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 222 ms.
[2025-05-30 11:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:44:33] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2025-05-30 11:44:34] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 252 ms.
Minimization took 545 ms.
[2025-05-30 11:44:34] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:35] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2025-05-30 11:44:35] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 247 ms.
[2025-05-30 11:44:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:44:36] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2025-05-30 11:44:37] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 249 ms.
Minimization took 555 ms.
[2025-05-30 11:44:37] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:38] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2025-05-30 11:44:39] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 246 ms.
[2025-05-30 11:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:44:40] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2025-05-30 11:44:40] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 218 ms.
Minimization took 552 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 1, 0, 1, 0, 4, 0, 1, 0, 2, 0, 0] Max Struct:[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 1, 0, 1, 0, 4, 0, 1, 0, 2, 0, 0] Max Struct:[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
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 2752 edges and 400 vertex of which 385 / 400 are part of one of the 1 SCC in 17 ms
Free SCC test removed 384 places
Drop transitions (Empty/Sink Transition effects.) removed 2752 transitions
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 2928 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 16 transition count 29
Applied a total of 8 rules in 93 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 120 ms. Remains : 16/400 places, 29/2964 transitions.
// Phase 1: matrix 29 rows 16 cols
[2025-05-30 11:44:41] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 1, 0, 1, 0, 4, 0, 1, 0, 2, 0, 0] Max Struct:[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
RANDOM walk for 1000042 steps (2 resets) in 266 ms. (3745 steps per ms)
FORMULA Diffusion2D-PT-D20N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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:44:42] [INFO ] Flatten gal took : 279 ms
[2025-05-30 11:44:42] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:44:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2187686187295274965.gal : 9 ms
[2025-05-30 11:44:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5676462854718655806.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/ReachabilityCardinality2187686187295274965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5676462854718655806.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 54126 ms.
BK_STOP 1748605482509
--------------------
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-D20N100"
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-D20N100, 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-174854075900063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N100.tgz
mv Diffusion2D-PT-D20N100 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 '
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 ;