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

About the Execution of 2022-gold for HouseConstruction-PT-01000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
334.104 21401.00 28040.00 169.60 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 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.r223-smll-167840362300073.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 HouseConstruction-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362300073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-01000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678579388741

Running Version 202205111006
[2023-03-12 00:03:10] [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-12 00:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:03:11] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-12 00:03:11] [INFO ] Transformed 26 places.
[2023-03-12 00:03:11] [INFO ] Transformed 18 transitions.
[2023-03-12 00:03:11] [INFO ] Parsed PT model containing 26 places and 18 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 00:03:11] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 16) seen :4000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :1183
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :1015
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :1151
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :1107
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :1147
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :1109
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1148
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :1133
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 :1161
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 :1103
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 :2014
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :1110
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 :1103
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 :1211
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 :1132
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :1115
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 00:03:11] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-12 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-12 00:03:11] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 00:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:11] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-12 00:03:11] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 00:03:11] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-12 00:03:11] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:11] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-12 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:03:12] [INFO ] Added : 10 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 00:03:12] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 00:03:12] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-12 00:03:12] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:12] [INFO ] Added : 12 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:03:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:13] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:03:13] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:03:13] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:03:13] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:03:13] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1, 1000, -1, -1, 1000, -1, -1, -1, -1, -1, 1000, -1, -1, 1000, -1, -1] Max seen :[60, 1000, 20, 16, 1000, 45, 20, 33, 39, 16, 1000, 17, 27, 1000, 38, 19]
FORMULA HouseConstruction-PT-01000-UpperBounds-13 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-10 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 26 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 26/26 places, 18/18 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 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 24 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 22 transition count 14
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 3 with 2 rules applied. Total rules applied 10 place count 21 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 20 transition count 12
Applied a total of 11 rules in 128 ms. Remains 20 /26 variables (removed 6) and now considering 12/18 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/26 places, 12/18 transitions.
// Phase 1: matrix 12 rows 20 cols
[2023-03-12 00:03:23] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000084 steps, including 83 resets, run finished after 235 ms. (steps per millisecond=4255 ) properties (out of 12) seen :12000
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 12) seen :3097
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 12) seen :4538
Incomplete Best-First random walk after 1000000 steps, including 7 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 12) seen :2656
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 12) seen :2583
Incomplete Best-First random walk after 1000000 steps, including 10 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 12) seen :4394
Incomplete Best-First random walk after 1000000 steps, including 13 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 12) seen :3569
Incomplete Best-First random walk after 1000000 steps, including 19 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 12) seen :2163
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 12) seen :2516
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 12) seen :2522
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 12) seen :2308
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 12) seen :2313
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 12) seen :2596
// Phase 1: matrix 12 rows 20 cols
[2023-03-12 00:03:29] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-12 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:29] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:03:30] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000] Max seen :[1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000]
FORMULA HouseConstruction-PT-01000-UpperBounds-15 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-14 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-12 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-09 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-08 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 19288 ms.

BK_STOP 1678579410142

--------------------
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="HouseConstruction-PT-01000"
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 HouseConstruction-PT-01000, 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 r223-smll-167840362300073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-01000.tgz
mv HouseConstruction-PT-01000 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 ;