fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for HouseConstruction-PT-16000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
591.247 190561.00 200388.00 960.20 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 16000 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.r201-smll-167840348000613.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 ltsminxred
Input is HouseConstruction-PT-16000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840348000613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 24K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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-16000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-16000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678848285685

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-16000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 02:44:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 02:44:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:44:48] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-15 02:44:48] [INFO ] Transformed 26 places.
[2023-03-15 02:44:48] [INFO ] Transformed 18 transitions.
[2023-03-15 02:44:48] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-15 02:44:48] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 16001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 16) seen :1
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 :209
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 :171
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 :141
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :139
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 :125
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 :132
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 :235
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :253
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :152
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 :196
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 :718
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 :133
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :1112
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :144
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 :245
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :134
[2023-03-15 02:44:48] [INFO ] Invariant cache hit.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 02:44:49] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:49] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 02:44:49] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 02:44:49] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 02:44:49] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 02:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:49] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:49] [INFO ] Added : 13 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 02:44:50] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 02:44:50] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 02:44:50] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 02:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 02:44:50] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:44:51] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 02:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:44:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 02:44:51] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 02:44:51] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[62, 28, 50, 20, 19, 19, 62, 155, 14, 155, 165, 20, 1112, 165, 44, 25]
Support contains 16 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 25 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 24 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 23 transition count 17
Applied a total of 4 rules in 26 ms. Remains 23 /26 variables (removed 3) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 23/26 places, 17/18 transitions.
// Phase 1: matrix 17 rows 23 cols
[2023-03-15 02:47:46] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1008068 steps, including 3 resets, run finished after 206 ms. (steps per millisecond=4893 ) properties (out of 16) seen :256000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 16) seen :13034
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 16) seen :8353
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 16) seen :4540
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 16) seen :5195
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 16) seen :4522
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 16) seen :4819
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 16) seen :14773
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 16) seen :15692
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 16) seen :5254
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 16) seen :13024
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 16) seen :64345
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 16) seen :4599
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 16) seen :16015
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 16) seen :5694
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 16) seen :13219
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 16) seen :5271
[2023-03-15 02:47:54] [INFO ] Invariant cache hit.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:54] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:47:55] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000] Max seen :[16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000, 16000]
FORMULA HouseConstruction-PT-16000-UpperBounds-15 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-14 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-13 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-12 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-11 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-10 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-09 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-08 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-07 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-06 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-05 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-04 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-03 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-02 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-01 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-16000-UpperBounds-00 16000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 186842 ms.
ITS solved all properties within timeout

BK_STOP 1678848476246

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-16000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HouseConstruction-PT-16000, 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 r201-smll-167840348000613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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