fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477700421
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HouseConstruction-PT-01000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
410.684 23873.00 32812.00 155.90 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/mcc2022-input.r114-smll-165264477700421.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 HouseConstruction-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477700421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 6.2K Apr 29 18:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K 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 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 1652819395204

Running Version 202205111006
[2022-05-17 20:29:57] [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 20:29:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 20:29:57] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-17 20:29:57] [INFO ] Transformed 26 places.
[2022-05-17 20:29:57] [INFO ] Transformed 18 transitions.
[2022-05-17 20:29:57] [INFO ] Parsed PT model containing 26 places and 18 transitions in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 20:29:57] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10025 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :172
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :134
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :136
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :407
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :232
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :108
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 :187
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 :1015
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 :271
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :164
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 :123
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :165
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 :120
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 20:29:57] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 15 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:58] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:58] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:58] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 20:29:58] [INFO ] Added : 7 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 20:29:58] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 20:29:58] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 20:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 20:29:59] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:59] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:59] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:59] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 20:29:59] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:29:59] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 20:29:59] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:29:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:29:59] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:29:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 20:30:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:30:00] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 20:30:00] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 20:30:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 20:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:30:00] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:00] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-17 20:30:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 20:30:00] [INFO ] Added : 10 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 20:30:00] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 20:30:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 20:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 20:30:00] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 20:30:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 20:30:00] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1000, -1, -1, -1, -1, -1] Max seen :[57, 50, 25, 34, 999, 20, 999, 57, 27, 42, 1000, 999, 20, 16, 20, 21]
FORMULA HouseConstruction-PT-01000-UpperBounds-10 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 26/26 places, 18/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 24 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 24 transition count 15
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 6 place count 23 transition count 15
Applied a total of 6 rules in 20 ms. Remains 23 /26 variables (removed 3) and now considering 15/18 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/26 places, 15/18 transitions.
// Phase 1: matrix 15 rows 23 cols
[2022-05-17 20:30:10] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000069 steps, including 66 resets, run finished after 209 ms. (steps per millisecond=4785 ) properties (out of 15) seen :15000
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 15) seen :3465
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 15) seen :2735
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 15) seen :2691
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 15) seen :2609
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 15) seen :3012
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 15) seen :2730
Incomplete Best-First random walk after 1000000 steps, including 12 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 15) seen :4243
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 15) seen :4300
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 15) seen :2673
Incomplete Best-First random walk after 1000000 steps, including 11 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 15) seen :3508
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 15) seen :5240
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 15) seen :4779
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 15) seen :2681
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 15) seen :4684
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 15) seen :2669
// Phase 1: matrix 15 rows 23 cols
[2022-05-17 20:30:18] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 20:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 20:30:18] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 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, 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-13 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-04 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-01 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 21821 ms.

BK_STOP 1652819419077

--------------------
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="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 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 r114-smll-165264477700421"
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 ;