MCC'2022- Execution of r168-tall-165277017300853

About the Execution of ITS-Tools for PolyORBNT-PT-S10J20

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16217.239	3600000.00	2732827.00	583571.80	1 1 1 1 1 1 1 1 ? 1 1 1 1 1 1 4	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.r168-tall-165277017300853.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 PolyORBNT-PT-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300853
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 21K Apr 30 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 30 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 66K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 293K Apr 30 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652969378821

Running Version 202205111006
[2022-05-19 14:09:39] [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-19 14:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:09:40] [INFO ] Load time of PNML (sax parser for PT used): 727 ms
[2022-05-19 14:09:40] [INFO ] Transformed 474 places.
[2022-05-19 14:09:40] [INFO ] Transformed 11760 transitions.
[2022-05-19 14:09:40] [INFO ] Parsed PT model containing 474 places and 11760 transitions in 942 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1641 out of 1650 initially.
// Phase 1: matrix 1641 rows 474 cols
[2022-05-19 14:09:41] [INFO ] Computed 72 place invariants in 99 ms
Incomplete random walk after 10000 steps, including 559 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
[2022-05-19 14:09:42] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-19 14:09:42] [INFO ] Computed 72 place invariants in 72 ms
[2022-05-19 14:09:42] [INFO ] [Real]Absence check using 45 positive place invariants in 37 ms returned sat
[2022-05-19 14:09:42] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2022-05-19 14:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:43] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2022-05-19 14:09:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2022-05-19 14:09:43] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2022-05-19 14:09:43] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2022-05-19 14:09:43] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:44] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2022-05-19 14:09:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:44] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:44] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:45] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2022-05-19 14:09:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:09:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2022-05-19 14:09:46] [INFO ] Deduced a trap composed of 254 places in 438 ms of which 3 ms to minimize.
[2022-05-19 14:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 602 ms
[2022-05-19 14:09:46] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 201 ms.
[2022-05-19 14:09:47] [INFO ] Added : 7 causal constraints over 2 iterations in 475 ms. Result :sat
Minimization took 290 ms.
[2022-05-19 14:09:47] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:47] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:48] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2022-05-19 14:09:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:48] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:48] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2022-05-19 14:09:48] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:48] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:09:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:48] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2022-05-19 14:09:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:49] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-19 14:09:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:49] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-05-19 14:09:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 572 ms returned sat
[2022-05-19 14:09:50] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 125 ms.
[2022-05-19 14:09:51] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 2 ms to minimize.
[2022-05-19 14:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2022-05-19 14:09:51] [INFO ] Added : 37 causal constraints over 8 iterations in 1630 ms. Result :sat
Minimization took 465 ms.
[2022-05-19 14:09:52] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:52] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned unsat
[2022-05-19 14:09:52] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2022-05-19 14:09:52] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-19 14:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:52] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-05-19 14:09:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:53] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:53] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:54] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2022-05-19 14:09:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 221 ms returned sat
[2022-05-19 14:09:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 120 ms.
[2022-05-19 14:09:56] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 1 ms to minimize.
[2022-05-19 14:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2022-05-19 14:09:56] [INFO ] Added : 24 causal constraints over 6 iterations in 1231 ms. Result :sat
Minimization took 492 ms.
[2022-05-19 14:09:57] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:09:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:57] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2022-05-19 14:09:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:09:57] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:09:57] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2022-05-19 14:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:09:58] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2022-05-19 14:09:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 110 ms returned sat
[2022-05-19 14:09:58] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 132 ms.
[2022-05-19 14:09:58] [INFO ] Added : 8 causal constraints over 2 iterations in 368 ms. Result :sat
Minimization took 286 ms.
[2022-05-19 14:09:59] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:09:59] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:00] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2022-05-19 14:10:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:00] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:03] [INFO ] [Nat]Absence check using state equation in 2622 ms returned sat
[2022-05-19 14:10:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 14:10:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2305 ms returned unknown
[2022-05-19 14:10:05] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:05] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-19 14:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:05] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-05-19 14:10:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-19 14:10:06] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-19 14:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:07] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2022-05-19 14:10:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 728 ms returned sat
[2022-05-19 14:10:07] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 133 ms.
[2022-05-19 14:10:08] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 3 ms to minimize.
[2022-05-19 14:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2022-05-19 14:10:09] [INFO ] Added : 29 causal constraints over 7 iterations in 1435 ms. Result :sat
Minimization took 698 ms.
[2022-05-19 14:10:10] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:10] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:10:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:10] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2022-05-19 14:10:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:10] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:10] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:10:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:11] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2022-05-19 14:10:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 758 ms returned sat
[2022-05-19 14:10:12] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 124 ms.
[2022-05-19 14:10:15] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2022-05-19 14:10:15] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 578 ms
[2022-05-19 14:10:16] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 1 ms to minimize.
[2022-05-19 14:10: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 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.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-19 14:10:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:16] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:17] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2022-05-19 14:10:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:17] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:10:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:18] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2022-05-19 14:10:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2022-05-19 14:10:18] [INFO ] Deduced a trap composed of 182 places in 421 ms of which 0 ms to minimize.
[2022-05-19 14:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2022-05-19 14:10:18] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 135 ms.
[2022-05-19 14:10:19] [INFO ] Added : 6 causal constraints over 2 iterations in 382 ms. Result :sat
Minimization took 311 ms.
[2022-05-19 14:10:19] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:19] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-19 14:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:20] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-05-19 14:10:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:20] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:21] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2022-05-19 14:10:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 672 ms returned sat
[2022-05-19 14:10:21] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 131 ms.
[2022-05-19 14:10:22] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2022-05-19 14:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2022-05-19 14:10:23] [INFO ] Added : 27 causal constraints over 6 iterations in 1344 ms. Result :sat
Minimization took 398 ms.
[2022-05-19 14:10:23] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:23] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned unsat
[2022-05-19 14:10:23] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-19 14:10:23] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:24] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2022-05-19 14:10:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:24] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2022-05-19 14:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:25] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2022-05-19 14:10:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2022-05-19 14:10:26] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 128 ms.
[2022-05-19 14:10:27] [INFO ] Deduced a trap composed of 20 places in 421 ms of which 0 ms to minimize.
[2022-05-19 14:10:28] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 0 ms to minimize.
[2022-05-19 14:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1913 ms
[2022-05-19 14:10:29] [INFO ] Deduced a trap composed of 11 places in 424 ms of which 0 ms to minimize.
[2022-05-19 14:10:29] [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 14
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-19 14:10:29] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-19 14:10:29] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-19 14:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:30] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2022-05-19 14:10:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:30] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:10:30] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2022-05-19 14:10:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:35] [INFO ] [Nat]Absence check using state equation in 4915 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 39, 1, 39, 1, 81, 39, 158, 1, 1, 52, 98, 1, 1, 10] Max seen :[1, 1, 0, 1, 0, 1, 0, 0, 3, 0, 0, 0, 0, 1, 0, 4]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 30 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 464 transition count 1646
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 25 rules applied. Total rules applied 39 place count 460 transition count 1625
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 439 transition count 1621
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 435 transition count 1621
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 434 transition count 1620
Applied a total of 70 rules in 271 ms. Remains 434 /474 variables (removed 40) and now considering 1620/1650 (removed 30) transitions.
[2022-05-19 14:10:36] [INFO ] Flow matrix only has 1611 transitions (discarded 9 similar events)
// Phase 1: matrix 1611 rows 434 cols
[2022-05-19 14:10:36] [INFO ] Computed 62 place invariants in 22 ms
[2022-05-19 14:10:37] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 434/474 places, 1005/1650 transitions.
Applied a total of 0 rules in 27 ms. Remains 434 /434 variables (removed 0) and now considering 1005/1005 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 434/474 places, 1005/1650 transitions.
Normalized transition count is 996 out of 1005 initially.
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 14:10:37] [INFO ] Computed 62 place invariants in 16 ms
FORMULA PolyORBNT-PT-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 70235 resets, run finished after 9156 ms. (steps per millisecond=109 ) properties (out of 7) seen :12
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9595 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9544 resets, run finished after 2051 ms. (steps per millisecond=487 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9579 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9617 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8870 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 5) seen :10
[2022-05-19 14:10:55] [INFO ] Flow matrix only has 996 transitions (discarded 9 similar events)
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 14:10:55] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:10:55] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-19 14:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:56] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-19 14:10:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:10:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:10:56] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-19 14:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:10:56] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-19 14:10:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:10:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 633 ms returned sat
[2022-05-19 14:10:57] [INFO ] Deduced a trap composed of 195 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:10:57] [INFO ] Deduced a trap composed of 192 places in 263 ms of which 0 ms to minimize.
[2022-05-19 14:10:57] [INFO ] Deduced a trap composed of 186 places in 241 ms of which 1 ms to minimize.
[2022-05-19 14:10:58] [INFO ] Deduced a trap composed of 193 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:10:58] [INFO ] Deduced a trap composed of 186 places in 269 ms of which 1 ms to minimize.
[2022-05-19 14:10:58] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:10:58] [INFO ] Deduced a trap composed of 186 places in 226 ms of which 0 ms to minimize.
[2022-05-19 14:10:59] [INFO ] Deduced a trap composed of 180 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:10:59] [INFO ] Deduced a trap composed of 182 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:10:59] [INFO ] Deduced a trap composed of 190 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:11:00] [INFO ] Deduced a trap composed of 182 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:11:00] [INFO ] Deduced a trap composed of 190 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:11:00] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 0 ms to minimize.
[2022-05-19 14:11:01] [INFO ] Deduced a trap composed of 182 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:11:01] [INFO ] Deduced a trap composed of 182 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:11:02] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 1 ms to minimize.
[2022-05-19 14:11:02] [INFO ] Deduced a trap composed of 188 places in 279 ms of which 0 ms to minimize.
[2022-05-19 14:11:02] [INFO ] Deduced a trap composed of 182 places in 244 ms of which 1 ms to minimize.
[2022-05-19 14:11:03] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:11:03] [INFO ] Deduced a trap composed of 184 places in 242 ms of which 2 ms to minimize.
[2022-05-19 14:11:04] [INFO ] Deduced a trap composed of 190 places in 221 ms of which 1 ms to minimize.
[2022-05-19 14:11:07] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 10723 ms
[2022-05-19 14:11:07] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:11:07] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2022-05-19 14:11:07] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:11:07] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-19 14:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:11:08] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-19 14:11:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:11:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-19 14:11:08] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 18 ms returned sat
[2022-05-19 14:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:11:10] [INFO ] [Nat]Absence check using state equation in 2458 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 4] Max seen :[1, 1, 3, 1, 4]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 434/434 places, 1005/1005 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 433 transition count 1004
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2 place count 433 transition count 983
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 44 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 410 transition count 981
Applied a total of 48 rules in 58 ms. Remains 410 /434 variables (removed 24) and now considering 981/1005 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/434 places, 981/1005 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:11:10] [INFO ] Computed 62 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 72678 resets, run finished after 8947 ms. (steps per millisecond=111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9682 resets, run finished after 1692 ms. (steps per millisecond=591 ) properties (out of 1) seen :3
[2022-05-19 14:11:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:11:21] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:11:21] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:11:21] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-19 14:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:11:22] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-05-19 14:11:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:11:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:11:22] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-19 14:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:11:22] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2022-05-19 14:11:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:11:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 534 ms returned sat
[2022-05-19 14:11:23] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:11:23] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 3 ms to minimize.
[2022-05-19 14:11:24] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:11:24] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:11:24] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:11:24] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:11:25] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 1 ms to minimize.
[2022-05-19 14:11:25] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 1 ms to minimize.
[2022-05-19 14:11:25] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:11:26] [INFO ] Deduced a trap composed of 134 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:11:26] [INFO ] Deduced a trap composed of 154 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:11:26] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 0 ms to minimize.
[2022-05-19 14:11:26] [INFO ] Deduced a trap composed of 146 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:11:27] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:11:27] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:11:27] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:11:28] [INFO ] Deduced a trap composed of 173 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:11:28] [INFO ] Deduced a trap composed of 169 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:11:28] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:11:29] [INFO ] Deduced a trap composed of 168 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:11:29] [INFO ] Deduced a trap composed of 173 places in 244 ms of which 1 ms to minimize.
[2022-05-19 14:11:29] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:11:29] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:11:30] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:11:31] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 0 ms to minimize.
[2022-05-19 14:11:31] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:11:31] [INFO ] Deduced a trap composed of 173 places in 250 ms of which 1 ms to minimize.
[2022-05-19 14:11:32] [INFO ] Deduced a trap composed of 161 places in 245 ms of which 0 ms to minimize.
[2022-05-19 14:11:32] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:11:32] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2022-05-19 14:11:33] [INFO ] Deduced a trap composed of 174 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:11:33] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2022-05-19 14:11:33] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:11:34] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 0 ms to minimize.
[2022-05-19 14:11:34] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 3 ms to minimize.
[2022-05-19 14:11:35] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:11:35] [INFO ] Deduced a trap composed of 177 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:11:35] [INFO ] Deduced a trap composed of 169 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:11:36] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:11:36] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:11:36] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 1 ms to minimize.
[2022-05-19 14:11:37] [INFO ] Deduced a trap composed of 173 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:11:37] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:11:38] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 2 ms to minimize.
[2022-05-19 14:11:38] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:11:39] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:11:39] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:11:39] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:11:40] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:11:40] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:11:40] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:11:40] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:11:41] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:11:41] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:11:41] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:11:42] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:11:42] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:11:42] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:11:43] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:11:43] [INFO ] Deduced a trap composed of 171 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:11:43] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:11:43] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:11:44] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:11:44] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:11:45] [INFO ] Deduced a trap composed of 177 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:11:45] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:11:45] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:11:46] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:11:46] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:11:46] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:11:46] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:11:47] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:11:47] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-19 14:11:47] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:11:48] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2022-05-19 14:11:48] [INFO ] Deduced a trap composed of 154 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:11:48] [INFO ] Deduced a trap composed of 174 places in 222 ms of which 0 ms to minimize.
[2022-05-19 14:11:49] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2022-05-19 14:11:49] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 0 ms to minimize.
[2022-05-19 14:11:50] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:11:50] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:11:50] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2022-05-19 14:11:51] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:11:52] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 1 ms to minimize.
[2022-05-19 14:11:52] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 0 ms to minimize.
[2022-05-19 14:11:53] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 0 ms to minimize.
[2022-05-19 14:11:53] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2022-05-19 14:11:53] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2022-05-19 14:11:54] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 1 ms to minimize.
[2022-05-19 14:11:54] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2022-05-19 14:11:54] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:11:55] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2022-05-19 14:11:55] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:11:55] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:11:56] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:11:57] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2022-05-19 14:11:57] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:11:58] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:11:58] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:11:59] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:11:59] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 1 ms to minimize.
[2022-05-19 14:12:00] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:12:01] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:12:01] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:12:01] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 1 ms to minimize.
[2022-05-19 14:12:03] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:12:04] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:12:05] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:05] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 0 ms to minimize.
[2022-05-19 14:12:06] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 1 ms to minimize.
[2022-05-19 14:12:07] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:12:07] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 43818 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 14:12:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:07] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:12:07] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-19 14:12:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:07] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:12:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:12:10] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
[2022-05-19 14:12:10] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-19 14:12:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:10] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:12:10] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-08
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:10] [INFO ] Computed 62 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 717 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2022-05-19 14:12:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:11] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 14:12:11] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:12:11] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-19 14:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:12:11] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-05-19 14:12:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:12:11] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:12:11] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-19 14:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:12:12] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2022-05-19 14:12:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:12:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 509 ms returned sat
[2022-05-19 14:12:13] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 0 ms to minimize.
[2022-05-19 14:12:13] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 1 ms to minimize.
[2022-05-19 14:12:13] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:12:13] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 0 ms to minimize.
[2022-05-19 14:12:14] [INFO ] Deduced a trap composed of 171 places in 252 ms of which 0 ms to minimize.
[2022-05-19 14:12:14] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:12:14] [INFO ] Deduced a trap composed of 174 places in 250 ms of which 1 ms to minimize.
[2022-05-19 14:12:15] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 0 ms to minimize.
[2022-05-19 14:12:15] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 1 ms to minimize.
[2022-05-19 14:12:15] [INFO ] Deduced a trap composed of 134 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:12:15] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:12:16] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:12:16] [INFO ] Deduced a trap composed of 146 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:12:16] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 1 ms to minimize.
[2022-05-19 14:12: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 0
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:657)
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)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 34 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 14:12:17] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:17] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:12:17] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:17] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 72911 resets, run finished after 8922 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9636 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties (out of 1) seen :3
[2022-05-19 14:12:28] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:12:28] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:12:28] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-19 14:12:28] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-19 14:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:12:28] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-05-19 14:12:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:12:28] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-19 14:12:28] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-19 14:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:12:29] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-05-19 14:12:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:12:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 531 ms returned sat
[2022-05-19 14:12:30] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:12:30] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:12:30] [INFO ] Deduced a trap composed of 175 places in 247 ms of which 0 ms to minimize.
[2022-05-19 14:12:30] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:12:31] [INFO ] Deduced a trap composed of 171 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:12:31] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:12:31] [INFO ] Deduced a trap composed of 174 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:12:32] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2022-05-19 14:12:32] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2022-05-19 14:12:32] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 0 ms to minimize.
[2022-05-19 14:12:32] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:12:33] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:12:33] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:12:33] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:12:34] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:34] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2022-05-19 14:12:34] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 1 ms to minimize.
[2022-05-19 14:12:34] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 0 ms to minimize.
[2022-05-19 14:12:35] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:12:35] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:12:35] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:12:36] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2022-05-19 14:12:36] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2022-05-19 14:12:36] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 0 ms to minimize.
[2022-05-19 14:12:37] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 0 ms to minimize.
[2022-05-19 14:12:37] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 1 ms to minimize.
[2022-05-19 14:12:37] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 1 ms to minimize.
[2022-05-19 14:12:38] [INFO ] Deduced a trap composed of 161 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:12:38] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:12:39] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:12:39] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 1 ms to minimize.
[2022-05-19 14:12:39] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-19 14:12:39] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:12:40] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2022-05-19 14:12:40] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 1 ms to minimize.
[2022-05-19 14:12:41] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2022-05-19 14:12:41] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:12:42] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:12:42] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:42] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:42] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 1 ms to minimize.
[2022-05-19 14:12:43] [INFO ] Deduced a trap composed of 173 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:12:43] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:12:44] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:44] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:12:45] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-19 14:12:45] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:12:45] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:12:46] [INFO ] Deduced a trap composed of 173 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:12:46] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:12:46] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:12:46] [INFO ] Deduced a trap composed of 160 places in 271 ms of which 1 ms to minimize.
[2022-05-19 14:12:47] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2022-05-19 14:12:47] [INFO ] Deduced a trap composed of 169 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:12:47] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:12:48] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:12:48] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:12:48] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:12:49] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:12:49] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:12:49] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:12:50] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:12:50] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:12:50] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:12:51] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:12:51] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2022-05-19 14:12:51] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 1 ms to minimize.
[2022-05-19 14:12:52] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:12:52] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:12:52] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:12:52] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:12:53] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:12:53] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:12:53] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2022-05-19 14:12:54] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:12:54] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 1 ms to minimize.
[2022-05-19 14:12:54] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:12:55] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:12:55] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:12:56] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:12:56] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:12:56] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 0 ms to minimize.
[2022-05-19 14:12:57] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 0 ms to minimize.
[2022-05-19 14:12:58] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 1 ms to minimize.
[2022-05-19 14:12:58] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 0 ms to minimize.
[2022-05-19 14:12:59] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 0 ms to minimize.
[2022-05-19 14:12:59] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2022-05-19 14:12:59] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:13:00] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 0 ms to minimize.
[2022-05-19 14:13:00] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:13:00] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:13:01] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:13:01] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2022-05-19 14:13:01] [INFO ] Deduced a trap composed of 169 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:13:02] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2022-05-19 14:13:03] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:13:03] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:13:04] [INFO ] Deduced a trap composed of 172 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:13:04] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 2 ms to minimize.
[2022-05-19 14:13:05] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:13:05] [INFO ] Deduced a trap composed of 169 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:13:06] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2022-05-19 14:13:07] [INFO ] Deduced a trap composed of 177 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:13:07] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 1 ms to minimize.
[2022-05-19 14:13:07] [INFO ] Deduced a trap composed of 169 places in 214 ms of which 1 ms to minimize.
[2022-05-19 14:13:10] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:13:11] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:13:11] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:13:11] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:13:12] [INFO ] Deduced a trap composed of 175 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:13:13] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:13:13] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 0 ms to minimize.
[2022-05-19 14:13:13] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:13:13] [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 0
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:657)
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)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 14:13:13] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:13:13] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:13:14] [INFO ] Implicit Places using invariants in 458 ms returned []
[2022-05-19 14:13:14] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:13:14] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:13:18] [INFO ] Implicit Places using invariants and state equation in 4161 ms returned []
Implicit Place search using SMT with State Equation took 4620 ms to find 0 implicit places.
[2022-05-19 14:13:18] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-19 14:13:18] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:13:18] [INFO ] Computed 62 place invariants in 23 ms
[2022-05-19 14:13:19] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-08 in 68112 ms.
[2022-05-19 14:13:19] [INFO ] Flatten gal took : 164 ms
[2022-05-19 14:13:19] [INFO ] Applying decomposition
[2022-05-19 14:13:19] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4148812055163577582.txt' '-o' '/tmp/graph4148812055163577582.bin' '-w' '/tmp/graph4148812055163577582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4148812055163577582.bin' '-l' '-1' '-v' '-w' '/tmp/graph4148812055163577582.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:13:19] [INFO ] Decomposing Gal with order
[2022-05-19 14:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:13:20] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-19 14:13:20] [INFO ] Flatten gal took : 253 ms
[2022-05-19 14:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 48 ms.
[2022-05-19 14:13:20] [INFO ] Time to serialize gal into /tmp/UpperBounds10037339489208187380.gal : 19 ms
[2022-05-19 14:13:20] [INFO ] Time to serialize properties into /tmp/UpperBounds16495671448966506297.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10037339489208187380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16495671448966506297.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds16495671448966506297.prop.
Detected timeout of ITS tools.
[2022-05-19 14:34:55] [INFO ] Flatten gal took : 542 ms
[2022-05-19 14:34:55] [INFO ] Time to serialize gal into /tmp/UpperBounds10144037052865007334.gal : 49 ms
[2022-05-19 14:34:55] [INFO ] Time to serialize properties into /tmp/UpperBounds839619173772770431.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10144037052865007334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds839619173772770431.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds839619173772770431.prop.
Detected timeout of ITS tools.
[2022-05-19 14:57:22] [INFO ] Flatten gal took : 1236 ms
[2022-05-19 14:57:24] [INFO ] Input system was already deterministic with 981 transitions.
[2022-05-19 14:57:24] [INFO ] Transformed 410 places.
[2022-05-19 14:57:24] [INFO ] Transformed 981 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 14:57:55] [INFO ] Time to serialize gal into /tmp/UpperBounds13884287236474681708.gal : 7 ms
[2022-05-19 14:57:55] [INFO ] Time to serialize properties into /tmp/UpperBounds7183572301428322607.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13884287236474681708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7183572301428322607.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7183572301428322607.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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 r168-tall-165277017300853"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;