About the Execution of ITS-Tools for Diffusion2D-PT-D40N010
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772500813.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D40N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772500813
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 7.4K Apr 30 05:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 05:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 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-D40N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D40N010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652659657760
Running Version 202205111006
[2022-05-16 00:07:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:07:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:07:39] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2022-05-16 00:07:39] [INFO ] Transformed 1600 places.
[2022-05-16 00:07:39] [INFO ] Transformed 12324 transitions.
[2022-05-16 00:07:39] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 597 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:07:39] [INFO ] Computed 1 place invariants in 152 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:07:40] [INFO ] Computed 1 place invariants in 75 ms
[2022-05-16 00:07:40] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 00:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:42] [INFO ] [Real]Absence check using state equation in 1980 ms returned sat
[2022-05-16 00:07:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:44] [INFO ] [Nat]Absence check using state equation in 1999 ms returned sat
[2022-05-16 00:07:45] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 683 ms.
[2022-05-16 00:07:46] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2022-05-16 00:07:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:48] [INFO ] [Real]Absence check using state equation in 2673 ms returned sat
[2022-05-16 00:07:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:07:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 00:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:51] [INFO ] [Nat]Absence check using state equation in 2410 ms returned sat
[2022-05-16 00:07:52] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 605 ms.
[2022-05-16 00:07:52] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:07:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:54] [INFO ] [Real]Absence check using state equation in 2088 ms returned sat
[2022-05-16 00:07:55] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 651 ms.
[2022-05-16 00:07:56] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:07:58] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2022-05-16 00:07:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:07:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:07:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:00] [INFO ] [Nat]Absence check using state equation in 2201 ms returned sat
[2022-05-16 00:08:01] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 624 ms.
[2022-05-16 00:08:01] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:05] [INFO ] [Real]Absence check using state equation in 3158 ms returned sat
[2022-05-16 00:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:07] [INFO ] [Nat]Absence check using state equation in 1974 ms returned sat
[2022-05-16 00:08:08] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 581 ms.
[2022-05-16 00:08:08] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:10] [INFO ] [Real]Absence check using state equation in 2008 ms returned sat
[2022-05-16 00:08:11] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 536 ms.
[2022-05-16 00:08:11] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 00:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:14] [INFO ] [Real]Absence check using state equation in 2614 ms returned sat
[2022-05-16 00:08:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:17] [INFO ] [Nat]Absence check using state equation in 2583 ms returned sat
[2022-05-16 00:08:18] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 534 ms.
[2022-05-16 00:08:18] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:20] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2022-05-16 00:08:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2022-05-16 00:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:22] [INFO ] [Nat]Absence check using state equation in 2098 ms returned sat
[2022-05-16 00:08:23] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 609 ms.
[2022-05-16 00:08:23] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:26] [INFO ] [Real]Absence check using state equation in 2677 ms returned sat
[2022-05-16 00:08:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:29] [INFO ] [Nat]Absence check using state equation in 2705 ms returned sat
[2022-05-16 00:08:30] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 561 ms.
[2022-05-16 00:08:30] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:32] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2022-05-16 00:08:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-05-16 00:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:35] [INFO ] [Nat]Absence check using state equation in 2021 ms returned sat
[2022-05-16 00:08:35] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 576 ms.
[2022-05-16 00:08:36] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:37] [INFO ] [Real]Absence check using state equation in 1948 ms returned sat
[2022-05-16 00:08:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2022-05-16 00:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:41] [INFO ] [Nat]Absence check using state equation in 2703 ms returned sat
[2022-05-16 00:08:41] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 526 ms.
[2022-05-16 00:08:42] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2022-05-16 00:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:44] [INFO ] [Real]Absence check using state equation in 2640 ms returned sat
[2022-05-16 00:08:45] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 613 ms.
[2022-05-16 00:08:45] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:47] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2022-05-16 00:08:48] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 549 ms.
[2022-05-16 00:08:48] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2022-05-16 00:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:51] [INFO ] [Real]Absence check using state equation in 2560 ms returned sat
[2022-05-16 00:08:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 00:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:54] [INFO ] [Nat]Absence check using state equation in 2531 ms returned sat
[2022-05-16 00:08:55] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 562 ms.
[2022-05-16 00:08:55] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-16 00:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:08:57] [INFO ] [Real]Absence check using state equation in 2388 ms returned sat
[2022-05-16 00:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:09:00] [INFO ] [Nat]Absence check using state equation in 2360 ms returned sat
[2022-05-16 00:09:01] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 592 ms.
[2022-05-16 00:09:01] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-05-16 00:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:09:03] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2022-05-16 00:09:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:09:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 24 ms returned sat
[2022-05-16 00:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:09:06] [INFO ] [Nat]Absence check using state equation in 2163 ms returned sat
[2022-05-16 00:09:06] [INFO ] Computed and/alt/rep : 12316/96188/12316 causal constraints (skipped 0 transitions) in 534 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[0, 0, 7, 9, 9, 1, 0, 0, 0, 0, 0, 1, 7, 0, 0, 9]
Support contains 16 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12076 edges and 1600 vertex of which 1584 / 1600 are part of one of the 1 SCC in 19 ms
Free SCC test removed 1583 places
Drop transitions removed 12076 transitions
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 12290 transitions.
Drop 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 17 transition count 31
Applied a total of 4 rules in 46 ms. Remains 17 /1600 variables (removed 1583) and now considering 31/12324 (removed 12293) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/1600 places, 31/12324 transitions.
// Phase 1: matrix 31 rows 17 cols
[2022-05-16 00:09:06] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=3597 ) properties (out of 16) seen :160
FORMULA Diffusion2D-PT-D40N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 88289 ms.
BK_STOP 1652659747287
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D40N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D40N010, 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 r060-tall-165254772500813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D40N010.tgz
mv Diffusion2D-PT-D40N010 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 ;