Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678875952947

Running Version 202205111006
[2023-03-15 10:25:54] [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]
[2023-03-15 10:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:25:54] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 10:25:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:25:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 713 ms
[2023-03-15 10:25:55] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 10:25:55] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-15 10:25:55] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:25:55] [INFO ] Computed 13 place invariants in 8 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:25:55] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:25:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:25:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:25:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:25:55] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 10:25:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:55] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-15 10:25:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:25:55] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 3 ms to minimize.
[2023-03-15 10:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 10:25:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:25:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-15 10:25:55] [INFO ] Added : 36 causal constraints over 8 iterations in 209 ms. Result :sat
Minimization took 26 ms.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2023-03-15 10:25:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 10:25:56] [INFO ] Added : 36 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:56] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 10:25:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-15 10:25:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2023-03-15 10:25:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-15 10:25:56] [INFO ] Added : 36 causal constraints over 8 iterations in 207 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:25:57] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2023-03-15 10:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-15 10:25:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:57] [INFO ] Added : 22 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 84 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:57] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:25:57] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-15 10:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 10:25:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:25:57] [INFO ] Added : 15 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:25:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:25:57] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 19 ms.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2023-03-15 10:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-15 10:25:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:25:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-15 10:25:58] [INFO ] Added : 36 causal constraints over 8 iterations in 165 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:25:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 10:25:58] [INFO ] Added : 36 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 23 ms.
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:25:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:25:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:25:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:25:58] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2023-03-15 10:25:58] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2023-03-15 10:25:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-03-15 10:25:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:25:58] [INFO ] Added : 36 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, -1, 3, -1, -1, 4, -1, 1, -1, -1, -1, -1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 10:25:58] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 201 ms.
[2023-03-15 10:25:58] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 36 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 562 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 13) seen :13
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :2
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 :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :2
[2023-03-15 10:25:59] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-15 10:25:59] [INFO ] Computed 72 place invariants in 68 ms
[2023-03-15 10:25:59] [INFO ] [Real]Absence check using 65 positive place invariants in 75 ms returned sat
[2023-03-15 10:25:59] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:00] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2023-03-15 10:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:00] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:01] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2023-03-15 10:26:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:26:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 170 ms returned sat
[2023-03-15 10:26:01] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 0 ms to minimize.
[2023-03-15 10:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2854 ms
[2023-03-15 10:26:04] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 229 ms.
[2023-03-15 10:26:05] [INFO ] Added : 39 causal constraints over 8 iterations in 886 ms. Result :sat
Minimization took 290 ms.
[2023-03-15 10:26:05] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-15 10:26:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned unsat
[2023-03-15 10:26:05] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-15 10:26:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-15 10:26:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:06] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-15 10:26:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:08] [INFO ] [Nat]Absence check using state equation in 1650 ms returned sat
[2023-03-15 10:26:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2023-03-15 10:26:08] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 197 ms.
[2023-03-15 10:26:09] [INFO ] Added : 12 causal constraints over 3 iterations in 512 ms. Result :sat
Minimization took 299 ms.
[2023-03-15 10:26:09] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2023-03-15 10:26:09] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:10] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-15 10:26:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:10] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:26:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:10] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-15 10:26:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 481 ms returned sat
[2023-03-15 10:26:11] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 137 ms.
[2023-03-15 10:26:12] [INFO ] Deduced a trap composed of 19 places in 418 ms of which 0 ms to minimize.
[2023-03-15 10:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2023-03-15 10:26:12] [INFO ] Added : 32 causal constraints over 7 iterations in 1449 ms. Result :sat
Minimization took 392 ms.
[2023-03-15 10:26:12] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:12] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:13] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-15 10:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-15 10:26:13] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:14] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2023-03-15 10:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-15 10:26:14] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 138 ms.
[2023-03-15 10:26:14] [INFO ] Added : 7 causal constraints over 2 iterations in 383 ms. Result :sat
Minimization took 298 ms.
[2023-03-15 10:26:15] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-15 10:26:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:15] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-15 10:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:15] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:16] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2023-03-15 10:26:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 184 ms returned sat
[2023-03-15 10:26:16] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 115 ms.
[2023-03-15 10:26:17] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 1 ms to minimize.
[2023-03-15 10:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-15 10:26:17] [INFO ] Added : 32 causal constraints over 7 iterations in 1199 ms. Result :sat
Minimization took 516 ms.
[2023-03-15 10:26:18] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-15 10:26:18] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:18] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-15 10:26:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-15 10:26:19] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:19] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2023-03-15 10:26:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2023-03-15 10:26:20] [INFO ] Deduced a trap composed of 137 places in 311 ms of which 0 ms to minimize.
[2023-03-15 10:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2023-03-15 10:26:20] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 102 ms.
[2023-03-15 10:26:24] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 0 ms to minimize.
[2023-03-15 10:26:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:26:24] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-15 10:26:24] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:24] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-15 10:26:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-15 10:26:24] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:26:25] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 10:26:25] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:25] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-15 10:26:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-15 10:26:25] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:25] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-15 10:26:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 374 ms returned sat
[2023-03-15 10:26:26] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 120 ms.
[2023-03-15 10:26:27] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 0 ms to minimize.
[2023-03-15 10:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-15 10:26:27] [INFO ] Added : 27 causal constraints over 6 iterations in 1221 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 1, 4, 2147483647, 1, 2147483647, 2147483647, 1, 2147483647] Max seen :[0, 1, 1, 1, 3, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 26 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 464 transition count 1647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 461 transition count 1647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 16 place count 461 transition count 1622
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 66 place count 436 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 435 transition count 1621
Applied a total of 68 rules in 241 ms. Remains 435 /474 variables (removed 39) and now considering 1621/1650 (removed 29) transitions.
[2023-03-15 10:26:28] [INFO ] Flow matrix only has 1612 transitions (discarded 9 similar events)
// Phase 1: matrix 1612 rows 435 cols
[2023-03-15 10:26:28] [INFO ] Computed 62 place invariants in 48 ms
[2023-03-15 10:26:29] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 435/474 places, 1006/1650 transitions.
Applied a total of 0 rules in 42 ms. Remains 435 /435 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 435/474 places, 1006/1650 transitions.
Normalized transition count is 997 out of 1006 initially.
// Phase 1: matrix 997 rows 435 cols
[2023-03-15 10:26:29] [INFO ] Computed 62 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 69982 resets, run finished after 8694 ms. (steps per millisecond=115 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 9582 resets, run finished after 1689 ms. (steps per millisecond=592 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9684 resets, run finished after 1629 ms. (steps per millisecond=613 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9722 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9555 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9565 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9675 resets, run finished after 1637 ms. (steps per millisecond=610 ) properties (out of 6) seen :8
[2023-03-15 10:26:48] [INFO ] Flow matrix only has 997 transitions (discarded 9 similar events)
// Phase 1: matrix 997 rows 435 cols
[2023-03-15 10:26:48] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-15 10:26:48] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-15 10:26:48] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:26:48] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-15 10:26:48] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-15 10:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:48] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2023-03-15 10:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:26:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 14 ms returned sat
[2023-03-15 10:26:49] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 10:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:26:49] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-15 10:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:26:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2023-03-15 10:26:49] [INFO ] Deduced a trap composed of 189 places in 238 ms of which 1 ms to minimize.
[2023-03-15 10:26:49] [INFO ] Deduced a trap composed of 193 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:26:50] [INFO ] Deduced a trap composed of 193 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:26:50] [INFO ] Deduced a trap composed of 195 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:26:50] [INFO ] Deduced a trap composed of 193 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:26:50] [INFO ] Deduced a trap composed of 195 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:26:51] [INFO ] Deduced a trap composed of 191 places in 213 ms of which 0 ms to minimize.
[2023-03-15 10:26:51] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 0 ms to minimize.
[2023-03-15 10:26:51] [INFO ] Deduced a trap composed of 191 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:26:52] [INFO ] Deduced a trap composed of 189 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:26:52] [INFO ] Deduced a trap composed of 197 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:26:52] [INFO ] Deduced a trap composed of 191 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:26:53] [INFO ] Deduced a trap composed of 195 places in 234 ms of which 8 ms to minimize.
[2023-03-15 10:26:53] [INFO ] Deduced a trap composed of 189 places in 233 ms of which 0 ms to minimize.
[2023-03-15 10:26:53] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 0 ms to minimize.
[2023-03-15 10:26:54] [INFO ] Deduced a trap composed of 195 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:26:54] [INFO ] Deduced a trap composed of 191 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:26:54] [INFO ] Deduced a trap composed of 183 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:26:54] [INFO ] Deduced a trap composed of 192 places in 240 ms of which 0 ms to minimize.
[2023-03-15 10:26:55] [INFO ] Deduced a trap composed of 193 places in 211 ms of which 0 ms to minimize.
[2023-03-15 10:26:55] [INFO ] Deduced a trap composed of 195 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:26:55] [INFO ] Deduced a trap composed of 193 places in 276 ms of which 1 ms to minimize.
[2023-03-15 10:26:56] [INFO ] Deduced a trap composed of 193 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:26:56] [INFO ] Deduced a trap composed of 191 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:26:56] [INFO ] Deduced a trap composed of 183 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:26:56] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 0 ms to minimize.
[2023-03-15 10:26:57] [INFO ] Deduced a trap composed of 191 places in 226 ms of which 0 ms to minimize.
[2023-03-15 10:26:57] [INFO ] Deduced a trap composed of 189 places in 244 ms of which 0 ms to minimize.
[2023-03-15 10:26:58] [INFO ] Deduced a trap composed of 189 places in 251 ms of which 1 ms to minimize.
[2023-03-15 10:26:58] [INFO ] Deduced a trap composed of 195 places in 244 ms of which 0 ms to minimize.
[2023-03-15 10:26:59] [INFO ] Deduced a trap composed of 195 places in 245 ms of which 0 ms to minimize.
[2023-03-15 10:27:02] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 12641 ms
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-15 10:27:02] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 1, 1] Max seen :[1, 3, 1, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 435/435 places, 1006/1006 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 1004
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 433 transition count 1004
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 433 transition count 983
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 410 transition count 981
Applied a total of 50 rules in 80 ms. Remains 410 /435 variables (removed 25) and now considering 981/1006 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/435 places, 981/1006 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:27:02] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 72682 resets, run finished after 8452 ms. (steps per millisecond=118 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9457 resets, run finished after 1578 ms. (steps per millisecond=633 ) properties (out of 1) seen :3
[2023-03-15 10:27:12] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:27:12] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-15 10:27:12] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 10:27:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:27:12] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-15 10:27:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:27:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 10:27:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:27:13] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2023-03-15 10:27:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:27:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
[2023-03-15 10:27:13] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-15 10:27:13] [INFO ] Deduced a trap composed of 170 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:27:14] [INFO ] Deduced a trap composed of 170 places in 241 ms of which 1 ms to minimize.
[2023-03-15 10:27:14] [INFO ] Deduced a trap composed of 177 places in 242 ms of which 10 ms to minimize.
[2023-03-15 10:27:14] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:27:14] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:27:15] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-15 10:27:15] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 0 ms to minimize.
[2023-03-15 10:27:15] [INFO ] Deduced a trap composed of 172 places in 245 ms of which 1 ms to minimize.
[2023-03-15 10:27:16] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 0 ms to minimize.
[2023-03-15 10:27:16] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 1 ms to minimize.
[2023-03-15 10:27:16] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 1 ms to minimize.
[2023-03-15 10:27:16] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 0 ms to minimize.
[2023-03-15 10:27:17] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 0 ms to minimize.
[2023-03-15 10:27:17] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 2 ms to minimize.
[2023-03-15 10:27:18] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:27:18] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:27:18] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2023-03-15 10:27:18] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:27:19] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:27:19] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:27:19] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2023-03-15 10:27:19] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:27:20] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-15 10:27:20] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:27:20] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:27:21] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-15 10:27:21] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:27:21] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2023-03-15 10:27:22] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:27:22] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 1 ms to minimize.
[2023-03-15 10:27:23] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 10:27:23] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:27:23] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:27:26] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:27:27] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:27:27] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-15 10:27:27] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:27:28] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:27:28] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:27:28] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:27:28] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-15 10:27:29] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:27:30] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:27:30] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 10:27:30] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:27:30] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 1 ms to minimize.
[2023-03-15 10:27:31] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 10:27:31] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:27:32] [INFO ] Deduced a trap composed of 162 places in 391 ms of which 1 ms to minimize.
[2023-03-15 10:27:32] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:27:33] [INFO ] Deduced a trap composed of 158 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:27:34] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:27:34] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:27:35] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:27:35] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:27:36] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:27:36] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:27:38] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:27:38] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:27:39] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:27:39] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:27:40] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:27:40] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-15 10:27:42] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:27:43] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:27:43] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:27:43] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:27:44] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:27:44] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 10:27:44] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:27:44] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2023-03-15 10:27:45] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:27:45] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 0 ms to minimize.
[2023-03-15 10:27:45] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-15 10:27:46] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:27:46] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:27:46] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-15 10:27:47] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:27:47] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:27:47] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:27:48] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:27:48] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:27:48] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:27:49] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:27:49] [INFO ] Deduced a trap composed of 176 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:27:49] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:27:50] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 0 ms to minimize.
[2023-03-15 10:27:50] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2023-03-15 10:27:50] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:27:51] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:27:51] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2023-03-15 10:27:51] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:27:51] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:27:52] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:27:52] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:27:52] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 0 ms to minimize.
[2023-03-15 10:27:52] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:27:53] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:27:53] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 0 ms to minimize.
[2023-03-15 10:27:53] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:27:54] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-15 10:27:54] [INFO ] Deduced a trap composed of 154 places in 234 ms of which 1 ms to minimize.
[2023-03-15 10:27:54] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:27:54] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2023-03-15 10:27:55] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:27:55] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2023-03-15 10:27:55] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:27:56] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-15 10:27:56] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2023-03-15 10:27:57] [INFO ] Trap strengthening (SAT) tested/added 110/110 trap constraints in 44581 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 43 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 10:27:57] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:27:57] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-15 10:27:58] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-15 10:27:58] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:27:58] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 10:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:27:59] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2023-03-15 10:28:00] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-15 10:28:00] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:00] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-15 10:28:00] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:00] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 731 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-15 10:28:00] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:00] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 10:28:00] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 10:28:00] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:28:00] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2023-03-15 10:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:28:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-15 10:28:00] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:28:01] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-15 10:28:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:28:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 145 ms returned sat
[2023-03-15 10:28:01] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:28:01] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:28:02] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 0 ms to minimize.
[2023-03-15 10:28:02] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 0 ms to minimize.
[2023-03-15 10:28:02] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 0 ms to minimize.
[2023-03-15 10:28:02] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 1 ms to minimize.
[2023-03-15 10:28:03] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 1 ms to minimize.
[2023-03-15 10:28:03] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:28:03] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:28:04] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 0 ms to minimize.
[2023-03-15 10:28:04] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 1 ms to minimize.
[2023-03-15 10:28:04] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:28:04] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:28:05] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:28:05] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:28:05] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:28:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 10:28:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:05] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 10:28:06] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:06] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72656 resets, run finished after 8482 ms. (steps per millisecond=117 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9762 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties (out of 1) seen :3
[2023-03-15 10:28:16] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:28:16] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-15 10:28:16] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 10:28:16] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:28:16] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-15 10:28:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:28:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 10:28:16] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:28:17] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-15 10:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:28:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 157 ms returned sat
[2023-03-15 10:28:17] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 1 ms to minimize.
[2023-03-15 10:28:17] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:28:18] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 0 ms to minimize.
[2023-03-15 10:28:18] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:28:18] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:28:18] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 0 ms to minimize.
[2023-03-15 10:28:19] [INFO ] Deduced a trap composed of 162 places in 390 ms of which 0 ms to minimize.
[2023-03-15 10:28:19] [INFO ] Deduced a trap composed of 166 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:28:20] [INFO ] Deduced a trap composed of 172 places in 360 ms of which 0 ms to minimize.
[2023-03-15 10:28:20] [INFO ] Deduced a trap composed of 166 places in 338 ms of which 0 ms to minimize.
[2023-03-15 10:28:20] [INFO ] Deduced a trap composed of 170 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:28:21] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:28:21] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 0 ms to minimize.
[2023-03-15 10:28:21] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:28:22] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-15 10:28:22] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:28:22] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:28:22] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2023-03-15 10:28:23] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:28:23] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 1 ms to minimize.
[2023-03-15 10:28:23] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-15 10:28:23] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 10:28:24] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:28:24] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:28:24] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:28:25] [INFO ] Deduced a trap composed of 158 places in 260 ms of which 1 ms to minimize.
[2023-03-15 10:28:25] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:28:25] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:28:25] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:28:26] [INFO ] Deduced a trap composed of 165 places in 247 ms of which 0 ms to minimize.
[2023-03-15 10:28:26] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-15 10:28:27] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-15 10:28:27] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 10:28:28] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:28:30] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:28:31] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 10:28:31] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2023-03-15 10:28:32] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 0 ms to minimize.
[2023-03-15 10:28:32] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:28:32] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 1 ms to minimize.
[2023-03-15 10:28:33] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-15 10:28:33] [INFO ] Deduced a trap composed of 160 places in 388 ms of which 1 ms to minimize.
[2023-03-15 10:28:33] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:28:34] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:28:34] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:28:35] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2023-03-15 10:28:35] [INFO ] Deduced a trap composed of 172 places in 271 ms of which 0 ms to minimize.
[2023-03-15 10:28:35] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:28:36] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:28:36] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2023-03-15 10:28:37] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:28:38] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2023-03-15 10:28:38] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:28:39] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:28:39] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 10:28:39] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-15 10:28:40] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:28:40] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:28:42] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:28:43] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:28:43] [INFO ] Deduced a trap composed of 168 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:28:44] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:28:44] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 1 ms to minimize.
[2023-03-15 10:28:45] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 0 ms to minimize.
[2023-03-15 10:28:46] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:28:47] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:28:47] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:28:48] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:28:48] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:28:48] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:28:48] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 10:28:49] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-15 10:28:49] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:28:49] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-15 10:28:50] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-15 10:28:50] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-15 10:28:50] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2023-03-15 10:28:50] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:28:51] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:28:51] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:28:52] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2023-03-15 10:28:52] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:28:52] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:28:53] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:28:53] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:28:53] [INFO ] Deduced a trap composed of 176 places in 275 ms of which 0 ms to minimize.
[2023-03-15 10:28:54] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:28:54] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:28:54] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 10:28:55] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2023-03-15 10:28:55] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:28:55] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-15 10:28:55] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:28:56] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:28:56] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 0 ms to minimize.
[2023-03-15 10:28:56] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 10:28:56] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:28:57] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:28:57] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:28:57] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:28:58] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-15 10:28:58] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:28:58] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 0 ms to minimize.
[2023-03-15 10:28:58] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:28:59] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:28:59] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-15 10:28:59] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2023-03-15 10:29:00] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 1 ms to minimize.
[2023-03-15 10:29:00] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:29:00] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 10:29:01] [INFO ] Trap strengthening (SAT) tested/added 110/110 trap constraints in 44572 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 10:29:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:29:01] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-15 10:29:02] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-15 10:29:02] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:29:02] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 10:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:29:03] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2023-03-15 10:29:03] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 10:29:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 10:29:03] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-15 10:29:04] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08 in 63792 ms.
[2023-03-15 10:29:04] [INFO ] Flatten gal took : 202 ms
[2023-03-15 10:29:04] [INFO ] Applying decomposition
[2023-03-15 10:29:04] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4233670144445439790.txt' '-o' '/tmp/graph4233670144445439790.bin' '-w' '/tmp/graph4233670144445439790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4233670144445439790.bin' '-l' '-1' '-v' '-w' '/tmp/graph4233670144445439790.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:29:04] [INFO ] Decomposing Gal with order
[2023-03-15 10:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:29:05] [INFO ] Removed a total of 2740 redundant transitions.
[2023-03-15 10:29:05] [INFO ] Flatten gal took : 223 ms
[2023-03-15 10:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 49 ms.
[2023-03-15 10:29:05] [INFO ] Time to serialize gal into /tmp/UpperBounds12368523411339923989.gal : 24 ms
[2023-03-15 10:29:05] [INFO ] Time to serialize properties into /tmp/UpperBounds9167984241445305295.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12368523411339923989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9167984241445305295.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9167984241445305295.prop.
Detected timeout of ITS tools.
[2023-03-15 10:50:11] [INFO ] Applying decomposition
[2023-03-15 10:50:12] [INFO ] Flatten gal took : 560 ms
[2023-03-15 10:50:12] [INFO ] Decomposing Gal with order
[2023-03-15 10:50:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:50:13] [INFO ] Removed a total of 5759 redundant transitions.
[2023-03-15 10:50:26] [INFO ] Flatten gal took : 14037 ms
[2023-03-15 10:50:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 165 ms.
[2023-03-15 10:50:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16724805531496600881.gal : 82 ms
[2023-03-15 10:50:27] [INFO ] Time to serialize properties into /tmp/UpperBounds15387878315675864639.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16724805531496600881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15387878315675864639.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds15387878315675864639.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.55311e+10,1039.4,12467224,4.90025e+06,30,2.99534e+07,4995,1820,2.34714e+07,48,4749,0
Total reachable state count : 15531111405

Verifying 1 reachability properties.
Detected timeout of ITS tools.
[2023-03-15 11:11:31] [INFO ] Flatten gal took : 249 ms
[2023-03-15 11:11:33] [INFO ] Input system was already deterministic with 981 transitions.
[2023-03-15 11:11:33] [INFO ] Transformed 410 places.
[2023-03-15 11:11:33] [INFO ] Transformed 981 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 11:12:03] [INFO ] Time to serialize gal into /tmp/UpperBounds9686582515817151665.gal : 11 ms
[2023-03-15 11:12:03] [INFO ] Time to serialize properties into /tmp/UpperBounds7501120008335381024.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9686582515817151665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7501120008335381024.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-COL-S10J20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r319-tall-167873969900085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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