About the Execution of ITS-Tools for BusinessProcesses-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 357.888 | 67336.00 | 89589.00 | 612.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 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.r024-tall-165251918500421.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 BusinessProcesses-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500421
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 148K May 10 09:33 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 BusinessProcesses-PT-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652631447663
Running Version 202205111006
[2022-05-15 16:17:28] [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-15 16:17:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:17:29] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-15 16:17:29] [INFO ] Transformed 593 places.
[2022-05-15 16:17:29] [INFO ] Transformed 536 transitions.
[2022-05-15 16:17:29] [INFO ] Found NUPN structural information;
[2022-05-15 16:17:29] [INFO ] Parsed PT model containing 593 places and 536 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 528 rows 585 cols
[2022-05-15 16:17:29] [INFO ] Computed 95 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 70 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
// Phase 1: matrix 528 rows 585 cols
[2022-05-15 16:17:29] [INFO ] Computed 95 place invariants in 15 ms
[2022-05-15 16:17:29] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-05-15 16:17:29] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-05-15 16:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:29] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-15 16:17:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-05-15 16:17:29] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-15 16:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:30] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2022-05-15 16:17:30] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 6 ms to minimize.
[2022-05-15 16:17:30] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2022-05-15 16:17:30] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2022-05-15 16:17:30] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2022-05-15 16:17:30] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2022-05-15 16:17:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1389 ms
[2022-05-15 16:17:31] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 34 ms.
[2022-05-15 16:17:34] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:17:34] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2022-05-15 16:17:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:17:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2022-05-15 16:17:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 440 ms
[2022-05-15 16:17:34] [INFO ] Added : 309 causal constraints over 63 iterations in 2936 ms. Result :sat
Minimization took 122 ms.
[2022-05-15 16:17:34] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-05-15 16:17:34] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-15 16:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:34] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-15 16:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-15 16:17:35] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-15 16:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:35] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-05-15 16:17:35] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2022-05-15 16:17:35] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2022-05-15 16:17:36] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2022-05-15 16:17:42] [INFO ] Deduced a trap composed of 12 places in 6487 ms of which 48 ms to minimize.
[2022-05-15 16:17:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:17:42] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:17:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:42] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-05-15 16:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-05-15 16:17:42] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:43] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-15 16:17:43] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-05-15 16:17:43] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-05-15 16:17:43] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2022-05-15 16:17:43] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2022-05-15 16:17:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2022-05-15 16:17:45] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2022-05-15 16:17:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1890 ms
[2022-05-15 16:17:45] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 32 ms.
[2022-05-15 16:17:46] [INFO ] Added : 226 causal constraints over 46 iterations in 1610 ms. Result :sat
Minimization took 77 ms.
[2022-05-15 16:17:46] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:17:46] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-15 16:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:47] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-15 16:17:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:47] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-15 16:17:47] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-15 16:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:47] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-15 16:17:47] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:17:47] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2022-05-15 16:17:47] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:17:47] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 1 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 4 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:17:48] [INFO ] Deduced a trap composed of 151 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 0 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:17:49] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 152 places in 161 ms of which 0 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 0 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:17:50] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 0 ms to minimize.
[2022-05-15 16:17:51] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 0 ms to minimize.
[2022-05-15 16:17:51] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2022-05-15 16:17:51] [INFO ] Deduced a trap composed of 134 places in 243 ms of which 1 ms to minimize.
[2022-05-15 16:17:51] [INFO ] Deduced a trap composed of 139 places in 223 ms of which 8 ms to minimize.
[2022-05-15 16:17:51] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 0 ms to minimize.
[2022-05-15 16:17:52] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2022-05-15 16:17:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:17:52] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:17:52] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:52] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-05-15 16:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:52] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:17:52] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-15 16:17:52] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:17:53] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:17:57] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:17:57] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:57] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-15 16:17:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:17:58] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:17:58] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:17:58] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 728 ms
[2022-05-15 16:17:59] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 26 ms.
[2022-05-15 16:18:00] [INFO ] Added : 220 causal constraints over 45 iterations in 1349 ms. Result :sat
Minimization took 72 ms.
[2022-05-15 16:18:00] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-15 16:18:00] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:00] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-15 16:18:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:18:00] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-05-15 16:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:01] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2022-05-15 16:18:01] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 142 places in 106 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-15 16:18:02] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 0 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 1 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-15 16:18:03] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2022-05-15 16:18:04] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2022-05-15 16:18:04] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2022-05-15 16:18:04] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2022-05-15 16:18:04] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2022-05-15 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3247 ms
[2022-05-15 16:18:04] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 27 ms.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:18:06] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-15 16:18:06] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:06] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-15 16:18:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:06] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:18:06] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 14 ms returned sat
[2022-05-15 16:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:06] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 0 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 1 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2022-05-15 16:18:10] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:18:11] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 1 ms to minimize.
[2022-05-15 16:18:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-05-15 16:18:11] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-05-15 16:18:11] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2022-05-15 16:18:11] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:18:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:18:11] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:11] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-15 16:18:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:11] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 1 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 5 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 149 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 1 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 1 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 144 places in 116 ms of which 0 ms to minimize.
[2022-05-15 16:18:16] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 0 ms to minimize.
[2022-05-15 16:18:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:18:16] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:18:16] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:17] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-15 16:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:18:17] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-15 16:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:17] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-05-15 16:18:17] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2022-05-15 16:18:17] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:18:17] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:18:17] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-05-15 16:18:18] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:18:19] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-15 16:18:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1748 ms
[2022-05-15 16:18:19] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 32 ms.
[2022-05-15 16:18:20] [INFO ] Added : 220 causal constraints over 45 iterations in 1507 ms. Result :sat
Minimization took 89 ms.
[2022-05-15 16:18:20] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:18:20] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-15 16:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:21] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-05-15 16:18:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:21] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-15 16:18:21] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:21] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2022-05-15 16:18:25] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:18:26] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:18:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:18:26] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-15 16:18:26] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-15 16:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:26] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-15 16:18:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-15 16:18:26] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-15 16:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:26] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-15 16:18:26] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-15 16:18:27] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2022-05-15 16:18:28] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-15 16:18:28] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:18:28] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2022-05-15 16:18:28] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:18:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1559 ms
[2022-05-15 16:18:28] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 26 ms.
[2022-05-15 16:18:29] [INFO ] Added : 218 causal constraints over 44 iterations in 1488 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 331 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 573 transition count 391
Reduce places removed 128 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 445 transition count 389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 262 place count 443 transition count 302
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 453 place count 339 transition count 302
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 527 place count 265 transition count 228
Iterating global reduction 3 with 74 rules applied. Total rules applied 601 place count 265 transition count 228
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 601 place count 265 transition count 221
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 617 place count 256 transition count 221
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 799 place count 164 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 801 place count 163 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 163 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 805 place count 161 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 806 place count 161 transition count 133
Applied a total of 806 rules in 147 ms. Remains 161 /585 variables (removed 424) and now considering 133/528 (removed 395) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/585 places, 133/528 transitions.
// Phase 1: matrix 133 rows 161 cols
[2022-05-15 16:18:30] [INFO ] Computed 69 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 43762 resets, run finished after 2558 ms. (steps per millisecond=390 ) properties (out of 5) seen :4
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 26168 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties (out of 1) seen :0
// Phase 1: matrix 133 rows 161 cols
[2022-05-15 16:18:34] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-15 16:18:34] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-15 16:18:34] [INFO ] [Real]Absence check using 52 positive and 17 generalized place invariants in 7 ms returned sat
[2022-05-15 16:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-15 16:18:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:18:34] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2022-05-15 16:18:34] [INFO ] [Nat]Absence check using 52 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-15 16:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:18:34] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-15 16:18:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 16:18:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-15 16:18:34] [INFO ] Computed and/alt/rep : 85/397/85 causal constraints (skipped 46 transitions) in 9 ms.
[2022-05-15 16:18:34] [INFO ] Added : 22 causal constraints over 5 iterations in 72 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 66129 ms.
BK_STOP 1652631514999
--------------------
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="BusinessProcesses-PT-13"
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 BusinessProcesses-PT-13, 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 r024-tall-165251918500421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 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 '
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 ;