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.r132-tall-165271820400101.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 IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 11K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 127K May 10 09:34 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 IBMB2S565S3960-PT-none-UpperBounds-00
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-01
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-02
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-03
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-04
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-05
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-06
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-07
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-08
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-09
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-10
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-11
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-12
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-13
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-14
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652745720558

Running Version 202205111006
[2022-05-17 00:02:01] [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-17 00:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:02:01] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-17 00:02:01] [INFO ] Transformed 273 places.
[2022-05-17 00:02:01] [INFO ] Transformed 179 transitions.
[2022-05-17 00:02:01] [INFO ] Parsed PT model containing 273 places and 179 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 179 rows 273 cols
[2022-05-17 00:02:01] [INFO ] Computed 101 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :67
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :28
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :25
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :24
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :26
// Phase 1: matrix 179 rows 273 cols
[2022-05-17 00:02:02] [INFO ] Computed 101 place invariants in 11 ms
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 20 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-17 00:02:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:02] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 00:02:02] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-17 00:02:02] [INFO ] Added : 37 causal constraints over 8 iterations in 165 ms. Result :sat
Minimization took 30 ms.
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2022-05-17 00:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:02] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-17 00:02:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 00:02:03] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-17 00:02:03] [INFO ] Added : 142 causal constraints over 29 iterations in 485 ms. Result :sat
Minimization took 70 ms.
[2022-05-17 00:02:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:03] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-17 00:02:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-17 00:02:03] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-17 00:02:04] [INFO ] Added : 30 causal constraints over 6 iterations in 122 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 00:02:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:04] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2022-05-17 00:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:04] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-17 00:02:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:04] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:04] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-17 00:02:04] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-17 00:02:04] [INFO ] Added : 147 causal constraints over 30 iterations in 484 ms. Result :sat
Minimization took 70 ms.
[2022-05-17 00:02:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 20 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-17 00:02:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 11 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:05] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 00:02:05] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 00:02:05] [INFO ] Added : 142 causal constraints over 29 iterations in 420 ms. Result :sat
Minimization took 62 ms.
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:05] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-17 00:02:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2022-05-17 00:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:06] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 00:02:06] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-17 00:02:06] [INFO ] Added : 148 causal constraints over 30 iterations in 443 ms. Result :sat
Minimization took 80 ms.
[2022-05-17 00:02:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:06] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2022-05-17 00:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:06] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-17 00:02:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:06] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:06] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 00:02:06] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-17 00:02:07] [INFO ] Added : 141 causal constraints over 29 iterations in 443 ms. Result :sat
Minimization took 67 ms.
[2022-05-17 00:02:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:07] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2022-05-17 00:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:07] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-17 00:02:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:07] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2022-05-17 00:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:07] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 00:02:07] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 00:02:08] [INFO ] Added : 148 causal constraints over 30 iterations in 437 ms. Result :sat
Minimization took 76 ms.
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 20 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-17 00:02:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 00:02:08] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 00:02:08] [INFO ] Added : 36 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-17 00:02:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2022-05-17 00:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:08] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 00:02:08] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 00:02:09] [INFO ] Added : 155 causal constraints over 32 iterations in 442 ms. Result :sat
Minimization took 92 ms.
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-17 00:02:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:09] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 00:02:09] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 00:02:09] [INFO ] Added : 33 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 21 ms.
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2022-05-17 00:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:09] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-17 00:02:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 00:02:10] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2022-05-17 00:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:10] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-17 00:02:10] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 00:02:10] [INFO ] Added : 35 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [7, 900, 7, 100, 300, 7, 100, 100, 100, 2, 7, 100, 100, 100] Max seen :[6, 0, 6, 4, 0, 7, 4, 4, 4, 2, 6, 2, 6, 5]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 225 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Ensure Unique test removed 82 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 143 transition count 69
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 78 rules applied. Total rules applied 243 place count 69 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 251 place count 67 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 257 place count 61 transition count 59
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 257 place count 61 transition count 41
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 295 place count 41 transition count 41
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 300 place count 36 transition count 36
Iterating global reduction 4 with 5 rules applied. Total rules applied 305 place count 36 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 317 place count 29 transition count 31
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 318 place count 28 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 28 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 27 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 26 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 26 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 26 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 326 place count 26 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 25 transition count 27
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 25 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 329 place count 24 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 330 place count 24 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 331 place count 23 transition count 25
Applied a total of 331 rules in 63 ms. Remains 23 /273 variables (removed 250) and now considering 25/179 (removed 154) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/273 places, 25/179 transitions.
// Phase 1: matrix 25 rows 23 cols
[2022-05-17 00:02:10] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 15150 resets, run finished after 221 ms. (steps per millisecond=4524 ) properties (out of 9) seen :48
Incomplete Best-First random walk after 1000001 steps, including 3475 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 9) seen :38
Incomplete Best-First random walk after 1000001 steps, including 3140 resets, run finished after 276 ms. (steps per millisecond=3623 ) properties (out of 9) seen :39
Incomplete Best-First random walk after 1000001 steps, including 3594 resets, run finished after 270 ms. (steps per millisecond=3703 ) properties (out of 9) seen :37
Incomplete Best-First random walk after 1000001 steps, including 2771 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 9) seen :36
Incomplete Best-First random walk after 1000001 steps, including 2891 resets, run finished after 212 ms. (steps per millisecond=4716 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 1000001 steps, including 3838 resets, run finished after 243 ms. (steps per millisecond=4115 ) properties (out of 9) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2974 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 1000000 steps, including 4953 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8601 resets, run finished after 182 ms. (steps per millisecond=5494 ) properties (out of 9) seen :16
// Phase 1: matrix 25 rows 23 cols
[2022-05-17 00:02:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:02:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:02:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 00:02:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:02:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 7, 3, 7, 7, 7, 5, 7, 7] Max seen :[3, 7, 3, 7, 7, 7, 5, 7, 7]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12168 ms.

BK_STOP 1652745733937

--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r132-tall-165271820400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;