Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027100298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 04:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652838203880

Running Version 0
[2022-05-18 01:43:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:43:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:43:25] [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.
[2022-05-18 01:43:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:43:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 683 ms
[2022-05-18 01:43:26] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 01:43:26] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 01:43:26] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 01:43:26] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 01:43:26] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 01:43:26] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 01:43:26] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 01:43:26] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2022-05-18 01:43:26] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12514368386063185386.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:43:26] [INFO ] Computed 13 place invariants in 22 ms
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 01:43:26] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 2870 transitions in 38 ms.
[2022-05-18 01:43:26] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:43:26] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-18 01:43:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:43:27] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2022-05-18 01:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-18 01:43:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:43:27] [INFO ] Added : 33 causal constraints over 7 iterations in 180 ms. Result :sat
Minimization took 118 ms.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 01:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:27] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2022-05-18 01:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-18 01:43:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-18 01:43:27] [INFO ] Added : 15 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 11 ms.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:43:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 01:43:27] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 2 ms to minimize.
[2022-05-18 01:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-18 01:43:27] [INFO ] Added : 36 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:27] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2022-05-18 01:43:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 01:43:28] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-18 01:43:28] [INFO ] Added : 36 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:43:28] [INFO ] Deduced a trap composed of 14 places in 9 ms of which 0 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Deduced a trap composed of 14 places in 8 ms of which 0 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 24 ms
[2022-05-18 01:43:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:43:28] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:43:28] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-18 01:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-18 01:43:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:43:28] [INFO ] Added : 21 causal constraints over 5 iterations in 243 ms. Result :sat
Minimization took 226 ms.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 01:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:43:29] [INFO ] Added : 33 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 25 ms.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 01:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:29] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2022-05-18 01:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-18 01:43:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:43:29] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-18 01:43:29] [INFO ] Added : 36 causal constraints over 8 iterations in 146 ms. Result :sat
Minimization took 47 ms.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-18 01:43:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 01:43:29] [INFO ] Added : 17 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 165 ms.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:43:29] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2022-05-18 01:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-18 01:43:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:43:30] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2022-05-18 01:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2022-05-18 01:43:30] [INFO ] Added : 36 causal constraints over 8 iterations in 425 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:43:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:43:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:43:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:43:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:43:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:43:30] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2022-05-18 01:43:30] [INFO ] Deduced a trap composed of 14 places in 10 ms of which 0 ms to minimize.
[2022-05-18 01:43:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 29 ms
[2022-05-18 01:43:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:43:30] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, -1, 3, -1, 10, 10, 10, 10, -1, -1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 01:43:30] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 2870 transitions in 21 ms.
[2022-05-18 01:43:30] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_15624376207388081875.dot
Deduced a syphon composed of 60 places in 15 ms
Reduce places removed 60 places and 60 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 12) seen :11
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :1
[2022-05-18 01:43:31] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2022-05-18 01:43:31] [INFO ] Computed 152 place invariants in 318 ms
[2022-05-18 01:43:31] [INFO ] [Real]Absence check using 145 positive place invariants in 41 ms returned sat
[2022-05-18 01:43:31] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-18 01:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:32] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2022-05-18 01:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:33] [INFO ] [Nat]Absence check using 145 positive place invariants in 62 ms returned sat
[2022-05-18 01:43:33] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 59 ms returned sat
[2022-05-18 01:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:36] [INFO ] [Nat]Absence check using state equation in 3486 ms returned sat
[2022-05-18 01:43:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:43:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 863 ms returned sat
[2022-05-18 01:43:37] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 337 ms.
[2022-05-18 01:43:37] [INFO ] Added : 0 causal constraints over 0 iterations in 340 ms. Result :unknown
[2022-05-18 01:43:38] [INFO ] [Real]Absence check using 145 positive place invariants in 47 ms returned sat
[2022-05-18 01:43:38] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-18 01:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:38] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2022-05-18 01:43:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:39] [INFO ] [Nat]Absence check using 145 positive place invariants in 47 ms returned sat
[2022-05-18 01:43:39] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-18 01:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:41] [INFO ] [Nat]Absence check using state equation in 2083 ms returned sat
[2022-05-18 01:43:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2022-05-18 01:43:41] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 235 ms.
[2022-05-18 01:43:41] [INFO ] Added : 7 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 993 ms.
[2022-05-18 01:43:43] [INFO ] [Real]Absence check using 145 positive place invariants in 46 ms returned sat
[2022-05-18 01:43:43] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-18 01:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:44] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2022-05-18 01:43:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:44] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2022-05-18 01:43:44] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2022-05-18 01:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:46] [INFO ] [Nat]Absence check using state equation in 1551 ms returned sat
[2022-05-18 01:43:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:43:46] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 223 ms.
[2022-05-18 01:43:49] [INFO ] Deduced a trap composed of 19 places in 1476 ms of which 2 ms to minimize.
[2022-05-18 01:43: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 2
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)
[2022-05-18 01:43:49] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-18 01:43:49] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-18 01:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:50] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2022-05-18 01:43:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:50] [INFO ] [Nat]Absence check using 145 positive place invariants in 55 ms returned sat
[2022-05-18 01:43:50] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-18 01:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:52] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2022-05-18 01:43:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-05-18 01:43:53] [INFO ] Deduced a trap composed of 20 places in 679 ms of which 1 ms to minimize.
[2022-05-18 01:43:53] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 0 ms to minimize.
[2022-05-18 01:43:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1613 ms
[2022-05-18 01:43:54] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 237 ms.
[2022-05-18 01:43:55] [INFO ] Added : 5 causal constraints over 1 iterations in 1630 ms. Result :unknown
[2022-05-18 01:43:55] [INFO ] [Real]Absence check using 145 positive place invariants in 48 ms returned sat
[2022-05-18 01:43:55] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-18 01:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:56] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2022-05-18 01:43:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:43:57] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2022-05-18 01:43:57] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-18 01:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:43:59] [INFO ] [Nat]Absence check using state equation in 2480 ms returned sat
[2022-05-18 01:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 409 ms returned sat
[2022-05-18 01:44:00] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 238 ms.
[2022-05-18 01:44:01] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 1 ms to minimize.
[2022-05-18 01:44:02] [INFO ] Deduced a trap composed of 9 places in 845 ms of which 1 ms to minimize.
[2022-05-18 01:44:02] [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)
[2022-05-18 01:44:02] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:02] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned unsat
[2022-05-18 01:44:03] [INFO ] [Real]Absence check using 145 positive place invariants in 39 ms returned sat
[2022-05-18 01:44:03] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-18 01:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:03] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2022-05-18 01:44:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:44:04] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:04] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-18 01:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:08] [INFO ] [Nat]Absence check using state equation in 4834 ms returned unknown
[2022-05-18 01:44:09] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:09] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-18 01:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:09] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2022-05-18 01:44:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:44:10] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:10] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-18 01:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:13] [INFO ] [Nat]Absence check using state equation in 3084 ms returned sat
[2022-05-18 01:44:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:44:13] [INFO ] Deduced a trap composed of 152 places in 355 ms of which 1 ms to minimize.
[2022-05-18 01:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2022-05-18 01:44:14] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 249 ms.
[2022-05-18 01:44:14] [INFO ] Added : 20 causal constraints over 4 iterations in 1234 ms. Result :unknown
[2022-05-18 01:44:15] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2022-05-18 01:44:15] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-18 01:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:15] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2022-05-18 01:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:44:16] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:16] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-18 01:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:21] [INFO ] [Nat]Absence check using state equation in 4853 ms returned unknown
[2022-05-18 01:44:21] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2022-05-18 01:44:21] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-18 01:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:22] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-05-18 01:44:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:44:22] [INFO ] [Nat]Absence check using 145 positive place invariants in 41 ms returned sat
[2022-05-18 01:44:22] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-18 01:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:24] [INFO ] [Nat]Absence check using state equation in 2316 ms returned sat
[2022-05-18 01:44:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 53 ms returned sat
[2022-05-18 01:44:25] [INFO ] Deduced a trap composed of 142 places in 646 ms of which 1 ms to minimize.
[2022-05-18 01:44:25] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
[2022-05-18 01:44:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1185 ms
[2022-05-18 01:44:26] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 228 ms.
[2022-05-18 01:44:27] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 0 ms to minimize.
[2022-05-18 01:44:27] [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 9
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)
[2022-05-18 01:44:27] [INFO ] [Real]Absence check using 145 positive place invariants in 53 ms returned sat
[2022-05-18 01:44:27] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-18 01:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:28] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2022-05-18 01:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:44:28] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-18 01:44:28] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-18 01:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:32] [INFO ] [Nat]Absence check using state equation in 3662 ms returned sat
[2022-05-18 01:44:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2022-05-18 01:44:32] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 200 ms.
[2022-05-18 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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 2147483647, 1, 2147483647, 1, 10, 10, 10, 2147483647, 2147483647] Max seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 14800 steps, including 2114 resets, run finished after 185 ms. (steps per millisecond=80 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17100 steps, including 1554 resets, run finished after 220 ms. (steps per millisecond=77 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=100 ) properties (out of 10) seen :6 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7500 steps, including 501 resets, run finished after 107 ms. (steps per millisecond=70 ) properties (out of 8) seen :4 could not realise parikh vector
Support contains 248 out of 1234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1234/1234 places, 2810/2810 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 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 1 with 66 rules applied. Total rules applied 80 place count 1220 transition count 2744
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 1158 transition count 2741
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 532 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
[2022-05-18 01:44:34] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2022-05-18 01:44:34] [INFO ] Computed 142 place invariants in 121 ms
[2022-05-18 01:44:36] [INFO ] Dead Transitions using invariants and state equation in 1707 ms returned [1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1153, 1154, 1155, 1156, 1157, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1188, 1189, 1190, 1191, 1192, 1194, 1197, 1198, 1199, 1200, 1201, 1202, 1204, 1207, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1244, 1245, 1246, 1247, 1248, 1250, 1253, 1254, 1255, 1256, 1257, 1258, 1260, 1263, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1275, 1278, 1282, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1328, 1329, 1330, 1331, 1332, 1334, 1337, 1338, 1339, 1340, 1341, 1342, 1344, 1347, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1359, 1362, 1366, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1380, 1383, 1387, 1392, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1448, 1449, 1450, 1451, 1452, 1454, 1457, 1458, 1459, 1460, 1461, 1462, 1464, 1467, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1479, 1482, 1486, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1500, 1503, 1507, 1512, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1528, 1531, 1535, 1540, 1546, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1604, 1605, 1606, 1607, 1608, 1609, 1610, 1611, 1613, 1614, 1615, 1616, 1617, 1619, 1622, 1623, 1624, 1625, 1626, 1627, 1629, 1632, 1636, 1637, 1638, 1639, 1640, 1641, 1642, 1644, 1647, 1651, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1665, 1668, 1672, 1677, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1693, 1696, 1700, 1705, 1711, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1729, 1732, 1736, 1741, 1747, 1754, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1809, 1810, 1811, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1830, 1831, 1833, 1834, 1835, 1836, 1837, 1839, 1842, 1843, 1844, 1845, 1846, 1847, 1849, 1852, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1864, 1867, 1871, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1885, 1888, 1892, 1897, 1903, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1913, 1916, 1920, 1925, 1931, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1949, 1952, 1956, 1961, 1967, 1974, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1994, 1997, 2001, 2006, 2012, 2019, 2027, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2049, 2052, 2056, 2061, 2067, 2074, 2082, 2091, 2101]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[2101, 2091, 2082, 2074, 2067, 2061, 2056, 2052, 2049, 2047, 2046, 2045, 2044, 2043, 2042, 2041, 2040, 2039, 2038, 2037, 2036, 2027, 2019, 2012, 2006, 2001, 1997, 1994, 1992, 1991, 1990, 1989, 1988, 1987, 1986, 1985, 1984, 1983, 1982, 1974, 1967, 1961, 1956, 1952, 1949, 1947, 1946, 1945, 1944, 1943, 1942, 1941, 1940, 1939, 1938, 1931, 1925, 1920, 1916, 1913, 1911, 1910, 1909, 1908, 1907, 1906, 1905, 1904, 1903, 1897, 1892, 1888, 1885, 1883, 1882, 1881, 1880, 1879, 1878, 1877, 1876, 1871, 1867, 1864, 1862, 1861, 1860, 1859, 1858, 1857, 1856, 1852, 1849, 1847, 1846, 1845, 1844, 1843, 1842, 1839, 1837, 1836, 1835, 1834, 1833, 1831, 1830, 1829, 1828, 1827, 1826, 1825, 1824, 1823, 1822, 1821, 1820, 1819, 1818, 1817, 1816, 1815, 1814, 1813, 1812, 1811, 1810, 1809, 1808, 1807, 1806, 1805, 1804, 1803, 1802, 1801, 1800, 1799, 1798, 1797, 1796, 1795, 1794, 1793, 1792, 1791, 1790, 1789, 1788, 1787, 1786, 1785, 1784, 1783, 1782, 1781, 1780, 1779, 1778, 1777, 1776, 1775, 1774, 1773, 1772, 1771, 1770, 1769, 1768, 1767, 1766, 1765, 1764, 1763, 1762, 1754, 1747, 1741, 1736, 1732, 1729, 1727, 1726, 1725, 1724, 1723, 1722, 1721, 1720, 1719, 1718, 1711, 1705, 1700, 1696, 1693, 1691, 1690, 1689, 1688, 1687, 1686, 1685, 1684, 1683, 1677, 1672, 1668, 1665, 1663, 1662, 1661, 1660, 1659, 1658, 1657, 1656, 1651, 1647, 1644, 1642, 1641, 1640, 1639, 1638, 1637, 1636, 1632, 1629, 1627, 1626, 1625, 1624, 1623, 1622, 1619, 1617, 1616, 1615, 1614, 1613, 1611, 1610, 1609, 1608, 1607, 1606, 1605, 1604, 1603, 1602, 1601, 1600, 1599, 1598, 1597, 1596, 1595, 1594, 1593, 1592, 1591, 1590, 1589, 1588, 1587, 1586, 1585, 1584, 1583, 1582, 1581, 1580, 1579, 1578, 1577, 1576, 1575, 1574, 1573, 1572, 1571, 1570, 1569, 1568, 1567, 1566, 1565, 1564, 1563, 1562, 1561, 1560, 1559, 1558, 1557, 1556, 1555, 1554, 1553, 1546, 1540, 1535, 1531, 1528, 1526, 1525, 1524, 1523, 1522, 1521, 1520, 1519, 1518, 1512, 1507, 1503, 1500, 1498, 1497, 1496, 1495, 1494, 1493, 1492, 1491, 1486, 1482, 1479, 1477, 1476, 1475, 1474, 1473, 1472, 1471, 1467, 1464, 1462, 1461, 1460, 1459, 1458, 1457, 1454, 1452, 1451, 1450, 1449, 1448, 1446, 1445, 1444, 1443, 1442, 1441, 1440, 1439, 1438, 1437, 1436, 1435, 1434, 1433, 1432, 1431, 1430, 1429, 1428, 1427, 1426, 1425, 1424, 1423, 1422, 1421, 1420, 1419, 1418, 1417, 1416, 1415, 1414, 1413, 1412, 1411, 1410, 1409, 1408, 1407, 1406, 1405, 1404, 1403, 1402, 1401, 1400, 1399, 1398, 1392, 1387, 1383, 1380, 1378, 1377, 1376, 1375, 1374, 1373, 1372, 1371, 1366, 1362, 1359, 1357, 1356, 1355, 1354, 1353, 1352, 1351, 1347, 1344, 1342, 1341, 1340, 1339, 1338, 1337, 1334, 1332, 1331, 1330, 1329, 1328, 1326, 1325, 1324, 1323, 1322, 1321, 1320, 1319, 1318, 1317, 1316, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1308, 1307, 1306, 1305, 1304, 1303, 1302, 1301, 1300, 1299, 1298, 1297, 1296, 1295, 1294, 1293, 1292, 1291, 1290, 1289, 1288, 1287, 1282, 1278, 1275, 1273, 1272, 1271, 1270, 1269, 1268, 1267, 1263, 1260, 1258, 1257, 1256, 1255, 1254, 1253, 1250, 1248, 1247, 1246, 1245, 1244, 1242, 1241, 1240, 1239, 1238, 1237, 1236, 1235, 1234, 1233, 1232, 1231, 1230, 1229, 1228, 1227, 1226, 1225, 1224, 1223, 1222, 1221, 1220, 1219, 1218, 1217, 1216, 1215, 1214, 1213, 1212, 1211, 1207, 1204, 1202, 1201, 1200, 1199, 1198, 1197, 1194, 1192, 1191, 1190, 1189, 1188, 1186, 1185, 1184, 1183, 1182, 1181, 1180, 1179, 1178, 1177, 1176, 1175, 1174, 1173, 1172, 1171, 1170, 1169, 1168, 1167, 1166, 1165, 1164, 1163, 1162, 1159, 1157, 1156, 1155, 1154, 1153, 1151, 1150, 1149, 1148, 1147, 1146, 1145, 1144, 1143, 1142, 1141, 1140, 1139, 1138, 1137, 1136, 1135, 1134, 1133, 1131, 1130, 1129, 1128, 1127, 1126, 1125, 1124, 1123, 1122, 1121, 1120, 1119, 1118, 1117, 1116, 1115, 1114, 1113, 1112]
Starting structural reductions, iteration 1 : 1152/1234 places, 2123/2810 transitions.
Applied a total of 0 rules in 82 ms. Remains 1152 /1152 variables (removed 0) and now considering 2123/2123 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1152/1234 places, 2123/2810 transitions.
Normalized transition count is 2114 out of 2123 initially.
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-18 01:44:36] [INFO ] Computed 142 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 69320 resets, run finished after 13763 ms. (steps per millisecond=72 ) properties (out of 8) seen :16
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7081 resets, run finished after 3152 ms. (steps per millisecond=317 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 1000001 steps, including 7205 resets, run finished after 3154 ms. (steps per millisecond=317 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 5931 resets, run finished after 3016 ms. (steps per millisecond=331 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 1000001 steps, including 5930 resets, run finished after 2132 ms. (steps per millisecond=469 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 1000001 steps, including 7167 resets, run finished after 2328 ms. (steps per millisecond=429 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 1000001 steps, including 7086 resets, run finished after 2317 ms. (steps per millisecond=431 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 1000001 steps, including 7118 resets, run finished after 3167 ms. (steps per millisecond=315 ) properties (out of 7) seen :15
[2022-05-18 01:45:09] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-18 01:45:09] [INFO ] Computed 142 place invariants in 58 ms
[2022-05-18 01:45:09] [INFO ] [Real]Absence check using 136 positive place invariants in 35 ms returned sat
[2022-05-18 01:45:09] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 20 ms returned unsat
[2022-05-18 01:45:09] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:09] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 17 ms returned sat
[2022-05-18 01:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:10] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2022-05-18 01:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:45:10] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:10] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 7 ms returned unsat
[2022-05-18 01:45:10] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:10] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 14 ms returned unsat
[2022-05-18 01:45:10] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:10] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 19 ms returned sat
[2022-05-18 01:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:11] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2022-05-18 01:45:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:45:11] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:11] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 20 ms returned sat
[2022-05-18 01:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:16] [INFO ] [Nat]Absence check using state equation in 5234 ms returned unsat
[2022-05-18 01:45:17] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:45:17] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned sat
[2022-05-18 01:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:17] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2022-05-18 01:45:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:45:17] [INFO ] [Nat]Absence check using 136 positive place invariants in 37 ms returned sat
[2022-05-18 01:45:17] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned sat
[2022-05-18 01:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:18] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2022-05-18 01:45:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:45:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 170 ms returned sat
[2022-05-18 01:45:19] [INFO ] Deduced a trap composed of 512 places in 494 ms of which 1 ms to minimize.
[2022-05-18 01:45:19] [INFO ] Deduced a trap composed of 516 places in 486 ms of which 1 ms to minimize.
[2022-05-18 01:45:20] [INFO ] Deduced a trap composed of 498 places in 481 ms of which 1 ms to minimize.
[2022-05-18 01:45:20] [INFO ] Deduced a trap composed of 520 places in 461 ms of which 1 ms to minimize.
[2022-05-18 01:45:21] [INFO ] Deduced a trap composed of 522 places in 476 ms of which 1 ms to minimize.
[2022-05-18 01:45:22] [INFO ] Deduced a trap composed of 508 places in 479 ms of which 1 ms to minimize.
[2022-05-18 01:45:22] [INFO ] Deduced a trap composed of 514 places in 482 ms of which 1 ms to minimize.
[2022-05-18 01:45:23] [INFO ] Deduced a trap composed of 512 places in 478 ms of which 2 ms to minimize.
[2022-05-18 01:45:24] [INFO ] Deduced a trap composed of 516 places in 483 ms of which 1 ms to minimize.
[2022-05-18 01:45:24] [INFO ] Deduced a trap composed of 512 places in 470 ms of which 10 ms to minimize.
[2022-05-18 01:45:25] [INFO ] Deduced a trap composed of 512 places in 466 ms of which 1 ms to minimize.
[2022-05-18 01:45:25] [INFO ] Deduced a trap composed of 508 places in 493 ms of which 1 ms to minimize.
[2022-05-18 01:45:26] [INFO ] Deduced a trap composed of 522 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:45:27] [INFO ] Deduced a trap composed of 512 places in 478 ms of which 1 ms to minimize.
[2022-05-18 01:45:27] [INFO ] Deduced a trap composed of 502 places in 454 ms of which 1 ms to minimize.
[2022-05-18 01:45:28] [INFO ] Deduced a trap composed of 514 places in 484 ms of which 1 ms to minimize.
[2022-05-18 01:45:28] [INFO ] Deduced a trap composed of 512 places in 460 ms of which 1 ms to minimize.
[2022-05-18 01:45:29] [INFO ] Deduced a trap composed of 510 places in 476 ms of which 1 ms to minimize.
[2022-05-18 01:45:30] [INFO ] Deduced a trap composed of 518 places in 470 ms of which 1 ms to minimize.
[2022-05-18 01:45:30] [INFO ] Deduced a trap composed of 512 places in 469 ms of which 1 ms to minimize.
[2022-05-18 01:45:31] [INFO ] Deduced a trap composed of 526 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:45:32] [INFO ] Deduced a trap composed of 508 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:45:32] [INFO ] Deduced a trap composed of 512 places in 465 ms of which 1 ms to minimize.
[2022-05-18 01:45:33] [INFO ] Deduced a trap composed of 512 places in 458 ms of which 1 ms to minimize.
[2022-05-18 01:45:33] [INFO ] Deduced a trap composed of 514 places in 482 ms of which 1 ms to minimize.
[2022-05-18 01:45:34] [INFO ] Deduced a trap composed of 510 places in 450 ms of which 1 ms to minimize.
[2022-05-18 01:45:35] [INFO ] Deduced a trap composed of 510 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:45:35] [INFO ] Deduced a trap composed of 508 places in 473 ms of which 1 ms to minimize.
[2022-05-18 01:45:36] [INFO ] Deduced a trap composed of 514 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:45:37] [INFO ] Deduced a trap composed of 514 places in 481 ms of which 1 ms to minimize.
[2022-05-18 01:45:38] [INFO ] Deduced a trap composed of 514 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:45:39] [INFO ] Deduced a trap composed of 508 places in 466 ms of which 13 ms to minimize.
[2022-05-18 01:45:39] [INFO ] Deduced a trap composed of 512 places in 487 ms of which 1 ms to minimize.
[2022-05-18 01:45:40] [INFO ] Deduced a trap composed of 496 places in 476 ms of which 1 ms to minimize.
[2022-05-18 01:45:41] [INFO ] Deduced a trap composed of 520 places in 455 ms of which 0 ms to minimize.
[2022-05-18 01:45:41] [INFO ] Deduced a trap composed of 518 places in 445 ms of which 1 ms to minimize.
[2022-05-18 01:45:42] [INFO ] Deduced a trap composed of 516 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:45:42] [INFO ] Deduced a trap composed of 510 places in 461 ms of which 1 ms to minimize.
[2022-05-18 01:45:43] [INFO ] Deduced a trap composed of 514 places in 472 ms of which 1 ms to minimize.
[2022-05-18 01:45:43] [INFO ] Deduced a trap composed of 510 places in 486 ms of which 1 ms to minimize.
[2022-05-18 01:45:44] [INFO ] Deduced a trap composed of 514 places in 483 ms of which 1 ms to minimize.
[2022-05-18 01:45:45] [INFO ] Deduced a trap composed of 514 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:45:45] [INFO ] Deduced a trap composed of 516 places in 478 ms of which 5 ms to minimize.
[2022-05-18 01:45:46] [INFO ] Deduced a trap composed of 502 places in 475 ms of which 11 ms to minimize.
[2022-05-18 01:45:47] [INFO ] Deduced a trap composed of 518 places in 441 ms of which 2 ms to minimize.
[2022-05-18 01:45:48] [INFO ] Deduced a trap composed of 518 places in 454 ms of which 1 ms to minimize.
[2022-05-18 01:45:49] [INFO ] Deduced a trap composed of 512 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:45:50] [INFO ] Deduced a trap composed of 518 places in 485 ms of which 0 ms to minimize.
[2022-05-18 01:45:51] [INFO ] Deduced a trap composed of 510 places in 477 ms of which 1 ms to minimize.
[2022-05-18 01:45:52] [INFO ] Deduced a trap composed of 512 places in 453 ms of which 1 ms to minimize.
[2022-05-18 01:45:52] [INFO ] Deduced a trap composed of 504 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:45:54] [INFO ] Deduced a trap composed of 528 places in 481 ms of which 1 ms to minimize.
[2022-05-18 01:45:55] [INFO ] Deduced a trap composed of 510 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:45:55] [INFO ] Deduced a trap composed of 526 places in 488 ms of which 1 ms to minimize.
[2022-05-18 01:45:56] [INFO ] Deduced a trap composed of 510 places in 460 ms of which 1 ms to minimize.
[2022-05-18 01:45:57] [INFO ] Deduced a trap composed of 492 places in 485 ms of which 5 ms to minimize.
[2022-05-18 01:45:59] [INFO ] Deduced a trap composed of 496 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:46:01] [INFO ] Deduced a trap composed of 524 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:46:03] [INFO ] Deduced a trap composed of 136 places in 658 ms of which 1 ms to minimize.
[2022-05-18 01:46:03] [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.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)
[2022-05-18 01:46:03] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-18 01:46:03] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 18 ms returned unsat
[2022-05-18 01:46:03] [INFO ] [Real]Absence check using 136 positive place invariants in 34 ms returned sat
[2022-05-18 01:46:03] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 18 ms returned sat
[2022-05-18 01:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:04] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2022-05-18 01:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:04] [INFO ] [Nat]Absence check using 136 positive place invariants in 35 ms returned sat
[2022-05-18 01:46:04] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 4, 10, 1, 1] Max seen :[1, 1, 4, 4, 3, 1, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1152/1152 places, 2123/2123 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2062
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2062
Applied a total of 122 rules in 142 ms. Remains 1091 /1152 variables (removed 61) and now considering 2062/2123 (removed 61) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1152 places, 2062/2123 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:46:04] [INFO ] Computed 142 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 70355 resets, run finished after 10030 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7198 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties (out of 1) seen :3
[2022-05-18 01:46:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:46:16] [INFO ] Computed 142 place invariants in 104 ms
[2022-05-18 01:46:16] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:46:16] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-18 01:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:17] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-05-18 01:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:17] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-18 01:46:17] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-18 01:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:18] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-05-18 01:46:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:46:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 296 ms returned sat
[2022-05-18 01:46:18] [INFO ] Deduced a trap composed of 444 places in 416 ms of which 1 ms to minimize.
[2022-05-18 01:46:19] [INFO ] Deduced a trap composed of 442 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:46:19] [INFO ] Deduced a trap composed of 448 places in 404 ms of which 1 ms to minimize.
[2022-05-18 01:46:20] [INFO ] Deduced a trap composed of 449 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:46:20] [INFO ] Deduced a trap composed of 450 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:46:21] [INFO ] Deduced a trap composed of 446 places in 419 ms of which 0 ms to minimize.
[2022-05-18 01:46:21] [INFO ] Deduced a trap composed of 438 places in 413 ms of which 1 ms to minimize.
[2022-05-18 01:46:22] [INFO ] Deduced a trap composed of 430 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:46:22] [INFO ] Deduced a trap composed of 454 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:46:23] [INFO ] Deduced a trap composed of 434 places in 408 ms of which 1 ms to minimize.
[2022-05-18 01:46:23] [INFO ] Deduced a trap composed of 440 places in 411 ms of which 0 ms to minimize.
[2022-05-18 01:46:24] [INFO ] Deduced a trap composed of 426 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:46:24] [INFO ] Deduced a trap composed of 434 places in 413 ms of which 1 ms to minimize.
[2022-05-18 01:46:25] [INFO ] Deduced a trap composed of 440 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:25] [INFO ] Deduced a trap composed of 448 places in 428 ms of which 1 ms to minimize.
[2022-05-18 01:46:26] [INFO ] Deduced a trap composed of 444 places in 417 ms of which 0 ms to minimize.
[2022-05-18 01:46:26] [INFO ] Deduced a trap composed of 436 places in 408 ms of which 1 ms to minimize.
[2022-05-18 01:46:27] [INFO ] Deduced a trap composed of 434 places in 406 ms of which 0 ms to minimize.
[2022-05-18 01:46:28] [INFO ] Deduced a trap composed of 428 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:28] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2022-05-18 01:46:29] [INFO ] Deduced a trap composed of 450 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:46:29] [INFO ] Deduced a trap composed of 434 places in 406 ms of which 1 ms to minimize.
[2022-05-18 01:46:30] [INFO ] Deduced a trap composed of 446 places in 412 ms of which 0 ms to minimize.
[2022-05-18 01:46:30] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:46:31] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2022-05-18 01:46:31] [INFO ] Deduced a trap composed of 444 places in 403 ms of which 0 ms to minimize.
[2022-05-18 01:46:32] [INFO ] Deduced a trap composed of 448 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:46:32] [INFO ] Deduced a trap composed of 455 places in 416 ms of which 0 ms to minimize.
[2022-05-18 01:46:33] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 1 ms to minimize.
[2022-05-18 01:46:33] [INFO ] Deduced a trap composed of 434 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:46:34] [INFO ] Deduced a trap composed of 440 places in 407 ms of which 0 ms to minimize.
[2022-05-18 01:46:34] [INFO ] Deduced a trap composed of 442 places in 418 ms of which 0 ms to minimize.
[2022-05-18 01:46:35] [INFO ] Deduced a trap composed of 434 places in 416 ms of which 1 ms to minimize.
[2022-05-18 01:46:35] [INFO ] Deduced a trap composed of 448 places in 413 ms of which 1 ms to minimize.
[2022-05-18 01:46:36] [INFO ] Deduced a trap composed of 442 places in 407 ms of which 0 ms to minimize.
[2022-05-18 01:46:36] [INFO ] Deduced a trap composed of 446 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:37] [INFO ] Deduced a trap composed of 446 places in 420 ms of which 1 ms to minimize.
[2022-05-18 01:46:37] [INFO ] Deduced a trap composed of 430 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:46:38] [INFO ] Deduced a trap composed of 428 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:38] [INFO ] Deduced a trap composed of 436 places in 417 ms of which 1 ms to minimize.
[2022-05-18 01:46:39] [INFO ] Deduced a trap composed of 438 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:46:40] [INFO ] Deduced a trap composed of 442 places in 406 ms of which 1 ms to minimize.
[2022-05-18 01:46:40] [INFO ] Deduced a trap composed of 450 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:41] [INFO ] Deduced a trap composed of 442 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:41] [INFO ] Deduced a trap composed of 432 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:46:42] [INFO ] Deduced a trap composed of 453 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:46:45] [INFO ] Deduced a trap composed of 442 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:46:46] [INFO ] Deduced a trap composed of 436 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:48] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:46:48] [INFO ] Deduced a trap composed of 448 places in 411 ms of which 0 ms to minimize.
[2022-05-18 01:46:49] [INFO ] Deduced a trap composed of 446 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:46:49] [INFO ] Deduced a trap composed of 442 places in 414 ms of which 1 ms to minimize.
[2022-05-18 01:46:50] [INFO ] Deduced a trap composed of 448 places in 427 ms of which 0 ms to minimize.
[2022-05-18 01:46:50] [INFO ] Deduced a trap composed of 434 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:46:51] [INFO ] Deduced a trap composed of 438 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:46:51] [INFO ] Deduced a trap composed of 432 places in 404 ms of which 1 ms to minimize.
[2022-05-18 01:46:52] [INFO ] Deduced a trap composed of 444 places in 395 ms of which 1 ms to minimize.
[2022-05-18 01:46:53] [INFO ] Deduced a trap composed of 436 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:46:54] [INFO ] Deduced a trap composed of 440 places in 404 ms of which 1 ms to minimize.
[2022-05-18 01:46:55] [INFO ] Deduced a trap composed of 438 places in 416 ms of which 0 ms to minimize.
[2022-05-18 01:46:55] [INFO ] Deduced a trap composed of 436 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:46:56] [INFO ] Deduced a trap composed of 440 places in 453 ms of which 1 ms to minimize.
[2022-05-18 01:46:57] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 0 ms to minimize.
[2022-05-18 01:46:58] [INFO ] Deduced a trap composed of 444 places in 432 ms of which 1 ms to minimize.
[2022-05-18 01:46:58] [INFO ] Deduced a trap composed of 438 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:47:00] [INFO ] Deduced a trap composed of 444 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:47:01] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 0 ms to minimize.
[2022-05-18 01:47:02] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 0 ms to minimize.
[2022-05-18 01:47:02] [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)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 52 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-18 01:47:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:02] [INFO ] Computed 142 place invariants in 59 ms
[2022-05-18 01:47:03] [INFO ] Implicit Places using invariants in 924 ms returned []
[2022-05-18 01:47:03] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:03] [INFO ] Computed 142 place invariants in 54 ms
[2022-05-18 01:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:47:09] [INFO ] Implicit Places using invariants and state equation in 5664 ms returned []
Implicit Place search using SMT with State Equation took 6594 ms to find 0 implicit places.
[2022-05-18 01:47:09] [INFO ] Redundant transitions in 123 ms returned []
[2022-05-18 01:47:09] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:09] [INFO ] Computed 142 place invariants in 74 ms
[2022-05-18 01:47:10] [INFO ] Dead Transitions using invariants and state equation in 1103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-12
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:10] [INFO ] Computed 142 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 684 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2022-05-18 01:47:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:10] [INFO ] Computed 142 place invariants in 61 ms
[2022-05-18 01:47:10] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:47:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-18 01:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:47:11] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-05-18 01:47:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:47:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:47:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-18 01:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:47:12] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2022-05-18 01:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:47:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 311 ms returned sat
[2022-05-18 01:47:12] [INFO ] Deduced a trap composed of 444 places in 442 ms of which 1 ms to minimize.
[2022-05-18 01:47:13] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:47:13] [INFO ] Deduced a trap composed of 448 places in 421 ms of which 0 ms to minimize.
[2022-05-18 01:47:14] [INFO ] Deduced a trap composed of 449 places in 426 ms of which 1 ms to minimize.
[2022-05-18 01:47:15] [INFO ] Deduced a trap composed of 450 places in 416 ms of which 1 ms to minimize.
[2022-05-18 01:47:15] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2022-05-18 01:47:16] [INFO ] Deduced a trap composed of 438 places in 407 ms of which 0 ms to minimize.
[2022-05-18 01:47:16] [INFO ] Deduced a trap composed of 430 places in 439 ms of which 1 ms to minimize.
[2022-05-18 01:47:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 1091 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 48 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-18 01:47:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:16] [INFO ] Computed 142 place invariants in 54 ms
[2022-05-18 01:47:17] [INFO ] Dead Transitions using invariants and state equation in 1059 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:17] [INFO ] Computed 142 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 70458 resets, run finished after 10132 ms. (steps per millisecond=98 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6947 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 1) seen :3
[2022-05-18 01:47:29] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:47:29] [INFO ] Computed 142 place invariants in 51 ms
[2022-05-18 01:47:29] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-18 01:47:29] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-18 01:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:47:30] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-05-18 01:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:47:30] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:47:30] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-18 01:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:47:31] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2022-05-18 01:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:47:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 299 ms returned sat
[2022-05-18 01:47:31] [INFO ] Deduced a trap composed of 444 places in 460 ms of which 1 ms to minimize.
[2022-05-18 01:47:32] [INFO ] Deduced a trap composed of 442 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:47:32] [INFO ] Deduced a trap composed of 448 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:47:33] [INFO ] Deduced a trap composed of 449 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:47:33] [INFO ] Deduced a trap composed of 450 places in 400 ms of which 1 ms to minimize.
[2022-05-18 01:47:34] [INFO ] Deduced a trap composed of 446 places in 410 ms of which 0 ms to minimize.
[2022-05-18 01:47:34] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:47:35] [INFO ] Deduced a trap composed of 430 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:47:35] [INFO ] Deduced a trap composed of 454 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:47:36] [INFO ] Deduced a trap composed of 434 places in 408 ms of which 0 ms to minimize.
[2022-05-18 01:47:36] [INFO ] Deduced a trap composed of 440 places in 405 ms of which 0 ms to minimize.
[2022-05-18 01:47:37] [INFO ] Deduced a trap composed of 426 places in 419 ms of which 0 ms to minimize.
[2022-05-18 01:47:37] [INFO ] Deduced a trap composed of 434 places in 419 ms of which 1 ms to minimize.
[2022-05-18 01:47:38] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 0 ms to minimize.
[2022-05-18 01:47:38] [INFO ] Deduced a trap composed of 448 places in 414 ms of which 1 ms to minimize.
[2022-05-18 01:47:39] [INFO ] Deduced a trap composed of 444 places in 413 ms of which 1 ms to minimize.
[2022-05-18 01:47:40] [INFO ] Deduced a trap composed of 436 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:47:40] [INFO ] Deduced a trap composed of 434 places in 399 ms of which 1 ms to minimize.
[2022-05-18 01:47:41] [INFO ] Deduced a trap composed of 428 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:47:41] [INFO ] Deduced a trap composed of 438 places in 414 ms of which 1 ms to minimize.
[2022-05-18 01:47:42] [INFO ] Deduced a trap composed of 450 places in 416 ms of which 1 ms to minimize.
[2022-05-18 01:47:42] [INFO ] Deduced a trap composed of 434 places in 419 ms of which 0 ms to minimize.
[2022-05-18 01:47:43] [INFO ] Deduced a trap composed of 446 places in 406 ms of which 1 ms to minimize.
[2022-05-18 01:47:43] [INFO ] Deduced a trap composed of 446 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:47:44] [INFO ] Deduced a trap composed of 442 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:47:44] [INFO ] Deduced a trap composed of 444 places in 397 ms of which 1 ms to minimize.
[2022-05-18 01:47:45] [INFO ] Deduced a trap composed of 448 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:47:45] [INFO ] Deduced a trap composed of 455 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:47:46] [INFO ] Deduced a trap composed of 440 places in 408 ms of which 0 ms to minimize.
[2022-05-18 01:47:46] [INFO ] Deduced a trap composed of 434 places in 417 ms of which 1 ms to minimize.
[2022-05-18 01:47:47] [INFO ] Deduced a trap composed of 440 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:47:47] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2022-05-18 01:47:48] [INFO ] Deduced a trap composed of 434 places in 420 ms of which 1 ms to minimize.
[2022-05-18 01:47:48] [INFO ] Deduced a trap composed of 448 places in 431 ms of which 1 ms to minimize.
[2022-05-18 01:47:49] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:47:50] [INFO ] Deduced a trap composed of 446 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:47:50] [INFO ] Deduced a trap composed of 446 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:47:51] [INFO ] Deduced a trap composed of 430 places in 404 ms of which 1 ms to minimize.
[2022-05-18 01:47:51] [INFO ] Deduced a trap composed of 428 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:47:52] [INFO ] Deduced a trap composed of 436 places in 414 ms of which 1 ms to minimize.
[2022-05-18 01:47:52] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2022-05-18 01:47:53] [INFO ] Deduced a trap composed of 442 places in 399 ms of which 1 ms to minimize.
[2022-05-18 01:47:53] [INFO ] Deduced a trap composed of 450 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:47:54] [INFO ] Deduced a trap composed of 442 places in 402 ms of which 1 ms to minimize.
[2022-05-18 01:47:54] [INFO ] Deduced a trap composed of 432 places in 414 ms of which 1 ms to minimize.
[2022-05-18 01:47:55] [INFO ] Deduced a trap composed of 453 places in 411 ms of which 1 ms to minimize.
[2022-05-18 01:47:58] [INFO ] Deduced a trap composed of 442 places in 410 ms of which 1 ms to minimize.
[2022-05-18 01:47:59] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 1 ms to minimize.
[2022-05-18 01:48:01] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:48:01] [INFO ] Deduced a trap composed of 448 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:48:02] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:48:02] [INFO ] Deduced a trap composed of 442 places in 421 ms of which 1 ms to minimize.
[2022-05-18 01:48:03] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:48:03] [INFO ] Deduced a trap composed of 434 places in 414 ms of which 10 ms to minimize.
[2022-05-18 01:48:04] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:48:04] [INFO ] Deduced a trap composed of 432 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:48:05] [INFO ] Deduced a trap composed of 444 places in 406 ms of which 1 ms to minimize.
[2022-05-18 01:48:06] [INFO ] Deduced a trap composed of 436 places in 403 ms of which 1 ms to minimize.
[2022-05-18 01:48:07] [INFO ] Deduced a trap composed of 440 places in 408 ms of which 1 ms to minimize.
[2022-05-18 01:48:08] [INFO ] Deduced a trap composed of 438 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:48:08] [INFO ] Deduced a trap composed of 436 places in 408 ms of which 1 ms to minimize.
[2022-05-18 01:48:09] [INFO ] Deduced a trap composed of 440 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:48:10] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2022-05-18 01:48:11] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2022-05-18 01:48:11] [INFO ] Deduced a trap composed of 438 places in 415 ms of which 1 ms to minimize.
[2022-05-18 01:48:13] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2022-05-18 01:48:14] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2022-05-18 01:48:15] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2022-05-18 01:48:15] [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 1091 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 47 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 46 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-18 01:48:15] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:48:15] [INFO ] Computed 142 place invariants in 50 ms
[2022-05-18 01:48:16] [INFO ] Implicit Places using invariants in 887 ms returned []
[2022-05-18 01:48:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:48:16] [INFO ] Computed 142 place invariants in 54 ms
[2022-05-18 01:48:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:48:22] [INFO ] Implicit Places using invariants and state equation in 5940 ms returned []
Implicit Place search using SMT with State Equation took 6828 ms to find 0 implicit places.
[2022-05-18 01:48:22] [INFO ] Redundant transitions in 85 ms returned []
[2022-05-18 01:48:22] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-18 01:48:22] [INFO ] Computed 142 place invariants in 49 ms
[2022-05-18 01:48:23] [INFO ] Dead Transitions using invariants and state equation in 1062 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-12 in 73244 ms.
[2022-05-18 01:48:24] [INFO ] Flatten gal took : 353 ms
[2022-05-18 01:48:24] [INFO ] Applying decomposition
[2022-05-18 01:48:24] [INFO ] Flatten gal took : 176 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/graph16541907599035018020.txt, -o, /tmp/graph16541907599035018020.bin, -w, /tmp/graph16541907599035018020.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/graph16541907599035018020.bin, -l, -1, -v, -w, /tmp/graph16541907599035018020.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:48:24] [INFO ] Decomposing Gal with order
[2022-05-18 01:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:48:25] [INFO ] Removed a total of 4056 redundant transitions.
[2022-05-18 01:48:25] [INFO ] Flatten gal took : 723 ms
[2022-05-18 01:48:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 555 labels/synchronizations in 180 ms.
[2022-05-18 01:48:26] [INFO ] Time to serialize gal into /tmp/UpperBounds7495535651914565617.gal : 35 ms
[2022-05-18 01:48:26] [INFO ] Time to serialize properties into /tmp/UpperBounds9484583534400983747.prop : 0 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/UpperBounds7495535651914565617.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9484583534400983747.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/UpperBounds7495535651914565617.gal -t CGAL -reachable-file /tmp/UpperBounds9484583534400983747.prop --nowitness
Loading property file /tmp/UpperBounds9484583534400983747.prop.
Detected timeout of ITS tools.
[2022-05-18 02:10:19] [INFO ] Applying decomposition
[2022-05-18 02:10:20] [INFO ] Flatten gal took : 1039 ms
[2022-05-18 02:10:20] [INFO ] Decomposing Gal with order
[2022-05-18 02:10:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 02:10:21] [INFO ] Removed a total of 9599 redundant transitions.
[2022-05-18 02:10:21] [INFO ] Flatten gal took : 696 ms
[2022-05-18 02:10:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2022-05-18 02:10:25] [INFO ] Time to serialize gal into /tmp/UpperBounds3214799022933754815.gal : 28 ms
[2022-05-18 02:10:25] [INFO ] Time to serialize properties into /tmp/UpperBounds18411924642513900024.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/UpperBounds3214799022933754815.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18411924642513900024.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/UpperBounds3214799022933754815.gal -t CGAL -reachable-file /tmp/UpperBounds18411924642513900024.prop --nowitness
Loading property file /tmp/UpperBounds18411924642513900024.prop.
Detected timeout of ITS tools.
[2022-05-18 02:32:26] [INFO ] Flatten gal took : 259 ms
[2022-05-18 02:32:28] [INFO ] Input system was already deterministic with 2062 transitions.
[2022-05-18 02:32:29] [INFO ] Transformed 1091 places.
[2022-05-18 02:32:29] [INFO ] Transformed 2062 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
[2022-05-18 02:32:59] [INFO ] Time to serialize gal into /tmp/UpperBounds6336045611611716401.gal : 124 ms
[2022-05-18 02:32:59] [INFO ] Time to serialize properties into /tmp/UpperBounds17302933449333217866.prop : 0 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/UpperBounds6336045611611716401.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17302933449333217866.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/UpperBounds6336045611611716401.gal -t CGAL -reachable-file /tmp/UpperBounds17302933449333217866.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/UpperBounds17302933449333217866.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-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-COL-S10J60, 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 r179-tall-165277027100298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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