Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 09:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 92K May 5 16:51 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-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621215841864

Running Version 0
[2021-05-17 01:44:04] [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]
[2021-05-17 01:44:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:44:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 01:44:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 01:44:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 610 ms
[2021-05-17 01:44:05] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 01:44:05] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 01:44:05] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 01:44:05] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 01:44:05] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 01:44:05] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 01:44:05] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-17 01:44:05] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2021-05-17 01:44:05] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_5123277376700269360.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:44:05] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 01:44:05] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 38 ms.
[2021-05-17 01:44:05] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:44:05] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 01:44:05] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-17 01:44:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:05] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-17 01:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 01:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 8 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-17 01:44:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-17 01:44:06] [INFO ] Added : 36 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 10 ms.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 01:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:44:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:44:06] [INFO ] Added : 36 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 01:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 18 places in 14 ms of which 0 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 95 ms
[2021-05-17 01:44:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 01:44:06] [INFO ] Added : 33 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 01:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:06] [INFO ] Deduced a trap composed of 13 places in 11 ms of which 0 ms to minimize.
[2021-05-17 01:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-17 01:44:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:44:07] [INFO ] Added : 33 causal constraints over 7 iterations in 142 ms. Result :sat
Minimization took 94 ms.
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-17 01:44:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:44:07] [INFO ] Added : 13 causal constraints over 4 iterations in 235 ms. Result :sat
Minimization took 94 ms.
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 27 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:07] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-17 01:44:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:07] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 01:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:44:07] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2021-05-17 01:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-17 01:44:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 01:44:08] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2021-05-17 01:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-17 01:44:08] [INFO ] Added : 36 causal constraints over 8 iterations in 174 ms. Result :sat
Minimization took 15 ms.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 01:44:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2021-05-17 01:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-17 01:44:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:44:08] [INFO ] Added : 18 causal constraints over 4 iterations in 168 ms. Result :sat
Minimization took 177 ms.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:44:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:44:08] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-17 01:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-17 01:44:08] [INFO ] Added : 36 causal constraints over 8 iterations in 159 ms. Result :sat
Minimization took 10 ms.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 01:44:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2021-05-17 01:44:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:09] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2021-05-17 01:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2021-05-17 01:44:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:44:09] [INFO ] Added : 21 causal constraints over 5 iterations in 199 ms. Result :sat
Minimization took 138 ms.
[2021-05-17 01:44:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:44:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 01:44:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:09] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2021-05-17 01:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2021-05-17 01:44:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 01:44:09] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 129 ms.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:44:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2021-05-17 01:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2021-05-17 01:44:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:44:10] [INFO ] Added : 17 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 138 ms.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-17 01:44:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:44:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2021-05-17 01:44:10] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2021-05-17 01:44:10] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 1 ms to minimize.
[2021-05-17 01:44:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2021-05-17 01:44:10] [INFO ] Added : 36 causal constraints over 8 iterations in 193 ms. Result :sat
Minimization took 10 ms.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 01:44:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:44:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-17 01:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-17 01:44:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 40 ms.
[2021-05-17 01:44:11] [INFO ] Added : 15 causal constraints over 4 iterations in 85 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 10, -1, 10, -1, 10, 10, 10, 1, 10, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 01:44:11] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 14 ms.
[2021-05-17 01:44:11] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_10351793384480499315.dot
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 13) seen :3
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :1
[2021-05-17 01:44:11] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2021-05-17 01:44:11] [INFO ] Computed 72 place invariants in 112 ms
[2021-05-17 01:44:11] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2021-05-17 01:44:11] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:12] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-17 01:44:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2021-05-17 01:44:12] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:12] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-17 01:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:44:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 80 ms returned sat
[2021-05-17 01:44:13] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 234 ms.
[2021-05-17 01:44:14] [INFO ] Deduced a trap composed of 20 places in 583 ms of which 1 ms to minimize.
[2021-05-17 01:44:15] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 0 ms to minimize.
[2021-05-17 01:44:15] [INFO ] Deduced a trap composed of 70 places in 625 ms of which 0 ms to minimize.
[2021-05-17 01:44:16] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 1 ms to minimize.
[2021-05-17 01:44:16] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 0 ms to minimize.
[2021-05-17 01:44:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2996 ms
[2021-05-17 01:44:17] [INFO ] Added : 39 causal constraints over 9 iterations in 4136 ms. Result :unknown
[2021-05-17 01:44:17] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2021-05-17 01:44:17] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 21 ms returned unsat
[2021-05-17 01:44:17] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2021-05-17 01:44:17] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:17] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2021-05-17 01:44:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 444 ms returned sat
[2021-05-17 01:44:18] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 01:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:19] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2021-05-17 01:44:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 226 ms returned sat
[2021-05-17 01:44:19] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 186 ms.
[2021-05-17 01:44:20] [INFO ] Added : 36 causal constraints over 8 iterations in 1204 ms. Result :sat
Minimization took 731 ms.
[2021-05-17 01:44:21] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2021-05-17 01:44:21] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 01:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:21] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-17 01:44:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2021-05-17 01:44:22] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 01:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:26] [INFO ] [Nat]Absence check using state equation in 4929 ms returned unknown
[2021-05-17 01:44:27] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2021-05-17 01:44:27] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:27] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2021-05-17 01:44:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 34 ms returned sat
[2021-05-17 01:44:27] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 01:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:28] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2021-05-17 01:44:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2021-05-17 01:44:28] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 130 ms.
[2021-05-17 01:44:33] [INFO ] Deduced a trap composed of 20 places in 3274 ms of which 0 ms to minimize.
[2021-05-17 01:44:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 01:44:33] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2021-05-17 01:44:33] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 01:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:33] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-17 01:44:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2021-05-17 01:44:33] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:37] [INFO ] [Nat]Absence check using state equation in 3510 ms returned sat
[2021-05-17 01:44:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2021-05-17 01:44:37] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 176 ms.
[2021-05-17 01:44:37] [INFO ] Added : 14 causal constraints over 3 iterations in 506 ms. Result :sat
Minimization took 815 ms.
[2021-05-17 01:44:38] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2021-05-17 01:44:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 01:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:39] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2021-05-17 01:44:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2021-05-17 01:44:39] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 01:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:40] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2021-05-17 01:44:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2021-05-17 01:44:40] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 179 ms.
[2021-05-17 01:44:41] [INFO ] Deduced a trap composed of 24 places in 385 ms of which 1 ms to minimize.
[2021-05-17 01:44:42] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 0 ms to minimize.
[2021-05-17 01:44:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1405 ms
[2021-05-17 01:44:42] [INFO ] Added : 41 causal constraints over 9 iterations in 2496 ms. Result :sat
Minimization took 447 ms.
[2021-05-17 01:44:43] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2021-05-17 01:44:43] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 01:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:43] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2021-05-17 01:44:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2021-05-17 01:44:43] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 01:44:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:48] [INFO ] [Nat]Absence check using state equation in 4949 ms returned unknown
[2021-05-17 01:44:48] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2021-05-17 01:44:48] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:49] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-17 01:44:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2021-05-17 01:44:49] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 43 ms returned sat
[2021-05-17 01:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:50] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2021-05-17 01:44:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2021-05-17 01:44:50] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 158 ms.
[2021-05-17 01:44:51] [INFO ] Added : 7 causal constraints over 2 iterations in 462 ms. Result :sat
Minimization took 616 ms.
[2021-05-17 01:44:52] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2021-05-17 01:44:52] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:52] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2021-05-17 01:44:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-17 01:44:52] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 23 ms returned sat
[2021-05-17 01:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:53] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2021-05-17 01:44:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2021-05-17 01:44:54] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 230 ms.
[2021-05-17 01:44:54] [INFO ] Added : 7 causal constraints over 2 iterations in 562 ms. Result :sat
Minimization took 623 ms.
[2021-05-17 01:44:55] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-17 01:44:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 01:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:55] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2021-05-17 01:44:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:44:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-17 01:44:56] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 21 ms returned sat
[2021-05-17 01:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:44:56] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2021-05-17 01:44:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2021-05-17 01:44:57] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 183 ms.
[2021-05-17 01:44:57] [INFO ] Added : 7 causal constraints over 2 iterations in 435 ms. Result :sat
Minimization took 448 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 10, 2147483647, 10, 2147483647, 10, 10, 10, 1] Max seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=155 ) properties (out of 10) seen :6 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4200 steps, including 230 resets, run finished after 45 ms. (steps per millisecond=93 ) properties (out of 9) seen :16 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4200 steps, including 232 resets, run finished after 47 ms. (steps per millisecond=89 ) properties (out of 8) seen :14 could not realise parikh vector
Incomplete Parikh walk after 17900 steps, including 1086 resets, run finished after 181 ms. (steps per millisecond=98 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14600 steps, including 641 resets, run finished after 125 ms. (steps per millisecond=116 ) properties (out of 8) seen :8 could not realise parikh vector
Incomplete Parikh walk after 15500 steps, including 1550 resets, run finished after 115 ms. (steps per millisecond=134 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 75 out of 474 places. Attempting structural reductions.
Starting structural reductions, 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 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 26 rules applied. Total rules applied 40 place count 460 transition count 1624
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 438 transition count 1621
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 435 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 434 transition count 1620
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 434 transition count 1620
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 432 transition count 1618
Applied a total of 74 rules in 208 ms. Remains 432 /474 variables (removed 42) and now considering 1618/1650 (removed 32) transitions.
[2021-05-17 01:44:58] [INFO ] Flow matrix only has 1609 transitions (discarded 9 similar events)
// Phase 1: matrix 1609 rows 432 cols
[2021-05-17 01:44:58] [INFO ] Computed 62 place invariants in 58 ms
[2021-05-17 01:44:59] [INFO ] Dead Transitions using invariants and state equation in 1120 ms returned [392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 433, 434, 435, 436, 437, 439, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 468, 469, 470, 471, 472, 474, 477, 478, 479, 480, 481, 482, 484, 487, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 524, 525, 526, 527, 528, 530, 533, 534, 535, 536, 537, 538, 540, 543, 547, 548, 549, 550, 551, 552, 553, 555, 558, 562, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 608, 609, 610, 611, 612, 614, 617, 618, 619, 620, 621, 622, 624, 627, 631, 632, 633, 634, 635, 636, 637, 639, 642, 646, 651, 652, 653, 654, 655, 656, 657, 658, 660, 663, 667, 672, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 728, 729, 730, 731, 732, 734, 737, 738, 739, 740, 741, 742, 744, 747, 751, 752, 753, 754, 755, 756, 757, 759, 762, 766, 771, 772, 773, 774, 775, 776, 777, 778, 780, 783, 787, 792, 798, 799, 800, 801, 802, 803, 804, 805, 806, 808, 811, 815, 820, 826, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 893, 894, 895, 896, 897, 899, 902, 903, 904, 905, 906, 907, 909, 912, 916, 917, 918, 919, 920, 921, 922, 924, 927, 931, 936, 937, 938, 939, 940, 941, 942, 943, 945, 948, 952, 957, 963, 964, 965, 966, 967, 968, 969, 970, 971, 973, 976, 980, 985, 991, 998, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1009, 1012, 1016, 1021, 1027, 1034, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1113, 1114, 1115, 1116, 1117, 1119, 1122, 1123, 1124, 1125, 1126, 1127, 1129, 1132, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1144, 1147, 1151, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1165, 1168, 1172, 1177, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1193, 1196, 1200, 1205, 1211, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1229, 1232, 1236, 1241, 1247, 1254, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1274, 1277, 1281, 1286, 1292, 1299, 1307, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1329, 1332, 1336, 1341, 1347, 1354, 1362, 1371, 1381]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[1381, 1371, 1362, 1354, 1347, 1341, 1336, 1332, 1329, 1327, 1326, 1325, 1324, 1323, 1322, 1321, 1320, 1319, 1318, 1317, 1316, 1307, 1299, 1292, 1286, 1281, 1277, 1274, 1272, 1271, 1270, 1269, 1268, 1267, 1266, 1265, 1264, 1263, 1262, 1254, 1247, 1241, 1236, 1232, 1229, 1227, 1226, 1225, 1224, 1223, 1222, 1221, 1220, 1219, 1218, 1211, 1205, 1200, 1196, 1193, 1191, 1190, 1189, 1188, 1187, 1186, 1185, 1184, 1183, 1177, 1172, 1168, 1165, 1163, 1162, 1161, 1160, 1159, 1158, 1157, 1156, 1151, 1147, 1144, 1142, 1141, 1140, 1139, 1138, 1137, 1136, 1132, 1129, 1127, 1126, 1125, 1124, 1123, 1122, 1119, 1117, 1116, 1115, 1114, 1113, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1102, 1101, 1100, 1099, 1098, 1097, 1096, 1095, 1094, 1093, 1092, 1091, 1090, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1082, 1081, 1080, 1079, 1078, 1077, 1076, 1075, 1074, 1073, 1072, 1071, 1070, 1069, 1068, 1067, 1066, 1065, 1064, 1063, 1062, 1061, 1060, 1059, 1058, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1047, 1046, 1045, 1044, 1043, 1042, 1034, 1027, 1021, 1016, 1012, 1009, 1007, 1006, 1005, 1004, 1003, 1002, 1001, 1000, 999, 998, 991, 985, 980, 976, 973, 971, 970, 969, 968, 967, 966, 965, 964, 963, 957, 952, 948, 945, 943, 942, 941, 940, 939, 938, 937, 936, 931, 927, 924, 922, 921, 920, 919, 918, 917, 916, 912, 909, 907, 906, 905, 904, 903, 902, 899, 897, 896, 895, 894, 893, 891, 890, 889, 888, 887, 886, 885, 884, 883, 882, 881, 880, 879, 878, 877, 876, 875, 874, 873, 872, 871, 870, 869, 868, 867, 866, 865, 864, 863, 862, 861, 860, 859, 858, 857, 856, 855, 854, 853, 852, 851, 850, 849, 848, 847, 846, 845, 844, 843, 842, 841, 840, 839, 838, 837, 836, 835, 834, 833, 826, 820, 815, 811, 808, 806, 805, 804, 803, 802, 801, 800, 799, 798, 792, 787, 783, 780, 778, 777, 776, 775, 774, 773, 772, 771, 766, 762, 759, 757, 756, 755, 754, 753, 752, 751, 747, 744, 742, 741, 740, 739, 738, 737, 734, 732, 731, 730, 729, 728, 726, 725, 724, 723, 722, 721, 720, 719, 718, 717, 716, 715, 714, 713, 712, 711, 710, 709, 708, 707, 706, 705, 704, 703, 702, 701, 700, 699, 698, 697, 696, 695, 694, 693, 692, 691, 690, 689, 688, 687, 686, 685, 684, 683, 682, 681, 680, 679, 678, 672, 667, 663, 660, 658, 657, 656, 655, 654, 653, 652, 651, 646, 642, 639, 637, 636, 635, 634, 633, 632, 631, 627, 624, 622, 621, 620, 619, 618, 617, 614, 612, 611, 610, 609, 608, 606, 605, 604, 603, 602, 601, 600, 599, 598, 597, 596, 595, 594, 593, 592, 591, 590, 589, 588, 587, 586, 585, 584, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 571, 570, 569, 568, 567, 562, 558, 555, 553, 552, 551, 550, 549, 548, 547, 543, 540, 538, 537, 536, 535, 534, 533, 530, 528, 527, 526, 525, 524, 522, 521, 520, 519, 518, 517, 516, 515, 514, 513, 512, 511, 510, 509, 508, 507, 506, 505, 504, 503, 502, 501, 500, 499, 498, 497, 496, 495, 494, 493, 492, 491, 487, 484, 482, 481, 480, 479, 478, 477, 474, 472, 471, 470, 469, 468, 466, 465, 464, 463, 462, 461, 460, 459, 458, 457, 456, 455, 454, 453, 452, 451, 450, 449, 448, 447, 446, 445, 444, 443, 442, 439, 437, 436, 435, 434, 433, 431, 430, 429, 428, 427, 426, 425, 424, 423, 422, 421, 420, 419, 418, 417, 416, 415, 414, 413, 411, 410, 409, 408, 407, 406, 405, 404, 403, 402, 401, 400, 399, 398, 397, 396, 395, 394, 393, 392]
Starting structural reductions, iteration 1 : 432/474 places, 1003/1650 transitions.
Applied a total of 0 rules in 46 ms. Remains 432 /432 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 432/474 places, 1003/1650 transitions.
Normalized transition count is 994 out of 1003 initially.
// Phase 1: matrix 994 rows 432 cols
[2021-05-17 01:44:59] [INFO ] Computed 62 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 69465 resets, run finished after 8522 ms. (steps per millisecond=117 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 9564 resets, run finished after 1537 ms. (steps per millisecond=650 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 7368 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 1000001 steps, including 9480 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 9610 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 1000001 steps, including 9540 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 8653 resets, run finished after 1557 ms. (steps per millisecond=642 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 1000001 steps, including 9485 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 9532 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 8) seen :21
[2021-05-17 01:45:20] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2021-05-17 01:45:20] [INFO ] Computed 62 place invariants in 30 ms
[2021-05-17 01:45:20] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2021-05-17 01:45:20] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 13 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 8 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:45:21] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-17 01:45:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:45:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 01:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:45:22] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-17 01:45:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:45:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2021-05-17 01:45:22] [INFO ] Deduced a trap composed of 194 places in 216 ms of which 0 ms to minimize.
[2021-05-17 01:45:22] [INFO ] Deduced a trap composed of 192 places in 272 ms of which 0 ms to minimize.
[2021-05-17 01:45:22] [INFO ] Deduced a trap composed of 192 places in 210 ms of which 1 ms to minimize.
[2021-05-17 01:45:23] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 0 ms to minimize.
[2021-05-17 01:45:23] [INFO ] Deduced a trap composed of 186 places in 559 ms of which 1 ms to minimize.
[2021-05-17 01:45:26] [INFO ] Deduced a trap composed of 190 places in 2211 ms of which 1 ms to minimize.
[2021-05-17 01:45:26] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 13 ms to minimize.
[2021-05-17 01:45:26] [INFO ] Deduced a trap composed of 192 places in 206 ms of which 4 ms to minimize.
[2021-05-17 01:45:27] [INFO ] Deduced a trap composed of 188 places in 245 ms of which 1 ms to minimize.
[2021-05-17 01:45:27] [INFO ] Deduced a trap composed of 194 places in 216 ms of which 1 ms to minimize.
[2021-05-17 01:45:27] [INFO ] Deduced a trap composed of 192 places in 267 ms of which 1 ms to minimize.
[2021-05-17 01:45:28] [INFO ] Deduced a trap composed of 194 places in 222 ms of which 1 ms to minimize.
[2021-05-17 01:45:28] [INFO ] Deduced a trap composed of 190 places in 383 ms of which 0 ms to minimize.
[2021-05-17 01:45:28] [INFO ] Deduced a trap composed of 194 places in 201 ms of which 0 ms to minimize.
[2021-05-17 01:45:29] [INFO ] Deduced a trap composed of 194 places in 220 ms of which 1 ms to minimize.
[2021-05-17 01:45:29] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 1 ms to minimize.
[2021-05-17 01:45:29] [INFO ] Deduced a trap composed of 198 places in 276 ms of which 0 ms to minimize.
[2021-05-17 01:45:30] [INFO ] Deduced a trap composed of 186 places in 264 ms of which 1 ms to minimize.
[2021-05-17 01:46:07] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 1 ms to minimize.
[2021-05-17 01:46:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 01:46:07] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2021-05-17 01:46:07] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-17 01:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:46:07] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2021-05-17 01:46:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:46:07] [INFO ] [Nat]Absence check using 56 positive place invariants in 34 ms returned sat
[2021-05-17 01:46:07] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 20 ms returned sat
[2021-05-17 01:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:46:08] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-17 01:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 90 ms returned sat
[2021-05-17 01:46:08] [INFO ] Deduced a trap composed of 194 places in 390 ms of which 0 ms to minimize.
[2021-05-17 01:46:09] [INFO ] Deduced a trap composed of 192 places in 380 ms of which 1 ms to minimize.
[2021-05-17 01:46:09] [INFO ] Deduced a trap composed of 192 places in 429 ms of which 0 ms to minimize.
[2021-05-17 01:46:10] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 1 ms to minimize.
[2021-05-17 01:46:10] [INFO ] Deduced a trap composed of 186 places in 468 ms of which 0 ms to minimize.
[2021-05-17 01:46:10] [INFO ] Deduced a trap composed of 190 places in 191 ms of which 0 ms to minimize.
[2021-05-17 01:46:11] [INFO ] Deduced a trap composed of 196 places in 193 ms of which 0 ms to minimize.
[2021-05-17 01:46:11] [INFO ] Deduced a trap composed of 192 places in 355 ms of which 1 ms to minimize.
[2021-05-17 01:46:12] [INFO ] Deduced a trap composed of 188 places in 352 ms of which 1 ms to minimize.
[2021-05-17 01:46:12] [INFO ] Deduced a trap composed of 194 places in 337 ms of which 1 ms to minimize.
[2021-05-17 01:46:13] [INFO ] Deduced a trap composed of 192 places in 466 ms of which 0 ms to minimize.
[2021-05-17 01:46:13] [INFO ] Deduced a trap composed of 194 places in 241 ms of which 1 ms to minimize.
[2021-05-17 01:46:13] [INFO ] Deduced a trap composed of 190 places in 244 ms of which 1 ms to minimize.
[2021-05-17 01:46:14] [INFO ] Deduced a trap composed of 194 places in 344 ms of which 0 ms to minimize.
[2021-05-17 01:46:14] [INFO ] Deduced a trap composed of 194 places in 342 ms of which 1 ms to minimize.
[2021-05-17 01:46:14] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 1 ms to minimize.
[2021-05-17 01:46:15] [INFO ] Deduced a trap composed of 198 places in 206 ms of which 1 ms to minimize.
[2021-05-17 01:46:15] [INFO ] Deduced a trap composed of 186 places in 338 ms of which 1 ms to minimize.
[2021-05-17 01:46:53] [INFO ] Deduced a trap composed of 8 places in 474 ms of which 5 ms to minimize.
[2021-05-17 01:46:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 4, 1, 4, 1, 4, 10, 10] Max seen :[1, 4, 1, 4, 1, 4, 3, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 432/432 places, 1003/1003 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 432 transition count 982
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 411 transition count 982
Applied a total of 42 rules in 94 ms. Remains 411 /432 variables (removed 21) and now considering 982/1003 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/432 places, 982/1003 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:46:53] [INFO ] Computed 62 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 70305 resets, run finished after 7432 ms. (steps per millisecond=134 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9573 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9513 resets, run finished after 1414 ms. (steps per millisecond=707 ) properties (out of 2) seen :6
[2021-05-17 01:47:03] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:47:03] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-17 01:47:03] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-17 01:47:03] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 20 ms returned sat
[2021-05-17 01:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:04] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-17 01:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:47:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:47:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:47:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 01:47:04] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 01:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:04] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-17 01:47:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 01:47:04] [INFO ] Deduced a trap composed of 168 places in 342 ms of which 2 ms to minimize.
[2021-05-17 01:47:05] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 8 ms to minimize.
[2021-05-17 01:47:05] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 0 ms to minimize.
[2021-05-17 01:47:06] [INFO ] Deduced a trap composed of 160 places in 493 ms of which 2 ms to minimize.
[2021-05-17 01:47:06] [INFO ] Deduced a trap composed of 173 places in 261 ms of which 1 ms to minimize.
[2021-05-17 01:47:06] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2021-05-17 01:47:06] [INFO ] Deduced a trap composed of 169 places in 234 ms of which 0 ms to minimize.
[2021-05-17 01:47:07] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2021-05-17 01:47:07] [INFO ] Deduced a trap composed of 170 places in 251 ms of which 0 ms to minimize.
[2021-05-17 01:47:07] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2021-05-17 01:47:08] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 1 ms to minimize.
[2021-05-17 01:47:08] [INFO ] Deduced a trap composed of 157 places in 212 ms of which 1 ms to minimize.
[2021-05-17 01:47:08] [INFO ] Deduced a trap composed of 159 places in 228 ms of which 0 ms to minimize.
[2021-05-17 01:47:08] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2021-05-17 01:47:09] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2021-05-17 01:47:09] [INFO ] Deduced a trap composed of 158 places in 316 ms of which 1 ms to minimize.
[2021-05-17 01:47:10] [INFO ] Deduced a trap composed of 168 places in 268 ms of which 1 ms to minimize.
[2021-05-17 01:47:11] [INFO ] Deduced a trap composed of 160 places in 1055 ms of which 2 ms to minimize.
[2021-05-17 01:47:11] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2021-05-17 01:47:11] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2021-05-17 01:47:12] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 0 ms to minimize.
[2021-05-17 01:47:12] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 0 ms to minimize.
[2021-05-17 01:47:12] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 1 ms to minimize.
[2021-05-17 01:47:13] [INFO ] Deduced a trap composed of 164 places in 427 ms of which 0 ms to minimize.
[2021-05-17 01:47:13] [INFO ] Deduced a trap composed of 160 places in 425 ms of which 0 ms to minimize.
[2021-05-17 01:47:18] [INFO ] Deduced a trap composed of 162 places in 4624 ms of which 26 ms to minimize.
[2021-05-17 01:47:19] [INFO ] Deduced a trap composed of 160 places in 384 ms of which 0 ms to minimize.
[2021-05-17 01:47:19] [INFO ] Deduced a trap composed of 156 places in 392 ms of which 0 ms to minimize.
[2021-05-17 01:47:20] [INFO ] Deduced a trap composed of 160 places in 389 ms of which 0 ms to minimize.
[2021-05-17 01:47:20] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 0 ms to minimize.
[2021-05-17 01:47:20] [INFO ] Deduced a trap composed of 158 places in 234 ms of which 0 ms to minimize.
[2021-05-17 01:47:21] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2021-05-17 01:47:21] [INFO ] Deduced a trap composed of 154 places in 230 ms of which 0 ms to minimize.
[2021-05-17 01:47:22] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2021-05-17 01:47:22] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 0 ms to minimize.
[2021-05-17 01:47:23] [INFO ] Deduced a trap composed of 166 places in 658 ms of which 0 ms to minimize.
[2021-05-17 01:47:23] [INFO ] Deduced a trap composed of 160 places in 333 ms of which 1 ms to minimize.
[2021-05-17 01:47:23] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 1 ms to minimize.
[2021-05-17 01:47:24] [INFO ] Deduced a trap composed of 168 places in 366 ms of which 1 ms to minimize.
[2021-05-17 01:47:24] [INFO ] Deduced a trap composed of 160 places in 354 ms of which 0 ms to minimize.
[2021-05-17 01:47:25] [INFO ] Deduced a trap composed of 160 places in 381 ms of which 1 ms to minimize.
[2021-05-17 01:47:25] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2021-05-17 01:47:26] [INFO ] Deduced a trap composed of 164 places in 531 ms of which 1 ms to minimize.
[2021-05-17 01:47:26] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2021-05-17 01:47:28] [INFO ] Deduced a trap composed of 166 places in 671 ms of which 1 ms to minimize.
[2021-05-17 01:47:30] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2021-05-17 01:47:31] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2021-05-17 01:47:31] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 0 ms to minimize.
[2021-05-17 01:47:33] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2021-05-17 01:47:34] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 0 ms to minimize.
[2021-05-17 01:47:34] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 0 ms to minimize.
[2021-05-17 01:47:34] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 1 ms to minimize.
[2021-05-17 01:47:44] [INFO ] Deduced a trap composed of 160 places in 8496 ms of which 26 ms to minimize.
[2021-05-17 01:47:45] [INFO ] Deduced a trap composed of 164 places in 342 ms of which 1 ms to minimize.
[2021-05-17 01:47:45] [INFO ] Deduced a trap composed of 162 places in 332 ms of which 1 ms to minimize.
[2021-05-17 01:47:46] [INFO ] Deduced a trap composed of 162 places in 310 ms of which 0 ms to minimize.
[2021-05-17 01:47:46] [INFO ] Deduced a trap composed of 164 places in 330 ms of which 1 ms to minimize.
[2021-05-17 01:47:47] [INFO ] Deduced a trap composed of 158 places in 358 ms of which 0 ms to minimize.
[2021-05-17 01:47:47] [INFO ] Deduced a trap composed of 160 places in 324 ms of which 0 ms to minimize.
[2021-05-17 01:47:48] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 1 ms to minimize.
[2021-05-17 01:47:48] [INFO ] Deduced a trap composed of 162 places in 325 ms of which 0 ms to minimize.
[2021-05-17 01:47:49] [INFO ] Deduced a trap composed of 164 places in 357 ms of which 1 ms to minimize.
[2021-05-17 01:47:49] [INFO ] Deduced a trap composed of 162 places in 397 ms of which 1 ms to minimize.
[2021-05-17 01:47:49] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 01:47:49] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 01:47:49] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:49] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-17 01:47:49] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:47:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-17 01:47:49] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 22 ms returned sat
[2021-05-17 01:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:50] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-17 01:47:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2021-05-17 01:47:50] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2021-05-17 01:47:50] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 1 ms to minimize.
[2021-05-17 01:47:51] [INFO ] Deduced a trap composed of 171 places in 365 ms of which 0 ms to minimize.
[2021-05-17 01:47:51] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 1 ms to minimize.
[2021-05-17 01:47:51] [INFO ] Deduced a trap composed of 173 places in 276 ms of which 0 ms to minimize.
[2021-05-17 01:47:52] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2021-05-17 01:47:52] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2021-05-17 01:47:52] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 1 ms to minimize.
[2021-05-17 01:47:52] [INFO ] Deduced a trap composed of 170 places in 279 ms of which 0 ms to minimize.
[2021-05-17 01:47:53] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2021-05-17 01:47:53] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2021-05-17 01:47:53] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 1 ms to minimize.
[2021-05-17 01:47:54] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 1 ms to minimize.
[2021-05-17 01:47:54] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 0 ms to minimize.
[2021-05-17 01:47:54] [INFO ] Deduced a trap composed of 166 places in 348 ms of which 1 ms to minimize.
[2021-05-17 01:47:54] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2021-05-17 01:47:56] [INFO ] Deduced a trap composed of 168 places in 1501 ms of which 2 ms to minimize.
[2021-05-17 01:47:56] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2021-05-17 01:47:57] [INFO ] Deduced a trap composed of 162 places in 487 ms of which 1 ms to minimize.
[2021-05-17 01:47:57] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 1 ms to minimize.
[2021-05-17 01:47:58] [INFO ] Deduced a trap composed of 163 places in 322 ms of which 0 ms to minimize.
[2021-05-17 01:47:58] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2021-05-17 01:47:58] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2021-05-17 01:47:59] [INFO ] Deduced a trap composed of 164 places in 337 ms of which 1 ms to minimize.
[2021-05-17 01:47:59] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 0 ms to minimize.
[2021-05-17 01:48:00] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 1 ms to minimize.
[2021-05-17 01:48:00] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2021-05-17 01:48:00] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 0 ms to minimize.
[2021-05-17 01:48:01] [INFO ] Deduced a trap composed of 160 places in 322 ms of which 1 ms to minimize.
[2021-05-17 01:48:01] [INFO ] Deduced a trap composed of 154 places in 263 ms of which 0 ms to minimize.
[2021-05-17 01:48:01] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2021-05-17 01:48:02] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2021-05-17 01:48:02] [INFO ] Deduced a trap composed of 154 places in 249 ms of which 0 ms to minimize.
[2021-05-17 01:48:02] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2021-05-17 01:48:03] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2021-05-17 01:48:03] [INFO ] Deduced a trap composed of 166 places in 364 ms of which 0 ms to minimize.
[2021-05-17 01:48:03] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 1 ms to minimize.
[2021-05-17 01:48:04] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2021-05-17 01:48:04] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 1 ms to minimize.
[2021-05-17 01:48:05] [INFO ] Deduced a trap composed of 160 places in 383 ms of which 0 ms to minimize.
[2021-05-17 01:48:05] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2021-05-17 01:48:05] [INFO ] Deduced a trap composed of 160 places in 363 ms of which 0 ms to minimize.
[2021-05-17 01:48:06] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2021-05-17 01:48:07] [INFO ] Deduced a trap composed of 162 places in 638 ms of which 1 ms to minimize.
[2021-05-17 01:48:08] [INFO ] Deduced a trap composed of 166 places in 378 ms of which 0 ms to minimize.
[2021-05-17 01:48:11] [INFO ] Deduced a trap composed of 162 places in 335 ms of which 0 ms to minimize.
[2021-05-17 01:48:11] [INFO ] Deduced a trap composed of 164 places in 357 ms of which 0 ms to minimize.
[2021-05-17 01:48:12] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2021-05-17 01:48:14] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2021-05-17 01:48:14] [INFO ] Deduced a trap composed of 167 places in 323 ms of which 1 ms to minimize.
[2021-05-17 01:48:15] [INFO ] Deduced a trap composed of 162 places in 303 ms of which 1 ms to minimize.
[2021-05-17 01:48:15] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2021-05-17 01:48:17] [INFO ] Deduced a trap composed of 160 places in 358 ms of which 0 ms to minimize.
[2021-05-17 01:48:19] [INFO ] Deduced a trap composed of 164 places in 1430 ms of which 1 ms to minimize.
[2021-05-17 01:48:19] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2021-05-17 01:48:19] [INFO ] Deduced a trap composed of 162 places in 340 ms of which 1 ms to minimize.
[2021-05-17 01:48:20] [INFO ] Deduced a trap composed of 164 places in 421 ms of which 0 ms to minimize.
[2021-05-17 01:48:20] [INFO ] Deduced a trap composed of 158 places in 259 ms of which 1 ms to minimize.
[2021-05-17 01:48:21] [INFO ] Deduced a trap composed of 160 places in 336 ms of which 0 ms to minimize.
[2021-05-17 01:48:22] [INFO ] Deduced a trap composed of 162 places in 785 ms of which 0 ms to minimize.
[2021-05-17 01:48:22] [INFO ] Deduced a trap composed of 162 places in 348 ms of which 0 ms to minimize.
[2021-05-17 01:48:22] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 1 ms to minimize.
[2021-05-17 01:48:23] [INFO ] Deduced a trap composed of 162 places in 316 ms of which 0 ms to minimize.
[2021-05-17 01:48:23] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 1 ms to minimize.
[2021-05-17 01:48:23] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 1 ms to minimize.
[2021-05-17 01:48:24] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 0 ms to minimize.
[2021-05-17 01:48:24] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 0 ms to minimize.
[2021-05-17 01:48:24] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2021-05-17 01:48:24] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2021-05-17 01:48:25] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 0 ms to minimize.
[2021-05-17 01:48:25] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2021-05-17 01:48:25] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2021-05-17 01:48:26] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2021-05-17 01:48:26] [INFO ] Deduced a trap composed of 162 places in 262 ms of which 1 ms to minimize.
[2021-05-17 01:48:26] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2021-05-17 01:48:28] [INFO ] Deduced a trap composed of 158 places in 1443 ms of which 0 ms to minimize.
[2021-05-17 01:48:28] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2021-05-17 01:48:29] [INFO ] Deduced a trap composed of 164 places in 315 ms of which 1 ms to minimize.
[2021-05-17 01:48:29] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2021-05-17 01:48:30] [INFO ] Deduced a trap composed of 158 places in 702 ms of which 0 ms to minimize.
[2021-05-17 01:48:30] [INFO ] Deduced a trap composed of 162 places in 300 ms of which 0 ms to minimize.
[2021-05-17 01:48:31] [INFO ] Deduced a trap composed of 166 places in 400 ms of which 0 ms to minimize.
[2021-05-17 01:48:31] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 1 ms to minimize.
[2021-05-17 01:48:32] [INFO ] Deduced a trap composed of 164 places in 388 ms of which 0 ms to minimize.
[2021-05-17 01:48:32] [INFO ] Deduced a trap composed of 164 places in 329 ms of which 1 ms to minimize.
[2021-05-17 01:48:32] [INFO ] Deduced a trap composed of 162 places in 334 ms of which 1 ms to minimize.
[2021-05-17 01:48:35] [INFO ] Deduced a trap composed of 2 places in 314 ms of which 0 ms to minimize.
[2021-05-17 01:48:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 43 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 45 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2021-05-17 01:48:35] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:35] [INFO ] Computed 62 place invariants in 19 ms
[2021-05-17 01:48:35] [INFO ] Implicit Places using invariants in 426 ms returned []
[2021-05-17 01:48:35] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:35] [INFO ] Computed 62 place invariants in 11 ms
[2021-05-17 01:48:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:48:37] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2021-05-17 01:48:37] [INFO ] Redundant transitions in 79 ms returned []
[2021-05-17 01:48:37] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:37] [INFO ] Computed 62 place invariants in 12 ms
[2021-05-17 01:48:37] [INFO ] Dead Transitions using invariants and state equation in 555 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:37] [INFO ] Computed 62 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 722 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :3
[2021-05-17 01:48:37] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:37] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-17 01:48:37] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-17 01:48:37] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 01:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:38] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-17 01:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:48:38] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 01:48:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:48:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 01:48:38] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:38] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-17 01:48:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2021-05-17 01:48:38] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 1 ms to minimize.
[2021-05-17 01:48:39] [INFO ] Deduced a trap composed of 166 places in 367 ms of which 1 ms to minimize.
[2021-05-17 01:48:39] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 0 ms to minimize.
[2021-05-17 01:48:39] [INFO ] Deduced a trap composed of 160 places in 357 ms of which 0 ms to minimize.
[2021-05-17 01:48:40] [INFO ] Deduced a trap composed of 173 places in 448 ms of which 0 ms to minimize.
[2021-05-17 01:48:40] [INFO ] Deduced a trap composed of 164 places in 423 ms of which 0 ms to minimize.
[2021-05-17 01:48:41] [INFO ] Deduced a trap composed of 169 places in 388 ms of which 1 ms to minimize.
[2021-05-17 01:48:41] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 0 ms to minimize.
[2021-05-17 01:48:41] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2021-05-17 01:48:42] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 0 ms to minimize.
[2021-05-17 01:48:42] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2021-05-17 01:48:42] [INFO ] Deduced a trap composed of 157 places in 202 ms of which 0 ms to minimize.
[2021-05-17 01:48:43] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 1 ms to minimize.
[2021-05-17 01:48:43] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2021-05-17 01:48:43] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2021-05-17 01:48:43] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:43] [INFO ] Computed 62 place invariants in 25 ms
[2021-05-17 01:48:43] [INFO ] Dead Transitions using invariants and state equation in 537 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:43] [INFO ] Computed 62 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70438 resets, run finished after 7289 ms. (steps per millisecond=137 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 9551 resets, run finished after 1334 ms. (steps per millisecond=749 ) properties (out of 1) seen :3
[2021-05-17 01:48:52] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:48:52] [INFO ] Computed 62 place invariants in 17 ms
[2021-05-17 01:48:52] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-17 01:48:52] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 22 ms returned sat
[2021-05-17 01:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:53] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-17 01:48:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:48:53] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:48:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:48:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-17 01:48:53] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:48:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:53] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-17 01:48:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2021-05-17 01:48:53] [INFO ] Deduced a trap composed of 168 places in 356 ms of which 2 ms to minimize.
[2021-05-17 01:48:54] [INFO ] Deduced a trap composed of 166 places in 354 ms of which 1 ms to minimize.
[2021-05-17 01:48:54] [INFO ] Deduced a trap composed of 171 places in 351 ms of which 1 ms to minimize.
[2021-05-17 01:48:55] [INFO ] Deduced a trap composed of 160 places in 358 ms of which 0 ms to minimize.
[2021-05-17 01:48:55] [INFO ] Deduced a trap composed of 173 places in 383 ms of which 1 ms to minimize.
[2021-05-17 01:48:56] [INFO ] Deduced a trap composed of 164 places in 416 ms of which 1 ms to minimize.
[2021-05-17 01:48:56] [INFO ] Deduced a trap composed of 169 places in 414 ms of which 0 ms to minimize.
[2021-05-17 01:48:56] [INFO ] Deduced a trap composed of 164 places in 340 ms of which 0 ms to minimize.
[2021-05-17 01:48:57] [INFO ] Deduced a trap composed of 170 places in 269 ms of which 0 ms to minimize.
[2021-05-17 01:48:57] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2021-05-17 01:48:57] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2021-05-17 01:48:58] [INFO ] Deduced a trap composed of 157 places in 216 ms of which 1 ms to minimize.
[2021-05-17 01:48:58] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 1 ms to minimize.
[2021-05-17 01:48:58] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2021-05-17 01:48:58] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 0 ms to minimize.
[2021-05-17 01:48:59] [INFO ] Deduced a trap composed of 158 places in 320 ms of which 1 ms to minimize.
[2021-05-17 01:48:59] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 2 ms to minimize.
[2021-05-17 01:48:59] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 2 ms to minimize.
[2021-05-17 01:49:00] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 1 ms to minimize.
[2021-05-17 01:49:00] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2021-05-17 01:49:01] [INFO ] Deduced a trap composed of 163 places in 396 ms of which 0 ms to minimize.
[2021-05-17 01:49:01] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 0 ms to minimize.
[2021-05-17 01:49:01] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2021-05-17 01:49:02] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 13 ms to minimize.
[2021-05-17 01:49:02] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 1 ms to minimize.
[2021-05-17 01:49:02] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2021-05-17 01:49:03] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 13 ms to minimize.
[2021-05-17 01:49:03] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 1 ms to minimize.
[2021-05-17 01:49:03] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2021-05-17 01:49:04] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 1 ms to minimize.
[2021-05-17 01:49:04] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2021-05-17 01:49:05] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 0 ms to minimize.
[2021-05-17 01:49:05] [INFO ] Deduced a trap composed of 154 places in 284 ms of which 1 ms to minimize.
[2021-05-17 01:49:05] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2021-05-17 01:49:06] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 0 ms to minimize.
[2021-05-17 01:49:06] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2021-05-17 01:49:07] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 0 ms to minimize.
[2021-05-17 01:49:10] [INFO ] Deduced a trap composed of 166 places in 3428 ms of which 0 ms to minimize.
[2021-05-17 01:49:10] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2021-05-17 01:49:11] [INFO ] Deduced a trap composed of 160 places in 373 ms of which 1 ms to minimize.
[2021-05-17 01:49:16] [INFO ] Deduced a trap composed of 160 places in 4721 ms of which 0 ms to minimize.
[2021-05-17 01:49:17] [INFO ] Deduced a trap composed of 160 places in 750 ms of which 1 ms to minimize.
[2021-05-17 01:49:19] [INFO ] Deduced a trap composed of 164 places in 2470 ms of which 0 ms to minimize.
[2021-05-17 01:49:20] [INFO ] Deduced a trap composed of 162 places in 303 ms of which 0 ms to minimize.
[2021-05-17 01:49:21] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 0 ms to minimize.
[2021-05-17 01:49:24] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 0 ms to minimize.
[2021-05-17 01:49:24] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 0 ms to minimize.
[2021-05-17 01:49:25] [INFO ] Deduced a trap composed of 166 places in 352 ms of which 1 ms to minimize.
[2021-05-17 01:49:27] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2021-05-17 01:49:28] [INFO ] Deduced a trap composed of 167 places in 379 ms of which 1 ms to minimize.
[2021-05-17 01:49:28] [INFO ] Deduced a trap composed of 162 places in 341 ms of which 0 ms to minimize.
[2021-05-17 01:49:29] [INFO ] Deduced a trap composed of 164 places in 340 ms of which 0 ms to minimize.
[2021-05-17 01:49:30] [INFO ] Deduced a trap composed of 160 places in 376 ms of which 1 ms to minimize.
[2021-05-17 01:49:31] [INFO ] Deduced a trap composed of 164 places in 365 ms of which 0 ms to minimize.
[2021-05-17 01:49:31] [INFO ] Deduced a trap composed of 162 places in 366 ms of which 1 ms to minimize.
[2021-05-17 01:49:32] [INFO ] Deduced a trap composed of 162 places in 351 ms of which 1 ms to minimize.
[2021-05-17 01:49:32] [INFO ] Deduced a trap composed of 164 places in 345 ms of which 0 ms to minimize.
[2021-05-17 01:49:33] [INFO ] Deduced a trap composed of 158 places in 361 ms of which 1 ms to minimize.
[2021-05-17 01:49:33] [INFO ] Deduced a trap composed of 160 places in 342 ms of which 0 ms to minimize.
[2021-05-17 01:49:37] [INFO ] Deduced a trap composed of 162 places in 3965 ms of which 17 ms to minimize.
[2021-05-17 01:49:38] [INFO ] Deduced a trap composed of 162 places in 431 ms of which 0 ms to minimize.
[2021-05-17 01:49:38] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 39 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2021-05-17 01:49:38] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:38] [INFO ] Computed 62 place invariants in 14 ms
[2021-05-17 01:49:39] [INFO ] Implicit Places using invariants in 633 ms returned []
[2021-05-17 01:49:39] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:39] [INFO ] Computed 62 place invariants in 9 ms
[2021-05-17 01:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:49:41] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2021-05-17 01:49:41] [INFO ] Redundant transitions in 50 ms returned []
[2021-05-17 01:49:41] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:41] [INFO ] Computed 62 place invariants in 17 ms
[2021-05-17 01:49:42] [INFO ] Dead Transitions using invariants and state equation in 494 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11 in 64340 ms.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-12
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:42] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 697 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2021-05-17 01:49:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:42] [INFO ] Computed 62 place invariants in 11 ms
[2021-05-17 01:49:42] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-17 01:49:42] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 01:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:42] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-17 01:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:49:42] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:49:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:49:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-17 01:49:42] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 01:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:43] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2021-05-17 01:49:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2021-05-17 01:49:44] [INFO ] Deduced a trap composed of 168 places in 1023 ms of which 1 ms to minimize.
[2021-05-17 01:49:44] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 0 ms to minimize.
[2021-05-17 01:49:44] [INFO ] Deduced a trap composed of 171 places in 226 ms of which 0 ms to minimize.
[2021-05-17 01:49:45] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 0 ms to minimize.
[2021-05-17 01:49:45] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 0 ms to minimize.
[2021-05-17 01:49:45] [INFO ] Deduced a trap composed of 164 places in 340 ms of which 1 ms to minimize.
[2021-05-17 01:49:46] [INFO ] Deduced a trap composed of 169 places in 243 ms of which 1 ms to minimize.
[2021-05-17 01:49:46] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 1 ms to minimize.
[2021-05-17 01:49:46] [INFO ] Deduced a trap composed of 170 places in 245 ms of which 0 ms to minimize.
[2021-05-17 01:49:46] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2021-05-17 01:49:47] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 1 ms to minimize.
[2021-05-17 01:49:47] [INFO ] Deduced a trap composed of 157 places in 210 ms of which 0 ms to minimize.
[2021-05-17 01:49:47] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 1 ms to minimize.
[2021-05-17 01:49:48] [INFO ] Deduced a trap composed of 160 places in 277 ms of which 0 ms to minimize.
[2021-05-17 01:49:48] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2021-05-17 01:49:48] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:48] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-17 01:49:48] [INFO ] Dead Transitions using invariants and state equation in 566 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:48] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 70408 resets, run finished after 7283 ms. (steps per millisecond=137 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9536 resets, run finished after 1288 ms. (steps per millisecond=776 ) properties (out of 1) seen :3
[2021-05-17 01:49:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:49:57] [INFO ] Computed 62 place invariants in 17 ms
[2021-05-17 01:49:57] [INFO ] [Real]Absence check using 55 positive place invariants in 38 ms returned sat
[2021-05-17 01:49:57] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 01:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:57] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-17 01:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:49:57] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 01:49:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:49:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-17 01:49:57] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 21 ms returned sat
[2021-05-17 01:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:58] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2021-05-17 01:49:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2021-05-17 01:49:58] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2021-05-17 01:49:58] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 0 ms to minimize.
[2021-05-17 01:49:59] [INFO ] Deduced a trap composed of 171 places in 369 ms of which 1 ms to minimize.
[2021-05-17 01:49:59] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 0 ms to minimize.
[2021-05-17 01:49:59] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 0 ms to minimize.
[2021-05-17 01:50:00] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 0 ms to minimize.
[2021-05-17 01:50:00] [INFO ] Deduced a trap composed of 169 places in 224 ms of which 0 ms to minimize.
[2021-05-17 01:50:00] [INFO ] Deduced a trap composed of 164 places in 361 ms of which 1 ms to minimize.
[2021-05-17 01:50:01] [INFO ] Deduced a trap composed of 170 places in 372 ms of which 1 ms to minimize.
[2021-05-17 01:50:01] [INFO ] Deduced a trap composed of 158 places in 288 ms of which 0 ms to minimize.
[2021-05-17 01:50:06] [INFO ] Deduced a trap composed of 160 places in 4303 ms of which 0 ms to minimize.
[2021-05-17 01:50:06] [INFO ] Deduced a trap composed of 157 places in 213 ms of which 0 ms to minimize.
[2021-05-17 01:50:06] [INFO ] Deduced a trap composed of 159 places in 427 ms of which 1 ms to minimize.
[2021-05-17 01:50:07] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2021-05-17 01:50:07] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 0 ms to minimize.
[2021-05-17 01:50:07] [INFO ] Deduced a trap composed of 158 places in 429 ms of which 0 ms to minimize.
[2021-05-17 01:50:08] [INFO ] Deduced a trap composed of 168 places in 374 ms of which 0 ms to minimize.
[2021-05-17 01:50:08] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2021-05-17 01:50:09] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2021-05-17 01:50:09] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 0 ms to minimize.
[2021-05-17 01:50:09] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 0 ms to minimize.
[2021-05-17 01:50:09] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2021-05-17 01:50:10] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2021-05-17 01:50:10] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2021-05-17 01:50:10] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2021-05-17 01:50:11] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2021-05-17 01:50:11] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2021-05-17 01:50:11] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2021-05-17 01:50:12] [INFO ] Deduced a trap composed of 160 places in 306 ms of which 0 ms to minimize.
[2021-05-17 01:50:12] [INFO ] Deduced a trap composed of 154 places in 350 ms of which 0 ms to minimize.
[2021-05-17 01:50:13] [INFO ] Deduced a trap composed of 158 places in 278 ms of which 1 ms to minimize.
[2021-05-17 01:50:13] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2021-05-17 01:50:14] [INFO ] Deduced a trap composed of 154 places in 530 ms of which 0 ms to minimize.
[2021-05-17 01:50:14] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2021-05-17 01:50:14] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2021-05-17 01:50:15] [INFO ] Deduced a trap composed of 166 places in 349 ms of which 1 ms to minimize.
[2021-05-17 01:50:15] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2021-05-17 01:50:15] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 0 ms to minimize.
[2021-05-17 01:50:16] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 0 ms to minimize.
[2021-05-17 01:50:16] [INFO ] Deduced a trap composed of 160 places in 372 ms of which 1 ms to minimize.
[2021-05-17 01:50:17] [INFO ] Deduced a trap composed of 160 places in 532 ms of which 1 ms to minimize.
[2021-05-17 01:50:17] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2021-05-17 01:50:18] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2021-05-17 01:50:18] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2021-05-17 01:50:19] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2021-05-17 01:50:22] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2021-05-17 01:50:22] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2021-05-17 01:50:22] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 1 ms to minimize.
[2021-05-17 01:50:25] [INFO ] Deduced a trap composed of 158 places in 368 ms of which 1 ms to minimize.
[2021-05-17 01:50:27] [INFO ] Deduced a trap composed of 167 places in 2272 ms of which 0 ms to minimize.
[2021-05-17 01:50:29] [INFO ] Deduced a trap composed of 162 places in 1082 ms of which 0 ms to minimize.
[2021-05-17 01:50:29] [INFO ] Deduced a trap composed of 164 places in 384 ms of which 0 ms to minimize.
[2021-05-17 01:50:31] [INFO ] Deduced a trap composed of 160 places in 330 ms of which 1 ms to minimize.
[2021-05-17 01:50:31] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2021-05-17 01:50:32] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 1 ms to minimize.
[2021-05-17 01:50:32] [INFO ] Deduced a trap composed of 162 places in 409 ms of which 0 ms to minimize.
[2021-05-17 01:50:32] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 1 ms to minimize.
[2021-05-17 01:50:33] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 0 ms to minimize.
[2021-05-17 01:50:33] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2021-05-17 01:50:34] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2021-05-17 01:50:34] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2021-05-17 01:50:34] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2021-05-17 01:50:34] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2021-05-17 01:50:35] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 1 ms to minimize.
[2021-05-17 01:50:35] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2021-05-17 01:50:35] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2021-05-17 01:50:36] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2021-05-17 01:50:36] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 1 ms to minimize.
[2021-05-17 01:50:36] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2021-05-17 01:50:36] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2021-05-17 01:50:37] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2021-05-17 01:50:37] [INFO ] Deduced a trap composed of 166 places in 337 ms of which 1 ms to minimize.
[2021-05-17 01:50:38] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 0 ms to minimize.
[2021-05-17 01:50:38] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 1 ms to minimize.
[2021-05-17 01:50:38] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 0 ms to minimize.
[2021-05-17 01:50:39] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2021-05-17 01:50:39] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2021-05-17 01:50:39] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2021-05-17 01:50:42] [INFO ] Deduced a trap composed of 162 places in 1976 ms of which 0 ms to minimize.
[2021-05-17 01:50:42] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 0 ms to minimize.
[2021-05-17 01:50:42] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 1 ms to minimize.
[2021-05-17 01:50:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 49 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 11 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2021-05-17 01:50:43] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:50:43] [INFO ] Computed 62 place invariants in 15 ms
[2021-05-17 01:50:48] [INFO ] Implicit Places using invariants in 5818 ms returned []
[2021-05-17 01:50:48] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:50:48] [INFO ] Computed 62 place invariants in 13 ms
[2021-05-17 01:50:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:50:58] [INFO ] Implicit Places using invariants and state equation in 9845 ms returned []
Implicit Place search using SMT with State Equation took 15687 ms to find 0 implicit places.
[2021-05-17 01:50:58] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-17 01:50:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2021-05-17 01:50:58] [INFO ] Computed 62 place invariants in 12 ms
[2021-05-17 01:50:59] [INFO ] Dead Transitions using invariants and state equation in 438 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-12 in 77172 ms.
[2021-05-17 01:50:59] [INFO ] Flatten gal took : 450 ms
[2021-05-17 01:51:00] [INFO ] Applying decomposition
[2021-05-17 01:51:00] [INFO ] Flatten gal took : 214 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17300128736019086907.txt, -o, /tmp/graph17300128736019086907.bin, -w, /tmp/graph17300128736019086907.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17300128736019086907.bin, -l, -1, -v, -w, /tmp/graph17300128736019086907.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:51:00] [INFO ] Decomposing Gal with order
[2021-05-17 01:51:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:51:01] [INFO ] Removed a total of 2739 redundant transitions.
[2021-05-17 01:51:01] [INFO ] Flatten gal took : 392 ms
[2021-05-17 01:51:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 83 ms.
[2021-05-17 01:51:01] [INFO ] Time to serialize gal into /tmp/UpperBounds17506506441949586539.gal : 32 ms
[2021-05-17 01:51:01] [INFO ] Time to serialize properties into /tmp/UpperBounds4670846133532306754.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17506506441949586539.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4670846133532306754.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17506506441949586539.gal -t CGAL -reachable-file /tmp/UpperBounds4670846133532306754.prop --nowitness
Loading property file /tmp/UpperBounds4670846133532306754.prop.
Detected timeout of ITS tools.
[2021-05-17 02:13:22] [INFO ] Applying decomposition
[2021-05-17 02:13:23] [INFO ] Flatten gal took : 601 ms
[2021-05-17 02:13:23] [INFO ] Decomposing Gal with order
[2021-05-17 02:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:13:25] [INFO ] Removed a total of 5759 redundant transitions.
[2021-05-17 02:13:25] [INFO ] Flatten gal took : 1936 ms
[2021-05-17 02:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 171 ms.
[2021-05-17 02:13:26] [INFO ] Time to serialize gal into /tmp/UpperBounds3519292186972324771.gal : 93 ms
[2021-05-17 02:13:26] [INFO ] Time to serialize properties into /tmp/UpperBounds3886578387623200500.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3519292186972324771.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3886578387623200500.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3519292186972324771.gal -t CGAL -reachable-file /tmp/UpperBounds3886578387623200500.prop --nowitness
Loading property file /tmp/UpperBounds3886578387623200500.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.01779e+10,1298.53,14247276,5.79389e+06,32,2.32072e+07,4032,1823,1.09529e+07,48,3751,0
Total reachable state count : 30177920505

Verifying 2 reachability properties.
Detected timeout of ITS tools.
[2021-05-17 02:35:45] [INFO ] Flatten gal took : 1317 ms
[2021-05-17 02:35:47] [INFO ] Input system was already deterministic with 982 transitions.
[2021-05-17 02:35:47] [INFO ] Transformed 411 places.
[2021-05-17 02:35:47] [INFO ] Transformed 982 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 02:36:17] [INFO ] Time to serialize gal into /tmp/UpperBounds1678801979609365995.gal : 24 ms
[2021-05-17 02:36:17] [INFO ] Time to serialize properties into /tmp/UpperBounds11179624600703913245.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds1678801979609365995.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11179624600703913245.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds1678801979609365995.gal -t CGAL -reachable-file /tmp/UpperBounds11179624600703913245.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11179624600703913245.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-COL-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-COL-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 r159-oct2-162089268300403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-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 ;