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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 94K 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-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678877571569

Running Version 202205111006
[2023-03-15 10:52:52] [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:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:52:52] [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:52:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:52:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 703 ms
[2023-03-15 10:52:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 10:52:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 29 ms.
[2023-03-15 10:52:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:52:53] [INFO ] Computed 13 place invariants in 9 ms
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:52:53] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-15 10:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 10:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:52:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-15 10:52:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-15 10:52:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2023-03-15 10:52:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-15 10:52:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-15 10:52:56] [INFO ] Added : 24 causal constraints over 6 iterations in 495 ms. Result :sat
Minimization took 49 ms.
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 10:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2023-03-15 10:52:57] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-15 10:52:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-03-15 10:52:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:52:57] [INFO ] Added : 36 causal constraints over 8 iterations in 78 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-15 10:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2023-03-15 10:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-15 10:52:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:52:57] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-15 10:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 10:52:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:52:57] [INFO ] Added : 15 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 10 ms.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:52:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-15 10:52:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 10:52:58] [INFO ] Added : 22 causal constraints over 5 iterations in 195 ms. Result :sat
Minimization took 121 ms.
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:52:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 10:52:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:52:58] [INFO ] Added : 18 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:52:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:52:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 10:52:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:52:58] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 10:52:58] [INFO ] Added : 33 causal constraints over 7 iterations in 219 ms. Result :sat
Minimization took 159 ms.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:52:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:52:59] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2023-03-15 10:52:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:52:59] [INFO ] Added : 36 causal constraints over 8 iterations in 69 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-15 10:52:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:52:59] [INFO ] Added : 20 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 130 ms
[2023-03-15 10:52:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:52:59] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 10:52:59] [INFO ] Added : 36 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-15 10:53:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-15 10:53:00] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2023-03-15 10:53:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-15 10:53:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2023-03-15 10:53:00] [INFO ] Added : 36 causal constraints over 8 iterations in 248 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-15 10:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 10:53:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:53:00] [INFO ] Added : 20 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 69 ms.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-15 10:53:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:53:00] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 23 ms.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:53:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:53:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-15 10:53:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:53:01] [INFO ] Added : 9 causal constraints over 2 iterations in 143 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, 1, 10, 2, 1, -1, -1, 2, 1, 1, 4, -1, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 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:53:01] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 224 ms.
[2023-03-15 10:53:01] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 38 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 556 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 15) seen :19
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :1
[2023-03-15 10:53:02] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 10:53:02] [INFO ] Computed 152 place invariants in 175 ms
[2023-03-15 10:53:02] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:02] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2023-03-15 10:53:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:03] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-15 10:53:03] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-15 10:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:05] [INFO ] [Nat]Absence check using state equation in 1973 ms returned sat
[2023-03-15 10:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:53:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 563 ms returned sat
[2023-03-15 10:53:07] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 374 ms.
[2023-03-15 10:53:08] [INFO ] Added : 10 causal constraints over 2 iterations in 2164 ms. Result :unknown
[2023-03-15 10:53:09] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:09] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned unsat
[2023-03-15 10:53:09] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-15 10:53:09] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:10] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2023-03-15 10:53:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:10] [INFO ] [Nat]Absence check using 145 positive place invariants in 56 ms returned sat
[2023-03-15 10:53:10] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 10:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:12] [INFO ] [Nat]Absence check using state equation in 1563 ms returned sat
[2023-03-15 10:53:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-15 10:53:12] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 615 ms.
[2023-03-15 10:53:13] [INFO ] Added : 6 causal constraints over 2 iterations in 1036 ms. Result :sat
Minimization took 478 ms.
[2023-03-15 10:53:13] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-15 10:53:13] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 10:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:14] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2023-03-15 10:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:15] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-15 10:53:15] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 10:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:17] [INFO ] [Nat]Absence check using state equation in 2335 ms returned sat
[2023-03-15 10:53:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2023-03-15 10:53:17] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 363 ms.
[2023-03-15 10:53:18] [INFO ] Added : 7 causal constraints over 2 iterations in 792 ms. Result :sat
Minimization took 745 ms.
[2023-03-15 10:53:19] [INFO ] [Real]Absence check using 145 positive place invariants in 79 ms returned sat
[2023-03-15 10:53:19] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2023-03-15 10:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:20] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2023-03-15 10:53:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:20] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-15 10:53:20] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-15 10:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:23] [INFO ] [Nat]Absence check using state equation in 2014 ms returned sat
[2023-03-15 10:53:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 354 ms returned sat
[2023-03-15 10:53:23] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 210 ms.
[2023-03-15 10:53:24] [INFO ] Deduced a trap composed of 328 places in 794 ms of which 2 ms to minimize.
[2023-03-15 10:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1273 ms
[2023-03-15 10:53:25] [INFO ] Added : 12 causal constraints over 4 iterations in 2209 ms. Result :sat
Minimization took 86 ms.
[2023-03-15 10:53:25] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:26] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 10:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:26] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2023-03-15 10:53:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:27] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:27] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 10:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:31] [INFO ] [Nat]Absence check using state equation in 4816 ms returned unknown
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned unsat
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned unsat
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive place invariants in 39 ms returned sat
[2023-03-15 10:53:32] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:33] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2023-03-15 10:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:33] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:33] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:36] [INFO ] [Nat]Absence check using state equation in 3171 ms returned sat
[2023-03-15 10:53:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2023-03-15 10:53:37] [INFO ] Deduced a trap composed of 506 places in 690 ms of which 1 ms to minimize.
[2023-03-15 10:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1399 ms
[2023-03-15 10:53:38] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 223 ms.
[2023-03-15 10:53:38] [INFO ] Added : 0 causal constraints over 0 iterations in 224 ms. Result :unknown
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned unsat
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 1, 1, 10, 2, 1, 1, 2, 1, 4] Max seen :[2, 1, 0, 0, 2, 0, 1, 1, 0, 1, 4]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 141 place count 1159 transition count 2744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 142 place count 1158 transition count 2680
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 1094 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 271 place count 1093 transition count 2679
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 1093 transition count 2679
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 1091 transition count 2677
Applied a total of 276 rules in 605 ms. Remains 1091 /1234 variables (removed 143) and now considering 2677/2810 (removed 133) transitions.
[2023-03-15 10:53:39] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2023-03-15 10:53:39] [INFO ] Computed 142 place invariants in 97 ms
[2023-03-15 10:53:41] [INFO ] Dead Transitions using invariants and state equation in 1535 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 : 1091/1234 places, 2062/2810 transitions.
Applied a total of 0 rules in 75 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1234 places, 2062/2810 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:53:41] [INFO ] Computed 142 place invariants in 53 ms
Incomplete random walk after 1000000 steps, including 70147 resets, run finished after 10622 ms. (steps per millisecond=94 ) properties (out of 4) seen :10
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7403 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7256 resets, run finished after 2087 ms. (steps per millisecond=479 ) properties (out of 2) seen :4
[2023-03-15 10:53:56] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:53:56] [INFO ] Computed 142 place invariants in 70 ms
[2023-03-15 10:53:56] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-15 10:53:56] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 10:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:56] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-15 10:53:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-15 10:53:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:57] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2023-03-15 10:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:53:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 602 ms returned sat
[2023-03-15 10:53:58] [INFO ] Deduced a trap composed of 420 places in 484 ms of which 1 ms to minimize.
[2023-03-15 10:53:59] [INFO ] Deduced a trap composed of 431 places in 483 ms of which 1 ms to minimize.
[2023-03-15 10:53:59] [INFO ] Deduced a trap composed of 443 places in 503 ms of which 1 ms to minimize.
[2023-03-15 10:54:00] [INFO ] Deduced a trap composed of 434 places in 461 ms of which 2 ms to minimize.
[2023-03-15 10:54:01] [INFO ] Deduced a trap composed of 435 places in 483 ms of which 1 ms to minimize.
[2023-03-15 10:54:01] [INFO ] Deduced a trap composed of 430 places in 520 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 436 places in 557 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 430 places in 501 ms of which 1 ms to minimize.
[2023-03-15 10:54:03] [INFO ] Deduced a trap composed of 439 places in 535 ms of which 8 ms to minimize.
[2023-03-15 10:54:04] [INFO ] Deduced a trap composed of 436 places in 517 ms of which 4 ms to minimize.
[2023-03-15 10:54:04] [INFO ] Deduced a trap composed of 431 places in 493 ms of which 1 ms to minimize.
[2023-03-15 10:54:05] [INFO ] Deduced a trap composed of 434 places in 509 ms of which 1 ms to minimize.
[2023-03-15 10:54:05] [INFO ] Deduced a trap composed of 440 places in 497 ms of which 1 ms to minimize.
[2023-03-15 10:54:06] [INFO ] Deduced a trap composed of 455 places in 508 ms of which 1 ms to minimize.
[2023-03-15 10:54:07] [INFO ] Deduced a trap composed of 444 places in 516 ms of which 1 ms to minimize.
[2023-03-15 10:54:07] [INFO ] Deduced a trap composed of 430 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:54:08] [INFO ] Deduced a trap composed of 422 places in 513 ms of which 1 ms to minimize.
[2023-03-15 10:54:08] [INFO ] Deduced a trap composed of 453 places in 510 ms of which 1 ms to minimize.
[2023-03-15 10:54:09] [INFO ] Deduced a trap composed of 442 places in 513 ms of which 0 ms to minimize.
[2023-03-15 10:54:10] [INFO ] Deduced a trap composed of 438 places in 494 ms of which 1 ms to minimize.
[2023-03-15 10:54:10] [INFO ] Deduced a trap composed of 438 places in 529 ms of which 1 ms to minimize.
[2023-03-15 10:54:13] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 15434 ms
[2023-03-15 10:54:13] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:54:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:14] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-15 10:54:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:14] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:54:14] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:15] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2023-03-15 10:54:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 388 ms returned sat
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 440 places in 460 ms of which 1 ms to minimize.
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 2 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 440 places in 454 ms of which 1 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 452 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 440 places in 452 ms of which 2 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 438 places in 505 ms of which 1 ms to minimize.
[2023-03-15 10:54:19] [INFO ] Deduced a trap composed of 440 places in 479 ms of which 0 ms to minimize.
[2023-03-15 10:54:20] [INFO ] Deduced a trap composed of 444 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:54:20] [INFO ] Deduced a trap composed of 450 places in 467 ms of which 1 ms to minimize.
[2023-03-15 10:54:21] [INFO ] Deduced a trap composed of 434 places in 459 ms of which 1 ms to minimize.
[2023-03-15 10:54:21] [INFO ] Deduced a trap composed of 436 places in 489 ms of which 3 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 438 places in 472 ms of which 1 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 440 places in 502 ms of which 2 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 434 places in 470 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-15 10:54:25] [INFO ] Deduced a trap composed of 448 places in 461 ms of which 1 ms to minimize.
[2023-03-15 10:54:28] [INFO ] Deduced a trap composed of 452 places in 471 ms of which 1 ms to minimize.
[2023-03-15 10:54:28] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:54:29] [INFO ] Deduced a trap composed of 440 places in 481 ms of which 0 ms to minimize.
[2023-03-15 10:54:29] [INFO ] Deduced a trap composed of 442 places in 475 ms of which 3 ms to minimize.
[2023-03-15 10:54:30] [INFO ] Deduced a trap composed of 434 places in 469 ms of which 1 ms to minimize.
[2023-03-15 10:54:31] [INFO ] Deduced a trap composed of 452 places in 486 ms of which 7 ms to minimize.
[2023-03-15 10:54:31] [INFO ] Deduced a trap composed of 436 places in 467 ms of which 2 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 458 places in 467 ms of which 1 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 444 places in 478 ms of which 1 ms to minimize.
[2023-03-15 10:54:33] [INFO ] Deduced a trap composed of 440 places in 486 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 448 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 440 places in 441 ms of which 0 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 442 places in 421 ms of which 1 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 446 places in 448 ms of which 0 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 436 places in 440 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 434 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:41] [INFO ] Deduced a trap composed of 432 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:54:41] [INFO ] Deduced a trap composed of 440 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:54:42] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-15 10:54:42] [INFO ] Deduced a trap composed of 434 places in 441 ms of which 1 ms to minimize.
[2023-03-15 10:54:43] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-15 10:54:44] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:44] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:45] [INFO ] Deduced a trap composed of 428 places in 432 ms of which 0 ms to minimize.
[2023-03-15 10:54:46] [INFO ] Deduced a trap composed of 448 places in 428 ms of which 1 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 434 places in 442 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 450 places in 435 ms of which 1 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 436 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:54:50] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 444 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:54:53] [INFO ] Deduced a trap composed of 446 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:54:53] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 0 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 450 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Deduced a trap composed of 424 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Deduced a trap composed of 438 places in 440 ms of which 1 ms to minimize.
[2023-03-15 10:54:57] [INFO ] Deduced a trap composed of 450 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:54:57] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:54:59] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 43906 ms
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 52 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:54:59] [INFO ] Computed 142 place invariants in 40 ms
Incomplete random walk after 1000000 steps, including 70230 resets, run finished after 10289 ms. (steps per millisecond=97 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 7267 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7207 resets, run finished after 2022 ms. (steps per millisecond=494 ) properties (out of 2) seen :4
[2023-03-15 10:55:13] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:55:13] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 10:55:14] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:55:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 10:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:14] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-03-15 10:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:14] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:55:14] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 10:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:15] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-15 10:55:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:55:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 603 ms returned sat
[2023-03-15 10:55:16] [INFO ] Deduced a trap composed of 420 places in 476 ms of which 1 ms to minimize.
[2023-03-15 10:55:16] [INFO ] Deduced a trap composed of 431 places in 462 ms of which 1 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 443 places in 479 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 434 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 435 places in 455 ms of which 1 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 430 places in 452 ms of which 1 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:55:20] [INFO ] Deduced a trap composed of 430 places in 450 ms of which 1 ms to minimize.
[2023-03-15 10:55:20] [INFO ] Deduced a trap composed of 439 places in 466 ms of which 2 ms to minimize.
[2023-03-15 10:55:21] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:55:21] [INFO ] Deduced a trap composed of 431 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:55:22] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:55:22] [INFO ] Deduced a trap composed of 440 places in 454 ms of which 1 ms to minimize.
[2023-03-15 10:55:23] [INFO ] Deduced a trap composed of 455 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:55:23] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:55:24] [INFO ] Deduced a trap composed of 430 places in 446 ms of which 0 ms to minimize.
[2023-03-15 10:55:25] [INFO ] Deduced a trap composed of 422 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:55:25] [INFO ] Deduced a trap composed of 453 places in 452 ms of which 1 ms to minimize.
[2023-03-15 10:55:26] [INFO ] Deduced a trap composed of 442 places in 450 ms of which 1 ms to minimize.
[2023-03-15 10:55:26] [INFO ] Deduced a trap composed of 438 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:55:27] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:55:30] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 14421 ms
[2023-03-15 10:55:30] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:55:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:30] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-15 10:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:31] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:55:31] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:31] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-15 10:55:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 375 ms returned sat
[2023-03-15 10:55:32] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 0 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 452 places in 427 ms of which 0 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 440 places in 437 ms of which 2 ms to minimize.
[2023-03-15 10:55:35] [INFO ] Deduced a trap composed of 438 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:55:35] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2023-03-15 10:55:36] [INFO ] Deduced a trap composed of 444 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:55:36] [INFO ] Deduced a trap composed of 450 places in 430 ms of which 1 ms to minimize.
[2023-03-15 10:55:37] [INFO ] Deduced a trap composed of 434 places in 440 ms of which 1 ms to minimize.
[2023-03-15 10:55:37] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:55:38] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 0 ms to minimize.
[2023-03-15 10:55:38] [INFO ] Deduced a trap composed of 440 places in 420 ms of which 1 ms to minimize.
[2023-03-15 10:55:39] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:55:40] [INFO ] Deduced a trap composed of 434 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:55:40] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 1 ms to minimize.
[2023-03-15 10:55:41] [INFO ] Deduced a trap composed of 448 places in 447 ms of which 1 ms to minimize.
[2023-03-15 10:55:43] [INFO ] Deduced a trap composed of 452 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:55:44] [INFO ] Deduced a trap composed of 434 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:55:44] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:55:45] [INFO ] Deduced a trap composed of 442 places in 428 ms of which 1 ms to minimize.
[2023-03-15 10:55:46] [INFO ] Deduced a trap composed of 434 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:55:46] [INFO ] Deduced a trap composed of 452 places in 423 ms of which 1 ms to minimize.
[2023-03-15 10:55:47] [INFO ] Deduced a trap composed of 436 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:55:47] [INFO ] Deduced a trap composed of 458 places in 430 ms of which 1 ms to minimize.
[2023-03-15 10:55:48] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2023-03-15 10:55:48] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2023-03-15 10:55:49] [INFO ] Deduced a trap composed of 448 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:55:49] [INFO ] Deduced a trap composed of 446 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:55:50] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:55:51] [INFO ] Deduced a trap composed of 440 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:55:52] [INFO ] Deduced a trap composed of 442 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:55:52] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:55:53] [INFO ] Deduced a trap composed of 450 places in 419 ms of which 1 ms to minimize.
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 446 places in 419 ms of which 1 ms to minimize.
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 436 places in 417 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 434 places in 441 ms of which 1 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 432 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 440 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 440 places in 435 ms of which 1 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 434 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:55:58] [INFO ] Deduced a trap composed of 444 places in 423 ms of which 1 ms to minimize.
[2023-03-15 10:55:59] [INFO ] Deduced a trap composed of 436 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:55:59] [INFO ] Deduced a trap composed of 440 places in 418 ms of which 1 ms to minimize.
[2023-03-15 10:56:00] [INFO ] Deduced a trap composed of 428 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:56:01] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:56:01] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:56:02] [INFO ] Deduced a trap composed of 446 places in 418 ms of which 0 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 434 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 450 places in 417 ms of which 1 ms to minimize.
[2023-03-15 10:56:04] [INFO ] Deduced a trap composed of 448 places in 415 ms of which 1 ms to minimize.
[2023-03-15 10:56:04] [INFO ] Deduced a trap composed of 436 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:56:05] [INFO ] Deduced a trap composed of 444 places in 419 ms of which 0 ms to minimize.
[2023-03-15 10:56:07] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2023-03-15 10:56:07] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2023-03-15 10:56:09] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2023-03-15 10:56:09] [INFO ] Deduced a trap composed of 450 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 424 places in 435 ms of which 0 ms to minimize.
[2023-03-15 10:56:11] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2023-03-15 10:56:11] [INFO ] Deduced a trap composed of 450 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:56:12] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:56:15] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 1 ms to minimize.
[2023-03-15 10:56:15] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 1 ms to minimize.
[2023-03-15 10:56:16] [INFO ] Deduced a trap composed of 446 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:56:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 49 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 10:56:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:16] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-15 10:56:17] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-15 10:56:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:17] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 10:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:56:24] [INFO ] Implicit Places using invariants and state equation in 6932 ms returned []
Implicit Place search using SMT with State Equation took 7805 ms to find 0 implicit places.
[2023-03-15 10:56:24] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-15 10:56:24] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:24] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:25] [INFO ] Computed 142 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 721 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-15 10:56:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:25] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 10:56:25] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:56:25] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:26] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-15 10:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:26] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:56:26] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:26] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-15 10:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:56:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 577 ms returned sat
[2023-03-15 10:56:28] [INFO ] Deduced a trap composed of 420 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:56:28] [INFO ] Deduced a trap composed of 431 places in 448 ms of which 1 ms to minimize.
[2023-03-15 10:56:29] [INFO ] Deduced a trap composed of 443 places in 442 ms of which 1 ms to minimize.
[2023-03-15 10:56:29] [INFO ] Deduced a trap composed of 434 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:56:30] [INFO ] Deduced a trap composed of 435 places in 453 ms of which 1 ms to minimize.
[2023-03-15 10:56:30] [INFO ] Deduced a trap composed of 430 places in 469 ms of which 0 ms to minimize.
[2023-03-15 10:56:31] [INFO ] Deduced a trap composed of 436 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:56:31] [INFO ] Deduced a trap composed of 430 places in 459 ms of which 1 ms to minimize.
[2023-03-15 10:56:31] [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 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 68 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 10:56:31] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:31] [INFO ] Computed 142 place invariants in 45 ms
[2023-03-15 10:56:32] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:32] [INFO ] Computed 142 place invariants in 39 ms
Incomplete random walk after 1000000 steps, including 70100 resets, run finished after 10009 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 7178 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :3
[2023-03-15 10:56:44] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:56:44] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-15 10:56:45] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:56:45] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 10:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:45] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-15 10:56:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:45] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:56:45] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:46] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-15 10:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:56:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 589 ms returned sat
[2023-03-15 10:56:47] [INFO ] Deduced a trap composed of 420 places in 452 ms of which 1 ms to minimize.
[2023-03-15 10:56:47] [INFO ] Deduced a trap composed of 431 places in 456 ms of which 1 ms to minimize.
[2023-03-15 10:56:48] [INFO ] Deduced a trap composed of 443 places in 469 ms of which 0 ms to minimize.
[2023-03-15 10:56:48] [INFO ] Deduced a trap composed of 434 places in 451 ms of which 1 ms to minimize.
[2023-03-15 10:56:49] [INFO ] Deduced a trap composed of 435 places in 450 ms of which 1 ms to minimize.
[2023-03-15 10:56:49] [INFO ] Deduced a trap composed of 430 places in 459 ms of which 1 ms to minimize.
[2023-03-15 10:56:50] [INFO ] Deduced a trap composed of 436 places in 452 ms of which 1 ms to minimize.
[2023-03-15 10:56:51] [INFO ] Deduced a trap composed of 430 places in 458 ms of which 1 ms to minimize.
[2023-03-15 10:56:51] [INFO ] Deduced a trap composed of 439 places in 447 ms of which 1 ms to minimize.
[2023-03-15 10:56:52] [INFO ] Deduced a trap composed of 436 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:56:52] [INFO ] Deduced a trap composed of 431 places in 451 ms of which 0 ms to minimize.
[2023-03-15 10:56:53] [INFO ] Deduced a trap composed of 434 places in 453 ms of which 1 ms to minimize.
[2023-03-15 10:56:53] [INFO ] Deduced a trap composed of 440 places in 452 ms of which 1 ms to minimize.
[2023-03-15 10:56:54] [INFO ] Deduced a trap composed of 455 places in 454 ms of which 1 ms to minimize.
[2023-03-15 10:56:54] [INFO ] Deduced a trap composed of 444 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:56:55] [INFO ] Deduced a trap composed of 430 places in 463 ms of which 4 ms to minimize.
[2023-03-15 10:56:55] [INFO ] Deduced a trap composed of 422 places in 470 ms of which 1 ms to minimize.
[2023-03-15 10:56:56] [INFO ] Deduced a trap composed of 453 places in 458 ms of which 1 ms to minimize.
[2023-03-15 10:56:56] [INFO ] Deduced a trap composed of 442 places in 459 ms of which 1 ms to minimize.
[2023-03-15 10:56:57] [INFO ] Deduced a trap composed of 438 places in 455 ms of which 1 ms to minimize.
[2023-03-15 10:56:58] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 1 ms to minimize.
[2023-03-15 10:57:01] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 14314 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 48 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 47 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 10:57:01] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:01] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-15 10:57:02] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-15 10:57:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:02] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 10:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:57:09] [INFO ] Implicit Places using invariants and state equation in 7743 ms returned []
Implicit Place search using SMT with State Equation took 8610 ms to find 0 implicit places.
[2023-03-15 10:57:10] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-15 10:57:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:10] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 10:57:11] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00 in 45650 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:11] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 713 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2023-03-15 10:57:11] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:11] [INFO ] Computed 142 place invariants in 55 ms
[2023-03-15 10:57:11] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-15 10:57:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:11] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-15 10:57:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:57:12] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:57:12] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:12] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-15 10:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 378 ms returned sat
[2023-03-15 10:57:13] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:57:14] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:57:14] [INFO ] Deduced a trap composed of 440 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:57:14] [INFO ] Deduced a trap composed of 452 places in 421 ms of which 1 ms to minimize.
[2023-03-15 10:57:15] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:57:16] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 0 ms to minimize.
[2023-03-15 10:57:16] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:57:17] [INFO ] Deduced a trap composed of 444 places in 437 ms of which 1 ms to minimize.
[2023-03-15 10:57:17] [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 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 10:57:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:17] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 10:57:18] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:18] [INFO ] Computed 142 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 70276 resets, run finished after 10033 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7251 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties (out of 1) seen :3
[2023-03-15 10:57:30] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:57:30] [INFO ] Computed 142 place invariants in 43 ms
[2023-03-15 10:57:30] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:57:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:31] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2023-03-15 10:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:57:31] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:57:31] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 10:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:31] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-15 10:57:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:57:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 389 ms returned sat
[2023-03-15 10:57:32] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:57:33] [INFO ] Deduced a trap composed of 448 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:57:33] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 0 ms to minimize.
[2023-03-15 10:57:34] [INFO ] Deduced a trap composed of 452 places in 430 ms of which 1 ms to minimize.
[2023-03-15 10:57:34] [INFO ] Deduced a trap composed of 440 places in 421 ms of which 1 ms to minimize.
[2023-03-15 10:57:35] [INFO ] Deduced a trap composed of 438 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:57:35] [INFO ] Deduced a trap composed of 440 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:57:36] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-15 10:57:36] [INFO ] Deduced a trap composed of 450 places in 420 ms of which 1 ms to minimize.
[2023-03-15 10:57:37] [INFO ] Deduced a trap composed of 434 places in 430 ms of which 0 ms to minimize.
[2023-03-15 10:57:37] [INFO ] Deduced a trap composed of 436 places in 436 ms of which 1 ms to minimize.
[2023-03-15 10:57:38] [INFO ] Deduced a trap composed of 438 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:57:38] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:57:39] [INFO ] Deduced a trap composed of 438 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:57:40] [INFO ] Deduced a trap composed of 434 places in 420 ms of which 1 ms to minimize.
[2023-03-15 10:57:40] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:57:41] [INFO ] Deduced a trap composed of 448 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:57:43] [INFO ] Deduced a trap composed of 452 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:57:44] [INFO ] Deduced a trap composed of 434 places in 432 ms of which 3 ms to minimize.
[2023-03-15 10:57:45] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:57:45] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2023-03-15 10:57:46] [INFO ] Deduced a trap composed of 434 places in 456 ms of which 1 ms to minimize.
[2023-03-15 10:57:46] [INFO ] Deduced a trap composed of 452 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:57:47] [INFO ] Deduced a trap composed of 436 places in 433 ms of which 1 ms to minimize.
[2023-03-15 10:57:47] [INFO ] Deduced a trap composed of 458 places in 470 ms of which 1 ms to minimize.
[2023-03-15 10:57:48] [INFO ] Deduced a trap composed of 444 places in 471 ms of which 1 ms to minimize.
[2023-03-15 10:57:48] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-15 10:57:49] [INFO ] Deduced a trap composed of 448 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:57:50] [INFO ] Deduced a trap composed of 446 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:57:51] [INFO ] Deduced a trap composed of 440 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:57:52] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 10:57:52] [INFO ] Deduced a trap composed of 442 places in 473 ms of which 0 ms to minimize.
[2023-03-15 10:57:53] [INFO ] Deduced a trap composed of 440 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:57:53] [INFO ] Deduced a trap composed of 450 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:57:54] [INFO ] Deduced a trap composed of 446 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:57:55] [INFO ] Deduced a trap composed of 436 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:57:55] [INFO ] Deduced a trap composed of 438 places in 472 ms of which 1 ms to minimize.
[2023-03-15 10:57:56] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:57:56] [INFO ] Deduced a trap composed of 432 places in 486 ms of which 1 ms to minimize.
[2023-03-15 10:57:57] [INFO ] Deduced a trap composed of 440 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:57:58] [INFO ] Deduced a trap composed of 440 places in 468 ms of which 1 ms to minimize.
[2023-03-15 10:57:58] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2023-03-15 10:57:59] [INFO ] Deduced a trap composed of 444 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:58:00] [INFO ] Deduced a trap composed of 436 places in 464 ms of which 0 ms to minimize.
[2023-03-15 10:58:00] [INFO ] Deduced a trap composed of 440 places in 495 ms of which 1 ms to minimize.
[2023-03-15 10:58:01] [INFO ] Deduced a trap composed of 428 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:58:02] [INFO ] Deduced a trap composed of 448 places in 453 ms of which 1 ms to minimize.
[2023-03-15 10:58:02] [INFO ] Deduced a trap composed of 436 places in 453 ms of which 1 ms to minimize.
[2023-03-15 10:58:03] [INFO ] Deduced a trap composed of 446 places in 469 ms of which 1 ms to minimize.
[2023-03-15 10:58:04] [INFO ] Deduced a trap composed of 434 places in 463 ms of which 1 ms to minimize.
[2023-03-15 10:58:04] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:58:05] [INFO ] Deduced a trap composed of 448 places in 447 ms of which 1 ms to minimize.
[2023-03-15 10:58:05] [INFO ] Deduced a trap composed of 436 places in 447 ms of which 0 ms to minimize.
[2023-03-15 10:58:06] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:58:08] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2023-03-15 10:58:09] [INFO ] Deduced a trap composed of 446 places in 457 ms of which 1 ms to minimize.
[2023-03-15 10:58:09] [INFO ] Deduced a trap composed of 446 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:58:10] [INFO ] Deduced a trap composed of 442 places in 483 ms of which 1 ms to minimize.
[2023-03-15 10:58:10] [INFO ] Deduced a trap composed of 442 places in 480 ms of which 1 ms to minimize.
[2023-03-15 10:58:11] [INFO ] Deduced a trap composed of 450 places in 438 ms of which 1 ms to minimize.
[2023-03-15 10:58:11] [INFO ] Deduced a trap composed of 440 places in 441 ms of which 0 ms to minimize.
[2023-03-15 10:58:12] [INFO ] Deduced a trap composed of 424 places in 434 ms of which 1 ms to minimize.
[2023-03-15 10:58:12] [INFO ] Deduced a trap composed of 438 places in 468 ms of which 1 ms to minimize.
[2023-03-15 10:58:13] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:58:13] [INFO ] Deduced a trap composed of 442 places in 488 ms of which 1 ms to minimize.
[2023-03-15 10:58:16] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 43961 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 52 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 44 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 10:58:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:58:16] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-15 10:58:17] [INFO ] Implicit Places using invariants in 861 ms returned []
[2023-03-15 10:58:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:58:17] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 10:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:58:23] [INFO ] Implicit Places using invariants and state equation in 6267 ms returned []
Implicit Place search using SMT with State Equation took 7132 ms to find 0 implicit places.
[2023-03-15 10:58:23] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 10:58:23] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 10:58:23] [INFO ] Computed 142 place invariants in 49 ms
[2023-03-15 10:58:24] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04 in 73408 ms.
[2023-03-15 10:58:24] [INFO ] Flatten gal took : 263 ms
[2023-03-15 10:58:24] [INFO ] Applying decomposition
[2023-03-15 10:58:25] [INFO ] Flatten gal took : 158 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/graph3714607129925411020.txt' '-o' '/tmp/graph3714607129925411020.bin' '-w' '/tmp/graph3714607129925411020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3714607129925411020.bin' '-l' '-1' '-v' '-w' '/tmp/graph3714607129925411020.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:58:26] [INFO ] Decomposing Gal with order
[2023-03-15 10:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:58:26] [INFO ] Removed a total of 4056 redundant transitions.
[2023-03-15 10:58:27] [INFO ] Flatten gal took : 684 ms
[2023-03-15 10:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 555 labels/synchronizations in 92 ms.
[2023-03-15 10:58:27] [INFO ] Time to serialize gal into /tmp/UpperBounds4770427001435959792.gal : 74 ms
[2023-03-15 10:58:27] [INFO ] Time to serialize properties into /tmp/UpperBounds9531819276238217895.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/UpperBounds4770427001435959792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9531819276238217895.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...274
Loading property file /tmp/UpperBounds9531819276238217895.prop.
Detected timeout of ITS tools.
[2023-03-15 11:20:34] [INFO ] Applying decomposition
[2023-03-15 11:20:34] [INFO ] Flatten gal took : 708 ms
[2023-03-15 11:20:35] [INFO ] Decomposing Gal with order
[2023-03-15 11:20:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:20:39] [INFO ] Removed a total of 9599 redundant transitions.
[2023-03-15 11:20:40] [INFO ] Flatten gal took : 1839 ms
[2023-03-15 11:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 125 ms.
[2023-03-15 11:20:40] [INFO ] Time to serialize gal into /tmp/UpperBounds6845536268830281459.gal : 90 ms
[2023-03-15 11:20:40] [INFO ] Time to serialize properties into /tmp/UpperBounds3768424227829750903.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6845536268830281459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3768424227829750903.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...274
Loading property file /tmp/UpperBounds3768424227829750903.prop.
Detected timeout of ITS tools.
[2023-03-15 11:43:07] [INFO ] Flatten gal took : 449 ms
[2023-03-15 11:43:11] [INFO ] Input system was already deterministic with 2062 transitions.
[2023-03-15 11:43:11] [INFO ] Transformed 1091 places.
[2023-03-15 11:43:11] [INFO ] Transformed 2062 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:43:41] [INFO ] Time to serialize gal into /tmp/UpperBounds7118870062346419803.gal : 31 ms
[2023-03-15 11:43:41] [INFO ] Time to serialize properties into /tmp/UpperBounds18264273217183174509.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/UpperBounds7118870062346419803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18264273217183174509.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-S10J60"
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-S10J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r319-tall-167873970000088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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