fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440300013
Last Updated
May 14, 2023

About the Execution of 2022-gold for IBMB2S565S3960-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
293.212 14150.00 23036.00 88.70 7 7 7 3 7 7 3 3 3 3 1 3 7 2 7 3 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r255-tall-167856440300013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.3K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 05:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:22 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 1678747545524

Running Version 202205111006
[2023-03-13 22:45:46] [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]
[2023-03-13 22:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:45:46] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-13 22:45:46] [INFO ] Transformed 273 places.
[2023-03-13 22:45:46] [INFO ] Transformed 179 transitions.
[2023-03-13 22:45:46] [INFO ] Parsed PT model containing 273 places and 179 transitions in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 179 rows 273 cols
[2023-03-13 22:45:47] [INFO ] Computed 101 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 39 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :49
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :14
// Phase 1: matrix 179 rows 273 cols
[2023-03-13 22:45:47] [INFO ] Computed 101 place invariants in 9 ms
[2023-03-13 22:45:47] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:47] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:45:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:47] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:45:47] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-13 22:45:47] [INFO ] Added : 39 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:45:47] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 29 ms returned sat
[2023-03-13 22:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using state equation in 123 ms returned unsat
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-13 22:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-13 22:45:48] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-13 22:45:48] [INFO ] Added : 65 causal constraints over 13 iterations in 208 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:48] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:48] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:45:48] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-13 22:45:49] [INFO ] Added : 150 causal constraints over 31 iterations in 482 ms. Result :sat
Minimization took 87 ms.
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:49] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-13 22:45:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-13 22:45:50] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-13 22:45:50] [INFO ] Added : 151 causal constraints over 31 iterations in 456 ms. Result :sat
Minimization took 82 ms.
[2023-03-13 22:45:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:50] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-13 22:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:50] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-13 22:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:50] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:45:50] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:45:51] [INFO ] Added : 142 causal constraints over 29 iterations in 412 ms. Result :sat
Minimization took 65 ms.
[2023-03-13 22:45:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:51] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-13 22:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:51] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:51] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 22:45:51] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-13 22:45:52] [INFO ] Added : 142 causal constraints over 29 iterations in 422 ms. Result :sat
Minimization took 60 ms.
[2023-03-13 22:45:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:52] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-13 22:45:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-13 22:45:52] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-13 22:45:52] [INFO ] Added : 142 causal constraints over 29 iterations in 454 ms. Result :sat
Minimization took 74 ms.
[2023-03-13 22:45:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-13 22:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-13 22:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:53] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-13 22:45:53] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-13 22:45:53] [INFO ] Added : 142 causal constraints over 29 iterations in 418 ms. Result :sat
Minimization took 62 ms.
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-13 22:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-13 22:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 22:45:54] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:45:54] [INFO ] Added : 36 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:54] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-13 22:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-13 22:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:54] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-13 22:45:54] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-13 22:45:55] [INFO ] Added : 147 causal constraints over 30 iterations in 406 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [100, 7, 100, 250, 7, 7, 250, 300, 300, 100, 1, 2100, 7, 2, 100, 900] Max seen :[6, 7, 6, 0, 7, 7, 0, 0, 0, 1, 1, 0, 7, 2, 6, 0]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 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 215 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.6 ms
Discarding 58 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Ensure Unique test removed 77 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 106 edges and 138 vertex of which 20 / 138 are part of one of the 1 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 119 transition count 84
Reduce places removed 54 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 81 rules applied. Total rules applied 223 place count 65 transition count 57
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 231 place count 62 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 236 place count 57 transition count 52
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 236 place count 57 transition count 37
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 267 place count 41 transition count 37
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 273 place count 35 transition count 31
Iterating global reduction 4 with 6 rules applied. Total rules applied 279 place count 35 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 35 transition count 30
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 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 293 place count 27 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 294 place count 26 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 26 transition count 24
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 5 with 2 rules applied. Total rules applied 297 place count 25 transition count 23
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 25 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 299 place count 24 transition count 22
Applied a total of 299 rules in 43 ms. Remains 24 /273 variables (removed 249) and now considering 22/179 (removed 157) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/273 places, 22/179 transitions.
// Phase 1: matrix 22 rows 24 cols
[2023-03-13 22:45:55] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 20342 resets, run finished after 206 ms. (steps per millisecond=4854 ) properties (out of 10) seen :30
Incomplete Best-First random walk after 1000000 steps, including 5401 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 1000001 steps, including 3412 resets, run finished after 239 ms. (steps per millisecond=4184 ) properties (out of 10) seen :30
Incomplete Best-First random walk after 1000001 steps, including 3841 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 10) seen :37
Incomplete Best-First random walk after 1000001 steps, including 4088 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 10) seen :38
Incomplete Best-First random walk after 1000000 steps, including 4108 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 10) seen :37
Incomplete Best-First random walk after 1000001 steps, including 3928 resets, run finished after 296 ms. (steps per millisecond=3378 ) properties (out of 10) seen :40
Incomplete Best-First random walk after 1000001 steps, including 3966 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 1000000 steps, including 4073 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 10) seen :38
Incomplete Best-First random walk after 1000001 steps, including 5955 resets, run finished after 282 ms. (steps per millisecond=3546 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 1000000 steps, including 3989 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 10) seen :39
// Phase 1: matrix 22 rows 24 cols
[2023-03-13 22:45:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:45:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 3, 3, 3, 3, 3, 3, 7, 3] Max seen :[7, 7, 3, 3, 3, 3, 3, 3, 7, 3]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12940 ms.

BK_STOP 1678747559674

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r255-tall-167856440300013"
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 ;