Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.6K Apr 30 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 04:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 04:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 95K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652954219365

Running Version 202205111006
[2022-05-19 09:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 09:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 09:57:00] [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.
[2022-05-19 09:57:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 09:57:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 677 ms
[2022-05-19 09:57:01] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-19 09:57:01] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2022-05-19 09:57:01] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 09:57:01] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 09:57:01] [INFO ] Computed 13 place invariants in 6 ms
[2022-05-19 09:57:01] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-19 09:57:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 09:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 09:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-19 09:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:57:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:57:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2022-05-19 09:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-19 09:57:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 09:57:02] [INFO ] Added : 36 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-19 09:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:57:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:57:02] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-19 09:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:57:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2022-05-19 09:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-19 09:57:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 09:57:02] [INFO ] Added : 15 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:57:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:57:02] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
[2022-05-19 09:57:03] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
[2022-05-19 09:57:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2022-05-19 09:57:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:57:03] [INFO ] Added : 36 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:57:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:57:03] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-19 09:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2022-05-19 09:57:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-19 09:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-19 09:57:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:57:03] [INFO ] Added : 20 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 13 ms.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 09:57:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:57:03] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2022-05-19 09:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-19 09:57:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:57:03] [INFO ] Added : 22 causal constraints over 5 iterations in 174 ms. Result :sat
Minimization took 121 ms.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2022-05-19 09:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-19 09:57:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:57:04] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2022-05-19 09:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-19 09:57:04] [INFO ] Added : 36 causal constraints over 8 iterations in 155 ms. Result :sat
Minimization took 202 ms.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:57:04] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2022-05-19 09:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-19 09:57:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 09:57:04] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 94 ms.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 09:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 09:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2022-05-19 09:57:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 09:57:04] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2022-05-19 09:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-19 09:57:04] [INFO ] Added : 36 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, 1, -1, 2, 10, 10, 4, -1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 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.
[2022-05-19 09:57:05] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 211 ms.
[2022-05-19 09:57:05] [INFO ] Unfolded 11 HLPN properties in 10 ms.
Deduced a syphon composed of 80 places in 84 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :3
[2022-05-19 09:57:06] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2022-05-19 09:57:06] [INFO ] Computed 192 place invariants in 353 ms
[2022-05-19 09:57:06] [INFO ] [Real]Absence check using 185 positive place invariants in 61 ms returned sat
[2022-05-19 09:57:06] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-19 09:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:08] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2022-05-19 09:57:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:08] [INFO ] [Nat]Absence check using 185 positive place invariants in 72 ms returned sat
[2022-05-19 09:57:08] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 39 ms returned sat
[2022-05-19 09:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:11] [INFO ] [Nat]Absence check using state equation in 2725 ms returned sat
[2022-05-19 09:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:57:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 109 ms returned sat
[2022-05-19 09:57:11] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 441 ms.
[2022-05-19 09:57:12] [INFO ] Added : 12 causal constraints over 3 iterations in 1078 ms. Result :sat
[2022-05-19 09:57:12] [INFO ] [Real]Absence check using 185 positive place invariants in 53 ms returned sat
[2022-05-19 09:57:12] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned unsat
[2022-05-19 09:57:13] [INFO ] [Real]Absence check using 185 positive place invariants in 62 ms returned sat
[2022-05-19 09:57:13] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2022-05-19 09:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:14] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2022-05-19 09:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:14] [INFO ] [Nat]Absence check using 185 positive place invariants in 77 ms returned sat
[2022-05-19 09:57:14] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2022-05-19 09:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:15] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2022-05-19 09:57:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 62 ms returned sat
[2022-05-19 09:57:16] [INFO ] Deduced a trap composed of 453 places in 1054 ms of which 2 ms to minimize.
[2022-05-19 09:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1345 ms
[2022-05-19 09:57:17] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 278 ms.
[2022-05-19 09:57:17] [INFO ] Added : 7 causal constraints over 2 iterations in 757 ms. Result :sat
[2022-05-19 09:57:18] [INFO ] [Real]Absence check using 185 positive place invariants in 60 ms returned sat
[2022-05-19 09:57:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned unsat
[2022-05-19 09:57:18] [INFO ] [Real]Absence check using 185 positive place invariants in 63 ms returned sat
[2022-05-19 09:57:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2022-05-19 09:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:19] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2022-05-19 09:57:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:19] [INFO ] [Nat]Absence check using 185 positive place invariants in 64 ms returned sat
[2022-05-19 09:57:19] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2022-05-19 09:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:20] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2022-05-19 09:57:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2022-05-19 09:57:21] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 275 ms.
[2022-05-19 09:57:21] [INFO ] Added : 8 causal constraints over 2 iterations in 758 ms. Result :sat
[2022-05-19 09:57:22] [INFO ] [Real]Absence check using 185 positive place invariants in 62 ms returned sat
[2022-05-19 09:57:22] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 56 ms returned unsat
[2022-05-19 09:57:22] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2022-05-19 09:57:22] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2022-05-19 09:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:23] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2022-05-19 09:57:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:23] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2022-05-19 09:57:23] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 61 ms returned sat
[2022-05-19 09:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:25] [INFO ] [Nat]Absence check using state equation in 1780 ms returned sat
[2022-05-19 09:57:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1331 ms returned sat
[2022-05-19 09:57:27] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 275 ms.
[2022-05-19 09:57:28] [INFO ] Added : 10 causal constraints over 2 iterations in 1487 ms. Result :unknown
[2022-05-19 09:57:28] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2022-05-19 09:57:28] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned sat
[2022-05-19 09:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:29] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2022-05-19 09:57:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:30] [INFO ] [Nat]Absence check using 185 positive place invariants in 59 ms returned sat
[2022-05-19 09:57:30] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 41 ms returned sat
[2022-05-19 09:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:34] [INFO ] [Nat]Absence check using state equation in 3720 ms returned sat
[2022-05-19 09:57:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 09:57:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1047 ms returned unknown
[2022-05-19 09:57:35] [INFO ] [Real]Absence check using 185 positive place invariants in 64 ms returned sat
[2022-05-19 09:57:35] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 41 ms returned sat
[2022-05-19 09:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:36] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2022-05-19 09:57:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:37] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2022-05-19 09:57:37] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 49 ms returned sat
[2022-05-19 09:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:40] [INFO ] [Nat]Absence check using state equation in 3346 ms returned sat
[2022-05-19 09:57:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 651 ms returned sat
[2022-05-19 09:57:41] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 252 ms.
[2022-05-19 09:57:41] [INFO ] Added : 10 causal constraints over 2 iterations in 644 ms. Result :unknown
[2022-05-19 09:57:42] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2022-05-19 09:57:42] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2022-05-19 09:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:43] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2022-05-19 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:43] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2022-05-19 09:57:43] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2022-05-19 09:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:44] [INFO ] [Nat]Absence check using state equation in 1582 ms returned sat
[2022-05-19 09:57:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1138 ms returned sat
[2022-05-19 09:57:46] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 234 ms.
[2022-05-19 09:57:47] [INFO ] Added : 11 causal constraints over 3 iterations in 853 ms. Result :sat
[2022-05-19 09:57:47] [INFO ] [Real]Absence check using 185 positive place invariants in 52 ms returned sat
[2022-05-19 09:57:47] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned sat
[2022-05-19 09:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:48] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2022-05-19 09:57:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:57:48] [INFO ] [Nat]Absence check using 185 positive place invariants in 63 ms returned sat
[2022-05-19 09:57:48] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned sat
[2022-05-19 09:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:57:52] [INFO ] [Nat]Absence check using state equation in 3530 ms returned sat
[2022-05-19 09:57:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 09:57:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1256 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 1, 1, 1, 2, 10, 10, 4, 2147483647] Max seen :[0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 166 out of 1614 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1604 transition count 3386
Reduce places removed 4 places and 0 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Iterating post reduction 1 with 86 rules applied. Total rules applied 100 place count 1600 transition count 3304
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 182 place count 1518 transition count 3304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 182 place count 1518 transition count 3301
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 1515 transition count 3301
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 1514 transition count 3300
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 1514 transition count 3300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 1512 transition count 3298
Applied a total of 194 rules in 653 ms. Remains 1512 /1614 variables (removed 102) and now considering 3298/3390 (removed 92) transitions.
[2022-05-19 09:57:54] [INFO ] Flow matrix only has 3289 transitions (discarded 9 similar events)
// Phase 1: matrix 3289 rows 1512 cols
[2022-05-19 09:57:54] [INFO ] Computed 182 place invariants in 161 ms
[2022-05-19 09:57:57] [INFO ] Dead Transitions using invariants and state equation in 2796 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 : 1512/1614 places, 2683/3390 transitions.
Applied a total of 0 rules in 105 ms. Remains 1512 /1512 variables (removed 0) and now considering 2683/2683 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1512/1614 places, 2683/3390 transitions.
Normalized transition count is 2674 out of 2683 initially.
// Phase 1: matrix 2674 rows 1512 cols
[2022-05-19 09:57:57] [INFO ] Computed 182 place invariants in 70 ms
Incomplete random walk after 1000000 steps, including 69343 resets, run finished after 13996 ms. (steps per millisecond=71 ) properties (out of 6) seen :14
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6536 resets, run finished after 3661 ms. (steps per millisecond=273 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6396 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 5098 resets, run finished after 2235 ms. (steps per millisecond=447 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000000 steps, including 6551 resets, run finished after 2466 ms. (steps per millisecond=405 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6457 resets, run finished after 3635 ms. (steps per millisecond=275 ) properties (out of 5) seen :12
[2022-05-19 09:58:26] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
// Phase 1: matrix 2674 rows 1512 cols
[2022-05-19 09:58:26] [INFO ] Computed 182 place invariants in 102 ms
[2022-05-19 09:58:26] [INFO ] [Real]Absence check using 176 positive place invariants in 50 ms returned sat
[2022-05-19 09:58:26] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 22 ms returned sat
[2022-05-19 09:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:58:27] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2022-05-19 09:58:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:58:27] [INFO ] [Nat]Absence check using 176 positive place invariants in 57 ms returned sat
[2022-05-19 09:58:27] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 22 ms returned unsat
[2022-05-19 09:58:27] [INFO ] [Real]Absence check using 176 positive place invariants in 54 ms returned sat
[2022-05-19 09:58:27] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 28 ms returned sat
[2022-05-19 09:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:58:28] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2022-05-19 09:58:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:58:28] [INFO ] [Nat]Absence check using 176 positive place invariants in 55 ms returned sat
[2022-05-19 09:58:28] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 26 ms returned sat
[2022-05-19 09:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:58:29] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2022-05-19 09:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:58:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 259 ms returned sat
[2022-05-19 09:58:31] [INFO ] Deduced a trap composed of 680 places in 779 ms of which 1 ms to minimize.
[2022-05-19 09:58:31] [INFO ] Deduced a trap composed of 676 places in 796 ms of which 1 ms to minimize.
[2022-05-19 09:58:32] [INFO ] Deduced a trap composed of 668 places in 734 ms of which 1 ms to minimize.
[2022-05-19 09:58:33] [INFO ] Deduced a trap composed of 666 places in 767 ms of which 1 ms to minimize.
[2022-05-19 09:58:34] [INFO ] Deduced a trap composed of 650 places in 769 ms of which 1 ms to minimize.
[2022-05-19 09:58:35] [INFO ] Deduced a trap composed of 666 places in 689 ms of which 1 ms to minimize.
[2022-05-19 09:58:36] [INFO ] Deduced a trap composed of 672 places in 714 ms of which 1 ms to minimize.
[2022-05-19 09:58:37] [INFO ] Deduced a trap composed of 668 places in 729 ms of which 2 ms to minimize.
[2022-05-19 09:58:38] [INFO ] Deduced a trap composed of 674 places in 739 ms of which 1 ms to minimize.
[2022-05-19 09:58:39] [INFO ] Deduced a trap composed of 668 places in 767 ms of which 1 ms to minimize.
[2022-05-19 09:58:39] [INFO ] Deduced a trap composed of 656 places in 784 ms of which 2 ms to minimize.
[2022-05-19 09:58:40] [INFO ] Deduced a trap composed of 672 places in 718 ms of which 1 ms to minimize.
[2022-05-19 09:58:41] [INFO ] Deduced a trap composed of 660 places in 741 ms of which 1 ms to minimize.
[2022-05-19 09:58:42] [INFO ] Deduced a trap composed of 662 places in 732 ms of which 1 ms to minimize.
[2022-05-19 09:58:43] [INFO ] Deduced a trap composed of 674 places in 740 ms of which 1 ms to minimize.
[2022-05-19 09:58:44] [INFO ] Deduced a trap composed of 668 places in 742 ms of which 1 ms to minimize.
[2022-05-19 09:58:45] [INFO ] Deduced a trap composed of 668 places in 770 ms of which 1 ms to minimize.
[2022-05-19 09:58:46] [INFO ] Deduced a trap composed of 672 places in 771 ms of which 2 ms to minimize.
[2022-05-19 09:58:47] [INFO ] Deduced a trap composed of 676 places in 758 ms of which 1 ms to minimize.
[2022-05-19 09:58:48] [INFO ] Deduced a trap composed of 662 places in 718 ms of which 2 ms to minimize.
[2022-05-19 09:58:49] [INFO ] Deduced a trap composed of 670 places in 717 ms of which 1 ms to minimize.
[2022-05-19 09:58:50] [INFO ] Deduced a trap composed of 666 places in 760 ms of which 2 ms to minimize.
[2022-05-19 09:58:52] [INFO ] Deduced a trap composed of 658 places in 722 ms of which 1 ms to minimize.
[2022-05-19 09:58:55] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 24856 ms
[2022-05-19 09:58:55] [INFO ] [Real]Absence check using 176 positive place invariants in 57 ms returned sat
[2022-05-19 09:58:55] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 29 ms returned sat
[2022-05-19 09:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:58:56] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2022-05-19 09:58:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:58:56] [INFO ] [Nat]Absence check using 176 positive place invariants in 55 ms returned sat
[2022-05-19 09:58:56] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 28 ms returned sat
[2022-05-19 09:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:59:01] [INFO ] [Nat]Absence check using state equation in 5356 ms returned unsat
[2022-05-19 09:59:01] [INFO ] [Real]Absence check using 176 positive place invariants in 54 ms returned sat
[2022-05-19 09:59:01] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 31 ms returned sat
[2022-05-19 09:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:59:02] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2022-05-19 09:59:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:59:03] [INFO ] [Nat]Absence check using 176 positive place invariants in 58 ms returned sat
[2022-05-19 09:59:03] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 30 ms returned sat
[2022-05-19 09:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:59:04] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2022-05-19 09:59:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2022-05-19 09:59:05] [INFO ] Deduced a trap composed of 670 places in 735 ms of which 5 ms to minimize.
[2022-05-19 09:59:05] [INFO ] Deduced a trap composed of 660 places in 744 ms of which 2 ms to minimize.
[2022-05-19 09:59:06] [INFO ] Deduced a trap composed of 656 places in 741 ms of which 1 ms to minimize.
[2022-05-19 09:59:07] [INFO ] Deduced a trap composed of 664 places in 766 ms of which 1 ms to minimize.
[2022-05-19 09:59:08] [INFO ] Deduced a trap composed of 664 places in 745 ms of which 1 ms to minimize.
[2022-05-19 09:59:09] [INFO ] Deduced a trap composed of 666 places in 758 ms of which 2 ms to minimize.
[2022-05-19 09:59:10] [INFO ] Deduced a trap composed of 672 places in 762 ms of which 2 ms to minimize.
[2022-05-19 09:59:11] [INFO ] Deduced a trap composed of 660 places in 734 ms of which 2 ms to minimize.
[2022-05-19 09:59:12] [INFO ] Deduced a trap composed of 650 places in 740 ms of which 2 ms to minimize.
[2022-05-19 09:59:13] [INFO ] Deduced a trap composed of 662 places in 774 ms of which 1 ms to minimize.
[2022-05-19 09:59:14] [INFO ] Deduced a trap composed of 672 places in 755 ms of which 1 ms to minimize.
[2022-05-19 09:59:15] [INFO ] Deduced a trap composed of 669 places in 752 ms of which 1 ms to minimize.
[2022-05-19 09:59:16] [INFO ] Deduced a trap composed of 652 places in 799 ms of which 1 ms to minimize.
[2022-05-19 09:59:17] [INFO ] Deduced a trap composed of 652 places in 789 ms of which 1 ms to minimize.
[2022-05-19 09:59:18] [INFO ] Deduced a trap composed of 680 places in 734 ms of which 1 ms to minimize.
[2022-05-19 09:59:19] [INFO ] Deduced a trap composed of 660 places in 737 ms of which 2 ms to minimize.
[2022-05-19 09:59:20] [INFO ] Deduced a trap composed of 664 places in 748 ms of which 1 ms to minimize.
[2022-05-19 09:59:21] [INFO ] Deduced a trap composed of 650 places in 766 ms of which 1 ms to minimize.
[2022-05-19 09:59:22] [INFO ] Deduced a trap composed of 676 places in 710 ms of which 2 ms to minimize.
[2022-05-19 09:59:23] [INFO ] Deduced a trap composed of 658 places in 692 ms of which 1 ms to minimize.
[2022-05-19 09:59:24] [INFO ] Deduced a trap composed of 674 places in 728 ms of which 1 ms to minimize.
[2022-05-19 09:59:34] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 30167 ms
[2022-05-19 09:59:34] [INFO ] [Real]Absence check using 176 positive place invariants in 54 ms returned sat
[2022-05-19 09:59:34] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 10, 4, 4, 1] Max seen :[1, 3, 4, 3, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1512/1512 places, 2683/2683 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 1512 transition count 2602
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 1431 transition count 2602
Applied a total of 162 rules in 122 ms. Remains 1431 /1512 variables (removed 81) and now considering 2602/2683 (removed 81) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1512 places, 2602/2683 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 09:59:34] [INFO ] Computed 182 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 70318 resets, run finished after 10808 ms. (steps per millisecond=92 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 6371 resets, run finished after 2156 ms. (steps per millisecond=463 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 6465 resets, run finished after 2164 ms. (steps per millisecond=462 ) properties (out of 2) seen :6
[2022-05-19 09:59:50] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 09:59:50] [INFO ] Computed 182 place invariants in 65 ms
[2022-05-19 09:59:50] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2022-05-19 09:59:50] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2022-05-19 09:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:59:51] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2022-05-19 09:59:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:59:51] [INFO ] [Real]Added 1 Read/Feed constraints in 23 ms returned sat
[2022-05-19 09:59:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:59:51] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2022-05-19 09:59:51] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-19 09:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:59:52] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2022-05-19 09:59:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2022-05-19 09:59:53] [INFO ] Deduced a trap composed of 574 places in 655 ms of which 5 ms to minimize.
[2022-05-19 09:59:54] [INFO ] Deduced a trap composed of 580 places in 656 ms of which 1 ms to minimize.
[2022-05-19 09:59:54] [INFO ] Deduced a trap composed of 582 places in 661 ms of which 1 ms to minimize.
[2022-05-19 09:59:55] [INFO ] Deduced a trap composed of 584 places in 646 ms of which 1 ms to minimize.
[2022-05-19 09:59:56] [INFO ] Deduced a trap composed of 568 places in 650 ms of which 2 ms to minimize.
[2022-05-19 09:59:57] [INFO ] Deduced a trap composed of 568 places in 669 ms of which 2 ms to minimize.
[2022-05-19 09:59:58] [INFO ] Deduced a trap composed of 562 places in 684 ms of which 1 ms to minimize.
[2022-05-19 09:59:58] [INFO ] Deduced a trap composed of 576 places in 640 ms of which 2 ms to minimize.
[2022-05-19 09:59:59] [INFO ] Deduced a trap composed of 568 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:00:00] [INFO ] Deduced a trap composed of 566 places in 640 ms of which 1 ms to minimize.
[2022-05-19 10:00:01] [INFO ] Deduced a trap composed of 566 places in 647 ms of which 1 ms to minimize.
[2022-05-19 10:00:01] [INFO ] Deduced a trap composed of 570 places in 643 ms of which 2 ms to minimize.
[2022-05-19 10:00:03] [INFO ] Deduced a trap composed of 582 places in 654 ms of which 5 ms to minimize.
[2022-05-19 10:00:03] [INFO ] Deduced a trap composed of 576 places in 651 ms of which 1 ms to minimize.
[2022-05-19 10:00:04] [INFO ] Deduced a trap composed of 580 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:00:05] [INFO ] Deduced a trap composed of 586 places in 654 ms of which 1 ms to minimize.
[2022-05-19 10:00:06] [INFO ] Deduced a trap composed of 566 places in 651 ms of which 1 ms to minimize.
[2022-05-19 10:00:07] [INFO ] Deduced a trap composed of 566 places in 643 ms of which 2 ms to minimize.
[2022-05-19 10:00:08] [INFO ] Deduced a trap composed of 572 places in 625 ms of which 1 ms to minimize.
[2022-05-19 10:00:08] [INFO ] Deduced a trap composed of 578 places in 639 ms of which 1 ms to minimize.
[2022-05-19 10:00:09] [INFO ] Deduced a trap composed of 566 places in 606 ms of which 1 ms to minimize.
[2022-05-19 10:00:12] [INFO ] Deduced a trap composed of 564 places in 680 ms of which 1 ms to minimize.
[2022-05-19 10:00:13] [INFO ] Deduced a trap composed of 560 places in 613 ms of which 1 ms to minimize.
[2022-05-19 10:00:14] [INFO ] Deduced a trap composed of 574 places in 607 ms of which 1 ms to minimize.
[2022-05-19 10:00:15] [INFO ] Deduced a trap composed of 572 places in 617 ms of which 1 ms to minimize.
[2022-05-19 10:00:16] [INFO ] Deduced a trap composed of 572 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:00:18] [INFO ] Deduced a trap composed of 566 places in 646 ms of which 1 ms to minimize.
[2022-05-19 10:00:19] [INFO ] Deduced a trap composed of 580 places in 632 ms of which 1 ms to minimize.
[2022-05-19 10:00:20] [INFO ] Deduced a trap composed of 572 places in 636 ms of which 2 ms to minimize.
[2022-05-19 10:00:21] [INFO ] Deduced a trap composed of 568 places in 632 ms of which 1 ms to minimize.
[2022-05-19 10:00:22] [INFO ] Deduced a trap composed of 578 places in 647 ms of which 2 ms to minimize.
[2022-05-19 10:00:23] [INFO ] Deduced a trap composed of 572 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:00:23] [INFO ] Deduced a trap composed of 584 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:00:24] [INFO ] Deduced a trap composed of 572 places in 631 ms of which 1 ms to minimize.
[2022-05-19 10:00:26] [INFO ] Deduced a trap composed of 576 places in 652 ms of which 1 ms to minimize.
[2022-05-19 10:00:27] [INFO ] Deduced a trap composed of 582 places in 639 ms of which 1 ms to minimize.
[2022-05-19 10:00:28] [INFO ] Deduced a trap composed of 580 places in 650 ms of which 1 ms to minimize.
[2022-05-19 10:00:29] [INFO ] Deduced a trap composed of 582 places in 604 ms of which 1 ms to minimize.
[2022-05-19 10:00:31] [INFO ] Deduced a trap composed of 570 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:00:34] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 41994 ms
[2022-05-19 10:00:34] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 10:00:34] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2022-05-19 10:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:00:35] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2022-05-19 10:00:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:00:35] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 10:00:35] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-19 10:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:00:36] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2022-05-19 10:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 663 ms returned sat
[2022-05-19 10:00:37] [INFO ] Deduced a trap composed of 560 places in 647 ms of which 1 ms to minimize.
[2022-05-19 10:00:38] [INFO ] Deduced a trap composed of 572 places in 650 ms of which 1 ms to minimize.
[2022-05-19 10:00:39] [INFO ] Deduced a trap composed of 564 places in 669 ms of which 1 ms to minimize.
[2022-05-19 10:00:40] [INFO ] Deduced a trap composed of 564 places in 614 ms of which 2 ms to minimize.
[2022-05-19 10:00:41] [INFO ] Deduced a trap composed of 568 places in 632 ms of which 1 ms to minimize.
[2022-05-19 10:00:41] [INFO ] Deduced a trap composed of 572 places in 637 ms of which 1 ms to minimize.
[2022-05-19 10:00:42] [INFO ] Deduced a trap composed of 582 places in 628 ms of which 1 ms to minimize.
[2022-05-19 10:00:43] [INFO ] Deduced a trap composed of 582 places in 606 ms of which 1 ms to minimize.
[2022-05-19 10:00:43] [INFO ] Deduced a trap composed of 562 places in 634 ms of which 1 ms to minimize.
[2022-05-19 10:00:44] [INFO ] Deduced a trap composed of 570 places in 627 ms of which 1 ms to minimize.
[2022-05-19 10:00:45] [INFO ] Deduced a trap composed of 576 places in 656 ms of which 1 ms to minimize.
[2022-05-19 10:00:46] [INFO ] Deduced a trap composed of 582 places in 647 ms of which 1 ms to minimize.
[2022-05-19 10:00:46] [INFO ] Deduced a trap composed of 574 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:00:47] [INFO ] Deduced a trap composed of 562 places in 670 ms of which 2 ms to minimize.
[2022-05-19 10:00:48] [INFO ] Deduced a trap composed of 576 places in 638 ms of which 1 ms to minimize.
[2022-05-19 10:00:49] [INFO ] Deduced a trap composed of 566 places in 638 ms of which 2 ms to minimize.
[2022-05-19 10:00:49] [INFO ] Deduced a trap composed of 574 places in 609 ms of which 2 ms to minimize.
[2022-05-19 10:00:50] [INFO ] Deduced a trap composed of 570 places in 629 ms of which 2 ms to minimize.
[2022-05-19 10:00:51] [INFO ] Deduced a trap composed of 570 places in 664 ms of which 1 ms to minimize.
[2022-05-19 10:00:52] [INFO ] Deduced a trap composed of 570 places in 640 ms of which 2 ms to minimize.
[2022-05-19 10:00:53] [INFO ] Deduced a trap composed of 580 places in 618 ms of which 2 ms to minimize.
[2022-05-19 10:00:53] [INFO ] Deduced a trap composed of 578 places in 605 ms of which 1 ms to minimize.
[2022-05-19 10:00:54] [INFO ] Deduced a trap composed of 572 places in 620 ms of which 1 ms to minimize.
[2022-05-19 10:00:55] [INFO ] Deduced a trap composed of 564 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:00:56] [INFO ] Deduced a trap composed of 556 places in 639 ms of which 1 ms to minimize.
[2022-05-19 10:00:59] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 21962 ms
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 3]
Support contains 2 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 89 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 88 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-19 10:00:59] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:00:59] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:01:00] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2022-05-19 10:01:00] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:01] [INFO ] Computed 182 place invariants in 71 ms
[2022-05-19 10:01:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:12] [INFO ] Implicit Places using invariants and state equation in 11118 ms returned []
Implicit Place search using SMT with State Equation took 12659 ms to find 0 implicit places.
[2022-05-19 10:01:12] [INFO ] Redundant transitions in 124 ms returned []
[2022-05-19 10:01:12] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:12] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 10:01:13] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-09
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:13] [INFO ] Computed 182 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 706 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :3
[2022-05-19 10:01:13] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:14] [INFO ] Computed 182 place invariants in 64 ms
[2022-05-19 10:01:14] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 10:01:14] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-19 10:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:01:15] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2022-05-19 10:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:15] [INFO ] [Real]Added 1 Read/Feed constraints in 19 ms returned sat
[2022-05-19 10:01:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:01:15] [INFO ] [Nat]Absence check using 175 positive place invariants in 52 ms returned sat
[2022-05-19 10:01:15] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-19 10:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:01:16] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2022-05-19 10:01:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 76 ms returned sat
[2022-05-19 10:01:17] [INFO ] Deduced a trap composed of 574 places in 632 ms of which 2 ms to minimize.
[2022-05-19 10:01:17] [INFO ] Deduced a trap composed of 580 places in 641 ms of which 1 ms to minimize.
[2022-05-19 10:01:18] [INFO ] Deduced a trap composed of 582 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:01:19] [INFO ] Deduced a trap composed of 584 places in 629 ms of which 1 ms to minimize.
[2022-05-19 10:01:20] [INFO ] Deduced a trap composed of 568 places in 637 ms of which 1 ms to minimize.
[2022-05-19 10:01:20] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3762 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 74 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-19 10:01:20] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:20] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-19 10:01:21] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:21] [INFO ] Computed 182 place invariants in 60 ms
Incomplete random walk after 1000000 steps, including 70285 resets, run finished after 11247 ms. (steps per millisecond=88 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6407 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 1) seen :3
[2022-05-19 10:01:35] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:01:35] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:01:35] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 10:01:35] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-19 10:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:01:36] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2022-05-19 10:01:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:36] [INFO ] [Real]Added 1 Read/Feed constraints in 19 ms returned sat
[2022-05-19 10:01:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:01:36] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2022-05-19 10:01:36] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-19 10:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:01:37] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2022-05-19 10:01:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2022-05-19 10:01:38] [INFO ] Deduced a trap composed of 574 places in 633 ms of which 1 ms to minimize.
[2022-05-19 10:01:39] [INFO ] Deduced a trap composed of 580 places in 636 ms of which 1 ms to minimize.
[2022-05-19 10:01:40] [INFO ] Deduced a trap composed of 582 places in 652 ms of which 1 ms to minimize.
[2022-05-19 10:01:40] [INFO ] Deduced a trap composed of 584 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:01:41] [INFO ] Deduced a trap composed of 568 places in 659 ms of which 2 ms to minimize.
[2022-05-19 10:01:42] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2022-05-19 10:01:43] [INFO ] Deduced a trap composed of 562 places in 694 ms of which 2 ms to minimize.
[2022-05-19 10:01:44] [INFO ] Deduced a trap composed of 576 places in 620 ms of which 1 ms to minimize.
[2022-05-19 10:01:44] [INFO ] Deduced a trap composed of 568 places in 654 ms of which 1 ms to minimize.
[2022-05-19 10:01:45] [INFO ] Deduced a trap composed of 566 places in 630 ms of which 1 ms to minimize.
[2022-05-19 10:01:46] [INFO ] Deduced a trap composed of 566 places in 637 ms of which 1 ms to minimize.
[2022-05-19 10:01:46] [INFO ] Deduced a trap composed of 570 places in 611 ms of which 1 ms to minimize.
[2022-05-19 10:01:48] [INFO ] Deduced a trap composed of 582 places in 636 ms of which 1 ms to minimize.
[2022-05-19 10:01:49] [INFO ] Deduced a trap composed of 576 places in 629 ms of which 1 ms to minimize.
[2022-05-19 10:01:49] [INFO ] Deduced a trap composed of 580 places in 631 ms of which 1 ms to minimize.
[2022-05-19 10:01:50] [INFO ] Deduced a trap composed of 586 places in 658 ms of which 1 ms to minimize.
[2022-05-19 10:01:51] [INFO ] Deduced a trap composed of 566 places in 647 ms of which 1 ms to minimize.
[2022-05-19 10:01:52] [INFO ] Deduced a trap composed of 566 places in 640 ms of which 1 ms to minimize.
[2022-05-19 10:01:53] [INFO ] Deduced a trap composed of 572 places in 642 ms of which 1 ms to minimize.
[2022-05-19 10:01:54] [INFO ] Deduced a trap composed of 578 places in 637 ms of which 1 ms to minimize.
[2022-05-19 10:01:54] [INFO ] Deduced a trap composed of 566 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:01:57] [INFO ] Deduced a trap composed of 564 places in 626 ms of which 1 ms to minimize.
[2022-05-19 10:01:58] [INFO ] Deduced a trap composed of 560 places in 648 ms of which 1 ms to minimize.
[2022-05-19 10:02:00] [INFO ] Deduced a trap composed of 574 places in 638 ms of which 1 ms to minimize.
[2022-05-19 10:02:01] [INFO ] Deduced a trap composed of 572 places in 625 ms of which 1 ms to minimize.
[2022-05-19 10:02:02] [INFO ] Deduced a trap composed of 572 places in 633 ms of which 1 ms to minimize.
[2022-05-19 10:02:04] [INFO ] Deduced a trap composed of 566 places in 604 ms of which 2 ms to minimize.
[2022-05-19 10:02:05] [INFO ] Deduced a trap composed of 580 places in 652 ms of which 2 ms to minimize.
[2022-05-19 10:02:06] [INFO ] Deduced a trap composed of 572 places in 631 ms of which 1 ms to minimize.
[2022-05-19 10:02:07] [INFO ] Deduced a trap composed of 568 places in 643 ms of which 1 ms to minimize.
[2022-05-19 10:02:07] [INFO ] Deduced a trap composed of 578 places in 646 ms of which 2 ms to minimize.
[2022-05-19 10:02:08] [INFO ] Deduced a trap composed of 572 places in 651 ms of which 3 ms to minimize.
[2022-05-19 10:02:09] [INFO ] Deduced a trap composed of 584 places in 638 ms of which 1 ms to minimize.
[2022-05-19 10:02:10] [INFO ] Deduced a trap composed of 572 places in 650 ms of which 1 ms to minimize.
[2022-05-19 10:02:12] [INFO ] Deduced a trap composed of 576 places in 610 ms of which 1 ms to minimize.
[2022-05-19 10:02:13] [INFO ] Deduced a trap composed of 582 places in 629 ms of which 2 ms to minimize.
[2022-05-19 10:02:14] [INFO ] Deduced a trap composed of 580 places in 646 ms of which 1 ms to minimize.
[2022-05-19 10:02:15] [INFO ] Deduced a trap composed of 582 places in 642 ms of which 1 ms to minimize.
[2022-05-19 10:02:17] [INFO ] Deduced a trap composed of 570 places in 610 ms of which 1 ms to minimize.
[2022-05-19 10:02:20] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 42224 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 77 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 79 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-19 10:02:20] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:02:20] [INFO ] Computed 182 place invariants in 83 ms
[2022-05-19 10:02:21] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2022-05-19 10:02:21] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:02:21] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 10:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:02:32] [INFO ] Implicit Places using invariants and state equation in 10697 ms returned []
Implicit Place search using SMT with State Equation took 12175 ms to find 0 implicit places.
[2022-05-19 10:02:32] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-19 10:02:32] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:02:32] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:02:34] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-09 in 80270 ms.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-14
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:02:34] [INFO ] Computed 182 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 736 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :3
[2022-05-19 10:02:34] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-19 10:02:34] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:02:34] [INFO ] [Real]Absence check using 175 positive place invariants in 49 ms returned sat
[2022-05-19 10:02:34] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2022-05-19 10:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:02:35] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2022-05-19 10:02:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:02:35] [INFO ] [Nat]Absence check using 175 positive place invariants in 51 ms returned sat
[2022-05-19 10:02:35] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-19 10:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:02:36] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2022-05-19 10:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:02:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 655 ms returned sat
[2022-05-19 10:02:37] [INFO ] Deduced a trap composed of 560 places in 630 ms of which 1 ms to minimize.
[2022-05-19 10:02:38] [INFO ] Deduced a trap composed of 572 places in 650 ms of which 1 ms to minimize.
[2022-05-19 10:02:39] [INFO ] Deduced a trap composed of 564 places in 644 ms of which 1 ms to minimize.
[2022-05-19 10:02:39] [INFO ] Deduced a trap composed of 564 places in 649 ms of which 1 ms to minimize.
[2022-05-19 10:02:40] [INFO ] Deduced a trap composed of 568 places in 647 ms of which 2 ms to minimize.
[2022-05-19 10:02:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1431 transition count 2601
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1430 transition count 2601
Applied a total of 2 rules in 94 ms. Remains 1430 /1431 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
[2022-05-19 10:02:40] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:02:41] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:02:42] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1431 places, 2601/2602 transitions.
Normalized transition count is 2592 out of 2601 initially.
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:02:42] [INFO ] Computed 182 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 72762 resets, run finished after 11448 ms. (steps per millisecond=87 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 6517 resets, run finished after 2210 ms. (steps per millisecond=452 ) properties (out of 1) seen :3
[2022-05-19 10:02:56] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:02:56] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 10:02:56] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-19 10:02:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-19 10:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:02:57] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2022-05-19 10:02:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:02:57] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2022-05-19 10:02:57] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2022-05-19 10:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:02:58] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2022-05-19 10:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:02:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1114 ms returned sat
[2022-05-19 10:03:00] [INFO ] Deduced a trap composed of 568 places in 675 ms of which 1 ms to minimize.
[2022-05-19 10:03:00] [INFO ] Deduced a trap composed of 572 places in 675 ms of which 2 ms to minimize.
[2022-05-19 10:03:01] [INFO ] Deduced a trap composed of 570 places in 669 ms of which 1 ms to minimize.
[2022-05-19 10:03:02] [INFO ] Deduced a trap composed of 580 places in 628 ms of which 1 ms to minimize.
[2022-05-19 10:03:03] [INFO ] Deduced a trap composed of 589 places in 695 ms of which 1 ms to minimize.
[2022-05-19 10:03:03] [INFO ] Deduced a trap composed of 578 places in 646 ms of which 1 ms to minimize.
[2022-05-19 10:03:04] [INFO ] Deduced a trap composed of 587 places in 703 ms of which 1 ms to minimize.
[2022-05-19 10:03:05] [INFO ] Deduced a trap composed of 577 places in 695 ms of which 2 ms to minimize.
[2022-05-19 10:03:06] [INFO ] Deduced a trap composed of 589 places in 704 ms of which 1 ms to minimize.
[2022-05-19 10:03:06] [INFO ] Deduced a trap composed of 587 places in 647 ms of which 1 ms to minimize.
[2022-05-19 10:03:07] [INFO ] Deduced a trap composed of 577 places in 646 ms of which 1 ms to minimize.
[2022-05-19 10:03:08] [INFO ] Deduced a trap composed of 569 places in 690 ms of which 1 ms to minimize.
[2022-05-19 10:03:09] [INFO ] Deduced a trap composed of 578 places in 617 ms of which 1 ms to minimize.
[2022-05-19 10:03:10] [INFO ] Deduced a trap composed of 560 places in 636 ms of which 1 ms to minimize.
[2022-05-19 10:03:10] [INFO ] Deduced a trap composed of 570 places in 627 ms of which 1 ms to minimize.
[2022-05-19 10:03:11] [INFO ] Deduced a trap composed of 572 places in 611 ms of which 1 ms to minimize.
[2022-05-19 10:03:12] [INFO ] Deduced a trap composed of 576 places in 608 ms of which 2 ms to minimize.
[2022-05-19 10:03:13] [INFO ] Deduced a trap composed of 584 places in 608 ms of which 1 ms to minimize.
[2022-05-19 10:03:16] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 16705 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 69 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 84 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-19 10:03:16] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:03:16] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 10:03:17] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2022-05-19 10:03:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:03:17] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-19 10:03:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:03:29] [INFO ] Implicit Places using invariants and state equation in 12171 ms returned []
Implicit Place search using SMT with State Equation took 13701 ms to find 0 implicit places.
[2022-05-19 10:03:30] [INFO ] Redundant transitions in 65 ms returned []
[2022-05-19 10:03:30] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-19 10:03:30] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 10:03:31] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-14 in 57537 ms.
[2022-05-19 10:03:31] [INFO ] Flatten gal took : 312 ms
[2022-05-19 10:03:32] [INFO ] Applying decomposition
[2022-05-19 10:03:32] [INFO ] Flatten gal took : 234 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/graph5410988628711029440.txt' '-o' '/tmp/graph5410988628711029440.bin' '-w' '/tmp/graph5410988628711029440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5410988628711029440.bin' '-l' '-1' '-v' '-w' '/tmp/graph5410988628711029440.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:03:32] [INFO ] Decomposing Gal with order
[2022-05-19 10:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:03:33] [INFO ] Removed a total of 4719 redundant transitions.
[2022-05-19 10:03:33] [INFO ] Flatten gal took : 704 ms
[2022-05-19 10:03:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 139 ms.
[2022-05-19 10:03:33] [INFO ] Time to serialize gal into /tmp/UpperBounds1121629976049568563.gal : 37 ms
[2022-05-19 10:03:33] [INFO ] Time to serialize properties into /tmp/UpperBounds279773533511489614.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/UpperBounds1121629976049568563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds279773533511489614.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...273
Loading property file /tmp/UpperBounds279773533511489614.prop.
Detected timeout of ITS tools.
[2022-05-19 10:25:44] [INFO ] Applying decomposition
[2022-05-19 10:25:44] [INFO ] Flatten gal took : 282 ms
[2022-05-19 10:25:45] [INFO ] Decomposing Gal with order
[2022-05-19 10:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:25:45] [INFO ] Removed a total of 11519 redundant transitions.
[2022-05-19 10:25:46] [INFO ] Flatten gal took : 609 ms
[2022-05-19 10:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2022-05-19 10:25:46] [INFO ] Time to serialize gal into /tmp/UpperBounds2625218156350275503.gal : 97 ms
[2022-05-19 10:25:46] [INFO ] Time to serialize properties into /tmp/UpperBounds16051384431502690578.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/UpperBounds2625218156350275503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16051384431502690578.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds16051384431502690578.prop.
Detected timeout of ITS tools.
[2022-05-19 10:48:05] [INFO ] Flatten gal took : 1261 ms
[2022-05-19 10:48:12] [INFO ] Input system was already deterministic with 2602 transitions.
[2022-05-19 10:48:12] [INFO ] Transformed 1431 places.
[2022-05-19 10:48:12] [INFO ] Transformed 2602 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
[2022-05-19 10:48:42] [INFO ] Time to serialize gal into /tmp/UpperBounds4912041548811844230.gal : 20 ms
[2022-05-19 10:48:42] [INFO ] Time to serialize properties into /tmp/UpperBounds12827167749523685791.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/UpperBounds4912041548811844230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12827167749523685791.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/UpperBounds12827167749523685791.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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J80, 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 r168-tall-165277017200805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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