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-167873969900081.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-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 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-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678874757163

Running Version 202205111006
[2023-03-15 10:05:58] [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:05:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:05:58] [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:05:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:05:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2023-03-15 10:05:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-15 10:05:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-15 10:05:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:05:59] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:05:59] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:05:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:05:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2023-03-15 10:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 10:05:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 10:05:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 10:05:59] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 10:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-15 10:05:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:05:59] [INFO ] Added : 36 causal constraints over 8 iterations in 118 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:59] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:05:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:05:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2023-03-15 10:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 10:06:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:00] [INFO ] Added : 21 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:06:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 10:06:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:06:00] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2023-03-15 10:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-15 10:06:00] [INFO ] Added : 36 causal constraints over 8 iterations in 177 ms. Result :sat
Minimization took 178 ms.
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2023-03-15 10:06:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:06:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2023-03-15 10:06:01] [INFO ] Added : 23 causal constraints over 5 iterations in 491 ms. Result :sat
Minimization took 133 ms.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 10:06:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-15 10:06:01] [INFO ] Added : 36 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 23 ms.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-15 10:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 10:06:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:01] [INFO ] Added : 18 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-15 10:06:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 10:06:02] [INFO ] Added : 9 causal constraints over 2 iterations in 151 ms. Result :sat
Minimization took 188 ms.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2023-03-15 10:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-15 10:06:02] [INFO ] Added : 36 causal constraints over 8 iterations in 152 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
[2023-03-15 10:06:02] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2023-03-15 10:06:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2023-03-15 10:06:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:02] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-15 10:06:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-15 10:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 10:06:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 10:06:03] [INFO ] Added : 33 causal constraints over 7 iterations in 209 ms. Result :sat
Minimization took 64 ms.
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:03] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 10:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 10:06:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:03] [INFO ] Added : 15 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 5, 3, 10, 10, -1, 2, 10, -1, -1, 1, 5, 1]
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:06:03] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 46 ms.
[2023-03-15 10:06:03] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 707 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :30
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :18
[2023-03-15 10:06:03] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-15 10:06:03] [INFO ] Computed 82 place invariants in 43 ms
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:04] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-15 10:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 10:06:04] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:04] [INFO ] [Nat]Absence check using state equation in 602 ms returned unsat
[2023-03-15 10:06:04] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 10:06:04] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:05] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-15 10:06:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:10] [INFO ] [Nat]Absence check using state equation in 4916 ms returned unknown
[2023-03-15 10:06:10] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 10:06:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:10] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-15 10:06:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 10:06:10] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:06:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:10] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-15 10:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2023-03-15 10:06:10] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 77 ms.
[2023-03-15 10:06:11] [INFO ] Deduced a trap composed of 266 places in 189 ms of which 0 ms to minimize.
[2023-03-15 10:06:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-15 10:06:11] [INFO ] Added : 17 causal constraints over 4 iterations in 672 ms. Result :sat
Minimization took 157 ms.
[2023-03-15 10:06:11] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 10:06:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:06:11] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-15 10:06:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:12] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-15 10:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:12] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-15 10:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-15 10:06:12] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 57 ms.
[2023-03-15 10:06:13] [INFO ] Added : 9 causal constraints over 2 iterations in 210 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : [4, 10, 10, 1, 4, 1, 1, 1] Max seen :[4, 4, 3, 1, 4, 1, 1, 0]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 171 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2023-03-15 10:06:13] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2023-03-15 10:06:13] [INFO ] Computed 77 place invariants in 19 ms
[2023-03-15 10:06:13] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:13] [INFO ] Computed 77 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47328 resets, run finished after 3033 ms. (steps per millisecond=329 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4099 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5571 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 2) seen :7
[2023-03-15 10:06:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:18] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-15 10:06:18] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 10:06:18] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:18] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 10:06:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-15 10:06:18] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:19] [INFO ] [Nat]Absence check using state equation in 394 ms returned unsat
[2023-03-15 10:06:19] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 10:06:19] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:19] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-15 10:06:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:19] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 10:06:19] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:19] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-15 10:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-15 10:06:20] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:20] [INFO ] Deduced a trap composed of 128 places in 245 ms of which 0 ms to minimize.
[2023-03-15 10:06:20] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2023-03-15 10:06:20] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 0 ms to minimize.
[2023-03-15 10:06:20] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 3 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 1 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:06:21] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 0 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 1 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 0 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2023-03-15 10:06:22] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 0 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:06:23] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2023-03-15 10:06:24] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 2 ms to minimize.
[2023-03-15 10:06:24] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:24] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-15 10:06:24] [INFO ] Deduced a trap composed of 125 places in 164 ms of which 0 ms to minimize.
[2023-03-15 10:06:25] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2023-03-15 10:06:25] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 0 ms to minimize.
[2023-03-15 10:06:25] [INFO ] Deduced a trap composed of 134 places in 194 ms of which 1 ms to minimize.
[2023-03-15 10:06:25] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-15 10:06:26] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-15 10:06:26] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:06:27] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-15 10:06:27] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 1 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 4 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 1 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 0 ms to minimize.
[2023-03-15 10:06:29] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 1 ms to minimize.
[2023-03-15 10:06:29] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 0 ms to minimize.
[2023-03-15 10:06:30] [INFO ] Deduced a trap composed of 119 places in 189 ms of which 1 ms to minimize.
[2023-03-15 10:06:30] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2023-03-15 10:06:31] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:31] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2023-03-15 10:06:31] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 3 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2023-03-15 10:06:35] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 15964 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[4, 3]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 28 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:35] [INFO ] Computed 77 place invariants in 13 ms
Incomplete random walk after 1000001 steps, including 47364 resets, run finished after 2916 ms. (steps per millisecond=342 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5677 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :3
[2023-03-15 10:06:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:39] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-15 10:06:39] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 10:06:39] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:39] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-15 10:06:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:40] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-15 10:06:40] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:40] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-15 10:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-15 10:06:40] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 0 ms to minimize.
[2023-03-15 10:06:40] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:06:40] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 1 ms to minimize.
[2023-03-15 10:06:40] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:41] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 0 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:06:42] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 0 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 1 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:06:43] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 0 ms to minimize.
[2023-03-15 10:06:44] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2023-03-15 10:06:44] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 0 ms to minimize.
[2023-03-15 10:06:44] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:44] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2023-03-15 10:06:44] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2023-03-15 10:06:45] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:45] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:06:45] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2023-03-15 10:06:45] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:06:46] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:06:46] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 0 ms to minimize.
[2023-03-15 10:06:47] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2023-03-15 10:06:47] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 0 ms to minimize.
[2023-03-15 10:06:48] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 10:06:48] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:06:48] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:48] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 1 ms to minimize.
[2023-03-15 10:06:49] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 0 ms to minimize.
[2023-03-15 10:06:49] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-15 10:06:50] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:50] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2023-03-15 10:06:50] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:06:51] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:06:51] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-15 10:06:51] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:06:52] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:06:52] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:06:52] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 15321 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 10:06:55] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:55] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 10:06:56] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-15 10:06:56] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:56] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-15 10:06:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:57] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2023-03-15 10:06:57] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-15 10:06:57] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:57] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-15 10:06:57] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:57] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 458 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :3
[2023-03-15 10:06:57] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:06:57] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-15 10:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:58] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-15 10:06:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-15 10:06:58] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2023-03-15 10:06:58] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 10:06:58] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:06:59] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 1 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 1 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:07:00] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 1 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:07:01] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:07:02] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:07:03] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 0 ms to minimize.
[2023-03-15 10:07:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 10:07:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:03] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-15 10:07:03] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:03] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 1000001 steps, including 47139 resets, run finished after 2952 ms. (steps per millisecond=338 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5460 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :3
[2023-03-15 10:07:07] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:07] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 10:07:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:07] [INFO ] [Nat]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:08] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-15 10:07:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:07:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 1 ms to minimize.
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2023-03-15 10:07:08] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 1 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 1 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:07:09] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 1 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:07:10] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 1 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 0 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:07:11] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:07:12] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:07:12] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-15 10:07:12] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-15 10:07:12] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:07:12] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 0 ms to minimize.
[2023-03-15 10:07:13] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 0 ms to minimize.
[2023-03-15 10:07:13] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:07:13] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:07:13] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:07:14] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:07:14] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-15 10:07:15] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 0 ms to minimize.
[2023-03-15 10:07:15] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:07:15] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 1 ms to minimize.
[2023-03-15 10:07:16] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:07:16] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:07:17] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-15 10:07:17] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2023-03-15 10:07:17] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:07:18] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 0 ms to minimize.
[2023-03-15 10:07:18] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2023-03-15 10:07:19] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 10:07:19] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2023-03-15 10:07:19] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:07:19] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2023-03-15 10:07:20] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 1 ms to minimize.
[2023-03-15 10:07:20] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2023-03-15 10:07:23] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 15286 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 13 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 12 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 10:07:23] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:23] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 10:07:23] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-15 10:07:23] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:23] [INFO ] Computed 77 place invariants in 18 ms
[2023-03-15 10:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:07:25] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-15 10:07:25] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 10:07:25] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 10:07:25] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-15 10:07:25] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05 in 27533 ms.
[2023-03-15 10:07:25] [INFO ] Flatten gal took : 95 ms
[2023-03-15 10:07:25] [INFO ] Applying decomposition
[2023-03-15 10:07:25] [INFO ] Flatten gal took : 59 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/graph13861990383169345475.txt' '-o' '/tmp/graph13861990383169345475.bin' '-w' '/tmp/graph13861990383169345475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13861990383169345475.bin' '-l' '-1' '-v' '-w' '/tmp/graph13861990383169345475.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:07:25] [INFO ] Decomposing Gal with order
[2023-03-15 10:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:07:26] [INFO ] Removed a total of 541 redundant transitions.
[2023-03-15 10:07:26] [INFO ] Flatten gal took : 213 ms
[2023-03-15 10:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 23 ms.
[2023-03-15 10:07:26] [INFO ] Time to serialize gal into /tmp/UpperBounds18430231726125578649.gal : 12 ms
[2023-03-15 10:07:26] [INFO ] Time to serialize properties into /tmp/UpperBounds5765505380042487733.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/UpperBounds18430231726125578649.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5765505380042487733.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/UpperBounds5765505380042487733.prop.
Detected timeout of ITS tools.
[2023-03-15 10:28:03] [INFO ] Applying decomposition
[2023-03-15 10:28:03] [INFO ] Flatten gal took : 319 ms
[2023-03-15 10:28:03] [INFO ] Decomposing Gal with order
[2023-03-15 10:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:28:04] [INFO ] Removed a total of 2114 redundant transitions.
[2023-03-15 10:28:04] [INFO ] Flatten gal took : 311 ms
[2023-03-15 10:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 920 ms.
[2023-03-15 10:28:05] [INFO ] Time to serialize gal into /tmp/UpperBounds5547925466812016034.gal : 94 ms
[2023-03-15 10:28:05] [INFO ] Time to serialize properties into /tmp/UpperBounds10999988998588491049.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/UpperBounds5547925466812016034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10999988998588491049.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/UpperBounds10999988998588491049.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.48727e+09,168.239,3066724,1.01021e+06,25,7.74629e+06,2072,1408,7.37792e+06,48,1885,0
Total reachable state count : 3487273800

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J30-UpperBounds-05 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J30-UpperBounds-05 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J30-UpperBounds-05,0,222.159,3072440,1,0,7.74629e+06,2072,2920,1.3962e+07,60,1885,34008
Total runtime 1550174 ms.

BK_STOP 1678876308820

--------------------
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-S05J30"
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-S05J30, 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-167873969900081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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