About the Execution of 2023-gold for Diffusion2D-PT-D30N150
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151300181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Diffusion2D-PT-D30N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151300181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716418260036
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N150
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 22:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:51:01] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-22 22:51:01] [INFO ] Transformed 900 places.
[2024-05-22 22:51:01] [INFO ] Transformed 6844 transitions.
[2024-05-22 22:51:01] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 6844 rows 900 cols
[2024-05-22 22:51:02] [INFO ] Computed 1 invariants in 68 ms
Incomplete random walk after 10125 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=632 ) properties (out of 16) seen :150
FORMULA Diffusion2D-PT-D30N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :1
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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 :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 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :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 :1
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
[2024-05-22 22:51:02] [INFO ] Invariant cache hit.
[2024-05-22 22:51:02] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 22:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:03] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2024-05-22 22:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:51:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:05] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2024-05-22 22:51:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 454 ms.
[2024-05-22 22:51:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:06] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2024-05-22 22:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:08] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2024-05-22 22:51:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 367 ms.
[2024-05-22 22:51:08] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:09] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2024-05-22 22:51:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 334 ms.
[2024-05-22 22:51:10] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:11] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2024-05-22 22:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:12] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2024-05-22 22:51:13] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 301 ms.
[2024-05-22 22:51:13] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:14] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2024-05-22 22:51:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:15] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2024-05-22 22:51:16] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 299 ms.
[2024-05-22 22:51:16] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-22 22:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:17] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2024-05-22 22:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:18] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2024-05-22 22:51:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 314 ms.
[2024-05-22 22:51:18] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:19] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2024-05-22 22:51:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:20] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2024-05-22 22:51:21] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 284 ms.
[2024-05-22 22:51:21] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:22] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2024-05-22 22:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:23] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2024-05-22 22:51:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 300 ms.
[2024-05-22 22:51:24] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:25] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-05-22 22:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:26] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2024-05-22 22:51:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 286 ms.
[2024-05-22 22:51:26] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:27] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2024-05-22 22:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:28] [INFO ] [Nat]Absence check using state equation in 890 ms returned sat
[2024-05-22 22:51:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 306 ms.
[2024-05-22 22:51:29] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:30] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-22 22:51:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 290 ms.
[2024-05-22 22:51:30] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:31] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2024-05-22 22:51:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-22 22:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:32] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2024-05-22 22:51:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 281 ms.
[2024-05-22 22:51:33] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:34] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2024-05-22 22:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:35] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2024-05-22 22:51:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 309 ms.
[2024-05-22 22:51:35] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:36] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2024-05-22 22:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:51:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:37] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2024-05-22 22:51:38] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 287 ms.
[2024-05-22 22:51:38] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:51:39] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2024-05-22 22:51:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 281 ms.
Current structural bounds on expressions (after SMT) : [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150] Max seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1]
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 6632 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 14 ms
Free SCC test removed 884 places
Drop transitions removed 6632 transitions
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 6814 transitions.
Applied a total of 1 rules in 35 ms. Remains 16 /900 variables (removed 884) and now considering 30/6844 (removed 6814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 16/900 places, 30/6844 transitions.
// Phase 1: matrix 30 rows 16 cols
[2024-05-22 22:51:40] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000121 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10639 ) properties (out of 15) seen :2250
FORMULA Diffusion2D-PT-D30N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38695 ms.
BK_STOP 1716418301100
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Diffusion2D-PT-D30N150, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151300181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 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 '
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 ;