Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 12K Feb 26 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678877515907

Running Version 202205111006
[2023-03-15 10:51:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 10:51:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:51:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 10:51:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:51:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 769 ms
[2023-03-15 10:51:58] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 10:51:58] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-15 10:51:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:51:58] [INFO ] Computed 13 place invariants in 11 ms
FORMULA PolyORBNT-COL-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:51:58] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 10:51:58] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 10:51:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:51:58] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:51:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:51:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:51:58] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:51:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:51:59] [INFO ] Deduced a trap composed of 13 places in 693 ms of which 36 ms to minimize.
[2023-03-15 10:51:59] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2023-03-15 10:51:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 807 ms
[2023-03-15 10:51:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:51:59] [INFO ] Added : 36 causal constraints over 8 iterations in 501 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 10:51:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:51:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:51:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:51:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:52:00] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Added 1 Read/Feed constraints in 15 ms returned sat
[2023-03-15 10:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 175 ms
[2023-03-15 10:52:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-15 10:52:00] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2023-03-15 10:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-15 10:52:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 10:52:00] [INFO ] Added : 20 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 81 ms.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-15 10:52:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:52:01] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 10:52:01] [INFO ] Added : 36 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 10:52:01] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-15 10:52:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:52:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-15 10:52:01] [INFO ] Added : 36 causal constraints over 8 iterations in 164 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-15 10:52:01] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2023-03-15 10:52:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2023-03-15 10:52:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:52:01] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:01] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-15 10:52:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:52:02] [INFO ] Added : 22 causal constraints over 5 iterations in 173 ms. Result :sat
Minimization took 121 ms.
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:52:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:52:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:52:02] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:52:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:52:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:52:02] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-15 10:52:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:52:02] [INFO ] Added : 15 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 4, -1, -1, -1, -1, 10, -1, 1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 10:52:02] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 205 ms.
[2023-03-15 10:52:02] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 27 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 11) seen :4
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :3
[2023-03-15 10:52:03] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-15 10:52:03] [INFO ] Computed 112 place invariants in 130 ms
[2023-03-15 10:52:03] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-15 10:52:03] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:04] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-15 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:04] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-15 10:52:04] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:05] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2023-03-15 10:52:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:52:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 758 ms returned sat
[2023-03-15 10:52:06] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 255 ms.
[2023-03-15 10:52:08] [INFO ] Deduced a trap composed of 19 places in 579 ms of which 0 ms to minimize.
[2023-03-15 10:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 753 ms
[2023-03-15 10:52:08] [INFO ] Added : 28 causal constraints over 6 iterations in 1885 ms. Result :sat
Minimization took 1077 ms.
[2023-03-15 10:52:09] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2023-03-15 10:52:09] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-15 10:52:09] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-15 10:52:09] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:10] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-15 10:52:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:10] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2023-03-15 10:52:10] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:15] [INFO ] [Nat]Absence check using state equation in 4846 ms returned unknown
[2023-03-15 10:52:15] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-15 10:52:15] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:15] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-15 10:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:16] [INFO ] [Nat]Absence check using 105 positive place invariants in 35 ms returned sat
[2023-03-15 10:52:16] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 10:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:16] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-15 10:52:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 835 ms returned sat
[2023-03-15 10:52:18] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 508 ms.
[2023-03-15 10:52:19] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 1 ms to minimize.
[2023-03-15 10:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-15 10:52:19] [INFO ] Added : 32 causal constraints over 7 iterations in 2030 ms. Result :sat
Minimization took 1229 ms.
[2023-03-15 10:52:21] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-15 10:52:21] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-15 10:52:21] [INFO ] [Real]Absence check using 105 positive place invariants in 26 ms returned sat
[2023-03-15 10:52:21] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:21] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-15 10:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:21] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-15 10:52:21] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:22] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2023-03-15 10:52:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 688 ms returned sat
[2023-03-15 10:52:23] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 175 ms.
[2023-03-15 10:52:24] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 1 ms to minimize.
[2023-03-15 10:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2023-03-15 10:52:25] [INFO ] Added : 27 causal constraints over 6 iterations in 1444 ms. Result :sat
Minimization took 1776 ms.
[2023-03-15 10:52:26] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-15 10:52:26] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:27] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-15 10:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:27] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-15 10:52:27] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:28] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2023-03-15 10:52:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 789 ms returned sat
[2023-03-15 10:52:29] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 172 ms.
[2023-03-15 10:52:31] [INFO ] Deduced a trap composed of 19 places in 525 ms of which 1 ms to minimize.
[2023-03-15 10:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 969 ms
[2023-03-15 10:52:32] [INFO ] Deduced a trap composed of 203 places in 447 ms of which 1 ms to minimize.
[2023-03-15 10:52:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2023-03-15 10:52:32] [INFO ] Added : 32 causal constraints over 7 iterations in 2910 ms. Result :sat
Minimization took 64 ms.
[2023-03-15 10:52:32] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-15 10:52:32] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 10:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:33] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-15 10:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:33] [INFO ] [Nat]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-15 10:52:33] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:38] [INFO ] [Nat]Absence check using state equation in 4877 ms returned unknown
[2023-03-15 10:52:38] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-15 10:52:38] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-15 10:52:38] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-15 10:52:38] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:39] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-15 10:52:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:39] [INFO ] [Nat]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-15 10:52:39] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:40] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2023-03-15 10:52:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-15 10:52:40] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 159 ms.
[2023-03-15 10:52:40] [INFO ] Added : 7 causal constraints over 2 iterations in 492 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 4, 2147483647, 1, 2147483647, 2147483647, 10, 1, 1] Max seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 46 out of 854 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 45 rules applied. Total rules applied 57 place count 842 transition count 2185
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 799 transition count 2182
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 796 transition count 2182
Applied a total of 106 rules in 277 ms. Remains 796 /854 variables (removed 58) and now considering 2182/2230 (removed 48) transitions.
[2023-03-15 10:52:41] [INFO ] Flow matrix only has 2173 transitions (discarded 9 similar events)
// Phase 1: matrix 2173 rows 796 cols
[2023-03-15 10:52:41] [INFO ] Computed 102 place invariants in 76 ms
[2023-03-15 10:52:43] [INFO ] Dead Transitions using invariants and state equation in 1593 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 : 796/854 places, 1567/2230 transitions.
Applied a total of 0 rules in 78 ms. Remains 796 /796 variables (removed 0) and now considering 1567/1567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 796/854 places, 1567/2230 transitions.
Normalized transition count is 1558 out of 1567 initially.
// Phase 1: matrix 1558 rows 796 cols
[2023-03-15 10:52:43] [INFO ] Computed 102 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 67445 resets, run finished after 10156 ms. (steps per millisecond=98 ) properties (out of 6) seen :11
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8112 resets, run finished after 1886 ms. (steps per millisecond=530 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8172 resets, run finished after 2366 ms. (steps per millisecond=422 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8196 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8196 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8109 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties (out of 5) seen :7
[2023-03-15 10:53:03] [INFO ] Flow matrix only has 1558 transitions (discarded 9 similar events)
// Phase 1: matrix 1558 rows 796 cols
[2023-03-15 10:53:03] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 15 ms returned unsat
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive place invariants in 24 ms returned sat
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 11 ms returned unsat
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2023-03-15 10:53:03] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-15 10:53:04] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-15 10:53:04] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-15 10:53:04] [INFO ] [Real]Absence check using 96 positive place invariants in 24 ms returned sat
[2023-03-15 10:53:04] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-15 10:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:04] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-15 10:53:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:04] [INFO ] [Nat]Absence check using 96 positive place invariants in 24 ms returned sat
[2023-03-15 10:53:04] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-15 10:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:05] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-15 10:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:53:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 353 ms returned sat
[2023-03-15 10:53:05] [INFO ] Deduced a trap composed of 349 places in 364 ms of which 1 ms to minimize.
[2023-03-15 10:53:06] [INFO ] Deduced a trap composed of 358 places in 366 ms of which 0 ms to minimize.
[2023-03-15 10:53:06] [INFO ] Deduced a trap composed of 354 places in 363 ms of which 0 ms to minimize.
[2023-03-15 10:53:07] [INFO ] Deduced a trap composed of 346 places in 367 ms of which 0 ms to minimize.
[2023-03-15 10:53:07] [INFO ] Deduced a trap composed of 358 places in 370 ms of which 0 ms to minimize.
[2023-03-15 10:53:08] [INFO ] Deduced a trap composed of 362 places in 356 ms of which 1 ms to minimize.
[2023-03-15 10:53:08] [INFO ] Deduced a trap composed of 350 places in 363 ms of which 0 ms to minimize.
[2023-03-15 10:53:09] [INFO ] Deduced a trap composed of 358 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:53:09] [INFO ] Deduced a trap composed of 357 places in 354 ms of which 1 ms to minimize.
[2023-03-15 10:53:10] [INFO ] Deduced a trap composed of 358 places in 336 ms of which 1 ms to minimize.
[2023-03-15 10:53:10] [INFO ] Deduced a trap composed of 356 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:53:10] [INFO ] Deduced a trap composed of 358 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:53:11] [INFO ] Deduced a trap composed of 368 places in 326 ms of which 0 ms to minimize.
[2023-03-15 10:53:11] [INFO ] Deduced a trap composed of 348 places in 325 ms of which 1 ms to minimize.
[2023-03-15 10:53:12] [INFO ] Deduced a trap composed of 362 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:53:12] [INFO ] Deduced a trap composed of 352 places in 337 ms of which 5 ms to minimize.
[2023-03-15 10:53:12] [INFO ] Deduced a trap composed of 356 places in 325 ms of which 0 ms to minimize.
[2023-03-15 10:53:14] [INFO ] Deduced a trap composed of 360 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:53:15] [INFO ] Deduced a trap composed of 364 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:53:16] [INFO ] Deduced a trap composed of 358 places in 342 ms of which 1 ms to minimize.
[2023-03-15 10:53:16] [INFO ] Deduced a trap composed of 362 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:53:19] [INFO ] Deduced a trap composed of 358 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:53:20] [INFO ] Deduced a trap composed of 358 places in 329 ms of which 0 ms to minimize.
[2023-03-15 10:53:23] [INFO ] Deduced a trap composed of 346 places in 325 ms of which 1 ms to minimize.
[2023-03-15 10:53:26] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 21455 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 10] Max seen :[1, 1, 1, 1, 3]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 796/796 places, 1567/1567 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 796 transition count 1566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 795 transition count 1566
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 795 transition count 1525
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 753 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 751 transition count 1522
Applied a total of 90 rules in 226 ms. Remains 751 /796 variables (removed 45) and now considering 1522/1567 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/796 places, 1522/1567 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:53:27] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70290 resets, run finished after 9703 ms. (steps per millisecond=103 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8050 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 1) seen :3
[2023-03-15 10:53:38] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:53:38] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-15 10:53:38] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 10:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:39] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-15 10:53:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:39] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-15 10:53:39] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 10:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:39] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-15 10:53:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:53:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 336 ms returned sat
[2023-03-15 10:53:40] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-15 10:53:40] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 0 ms to minimize.
[2023-03-15 10:53:41] [INFO ] Deduced a trap composed of 306 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:53:41] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2023-03-15 10:53:42] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 0 ms to minimize.
[2023-03-15 10:53:42] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 0 ms to minimize.
[2023-03-15 10:53:42] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 0 ms to minimize.
[2023-03-15 10:53:43] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2023-03-15 10:53:43] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2023-03-15 10:53:43] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:53:44] [INFO ] Deduced a trap composed of 310 places in 305 ms of which 1 ms to minimize.
[2023-03-15 10:53:44] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2023-03-15 10:53:45] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2023-03-15 10:53:45] [INFO ] Deduced a trap composed of 292 places in 302 ms of which 4 ms to minimize.
[2023-03-15 10:53:45] [INFO ] Deduced a trap composed of 318 places in 293 ms of which 1 ms to minimize.
[2023-03-15 10:53:46] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:53:46] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:53:46] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:53:47] [INFO ] Deduced a trap composed of 312 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:53:47] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 0 ms to minimize.
[2023-03-15 10:53:48] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:53:48] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2023-03-15 10:53:49] [INFO ] Deduced a trap composed of 294 places in 318 ms of which 2 ms to minimize.
[2023-03-15 10:53:49] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 2 ms to minimize.
[2023-03-15 10:53:49] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:53:50] [INFO ] Deduced a trap composed of 310 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:53:50] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 2 ms to minimize.
[2023-03-15 10:53:51] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 0 ms to minimize.
[2023-03-15 10:53:51] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2023-03-15 10:53:53] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:53:53] [INFO ] Deduced a trap composed of 290 places in 308 ms of which 0 ms to minimize.
[2023-03-15 10:53:54] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:53:55] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:53:55] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 1 ms to minimize.
[2023-03-15 10:53:56] [INFO ] Deduced a trap composed of 310 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:53:56] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 1 ms to minimize.
[2023-03-15 10:53:56] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 1 ms to minimize.
[2023-03-15 10:53:57] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 0 ms to minimize.
[2023-03-15 10:53:57] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:53:58] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 0 ms to minimize.
[2023-03-15 10:53:59] [INFO ] Deduced a trap composed of 298 places in 343 ms of which 0 ms to minimize.
[2023-03-15 10:54:00] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:54:00] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 1 ms to minimize.
[2023-03-15 10:54:03] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 1 ms to minimize.
[2023-03-15 10:54:03] [INFO ] Deduced a trap composed of 300 places in 317 ms of which 0 ms to minimize.
[2023-03-15 10:54:06] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 26775 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 32 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 31 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 10:54:06] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:06] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 10:54:07] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-15 10:54:07] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:07] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-15 10:54:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:54:11] [INFO ] Implicit Places using invariants and state equation in 4255 ms returned []
Implicit Place search using SMT with State Equation took 4824 ms to find 0 implicit places.
[2023-03-15 10:54:11] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-15 10:54:11] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:11] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-15 10:54:12] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:12] [INFO ] Computed 102 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 679 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-15 10:54:12] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:12] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-15 10:54:12] [INFO ] [Real]Absence check using 95 positive place invariants in 29 ms returned sat
[2023-03-15 10:54:12] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 10:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:13] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-15 10:54:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:13] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 10:54:13] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:13] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2023-03-15 10:54:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:54:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 337 ms returned sat
[2023-03-15 10:54:14] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
[2023-03-15 10:54:14] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 0 ms to minimize.
[2023-03-15 10:54:15] [INFO ] Deduced a trap composed of 306 places in 333 ms of which 1 ms to minimize.
[2023-03-15 10:54:15] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 0 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 0 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 292 places in 325 ms of which 0 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 310 places in 331 ms of which 0 ms to minimize.
[2023-03-15 10:54:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 30 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 10:54:18] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:18] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-15 10:54:19] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:19] [INFO ] Computed 102 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 70240 resets, run finished after 9527 ms. (steps per millisecond=104 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8294 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 1) seen :3
[2023-03-15 10:54:30] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:30] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-15 10:54:30] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 10:54:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:31] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-15 10:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:31] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 10:54:31] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 10:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:31] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-15 10:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 336 ms returned sat
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 0 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 306 places in 292 ms of which 0 ms to minimize.
[2023-03-15 10:54:33] [INFO ] Deduced a trap composed of 306 places in 323 ms of which 0 ms to minimize.
[2023-03-15 10:54:33] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 0 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 292 places in 305 ms of which 0 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 310 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 0 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 292 places in 298 ms of which 1 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 318 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 312 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 298 places in 294 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2023-03-15 10:54:41] [INFO ] Deduced a trap composed of 294 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:54:41] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:54:41] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2023-03-15 10:54:42] [INFO ] Deduced a trap composed of 310 places in 311 ms of which 1 ms to minimize.
[2023-03-15 10:54:42] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 0 ms to minimize.
[2023-03-15 10:54:43] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 1 ms to minimize.
[2023-03-15 10:54:43] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2023-03-15 10:54:45] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-15 10:54:45] [INFO ] Deduced a trap composed of 290 places in 311 ms of which 1 ms to minimize.
[2023-03-15 10:54:46] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 0 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 310 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:54:51] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 1 ms to minimize.
[2023-03-15 10:54:51] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 0 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 0 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 0 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 298 places in 311 ms of which 0 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 0 ms to minimize.
[2023-03-15 10:54:58] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 26794 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 30 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 31 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 10:54:58] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:59] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-15 10:54:59] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-15 10:54:59] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:54:59] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-15 10:55:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:55:02] [INFO ] Implicit Places using invariants and state equation in 3113 ms returned []
Implicit Place search using SMT with State Equation took 3703 ms to find 0 implicit places.
[2023-03-15 10:55:02] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-15 10:55:02] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 10:55:02] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-15 10:55:03] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13 in 50894 ms.
[2023-03-15 10:55:03] [INFO ] Flatten gal took : 212 ms
[2023-03-15 10:55:03] [INFO ] Applying decomposition
[2023-03-15 10:55:04] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10188241791595955316.txt' '-o' '/tmp/graph10188241791595955316.bin' '-w' '/tmp/graph10188241791595955316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10188241791595955316.bin' '-l' '-1' '-v' '-w' '/tmp/graph10188241791595955316.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:55:04] [INFO ] Decomposing Gal with order
[2023-03-15 10:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:55:04] [INFO ] Removed a total of 3397 redundant transitions.
[2023-03-15 10:55:04] [INFO ] Flatten gal took : 318 ms
[2023-03-15 10:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 418 labels/synchronizations in 71 ms.
[2023-03-15 10:55:04] [INFO ] Time to serialize gal into /tmp/UpperBounds1191182980526254168.gal : 24 ms
[2023-03-15 10:55:04] [INFO ] Time to serialize properties into /tmp/UpperBounds902421471485941339.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/UpperBounds1191182980526254168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds902421471485941339.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/UpperBounds902421471485941339.prop.
Detected timeout of ITS tools.
[2023-03-15 11:16:26] [INFO ] Applying decomposition
[2023-03-15 11:16:26] [INFO ] Flatten gal took : 565 ms
[2023-03-15 11:16:27] [INFO ] Decomposing Gal with order
[2023-03-15 11:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:16:35] [INFO ] Removed a total of 7679 redundant transitions.
[2023-03-15 11:16:35] [INFO ] Flatten gal took : 7872 ms
[2023-03-15 11:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 169 ms.
[2023-03-15 11:16:35] [INFO ] Time to serialize gal into /tmp/UpperBounds2556513869944283669.gal : 58 ms
[2023-03-15 11:16:35] [INFO ] Time to serialize properties into /tmp/UpperBounds16715439202774281300.prop : 2 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/UpperBounds2556513869944283669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16715439202774281300.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/UpperBounds16715439202774281300.prop.
Detected timeout of ITS tools.
[2023-03-15 11:37:51] [INFO ] Flatten gal took : 11182 ms
[2023-03-15 11:37:53] [INFO ] Input system was already deterministic with 1522 transitions.
[2023-03-15 11:37:53] [INFO ] Transformed 751 places.
[2023-03-15 11:37:53] [INFO ] Transformed 1522 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 11:38:23] [INFO ] Time to serialize gal into /tmp/UpperBounds11582325988510944882.gal : 11 ms
[2023-03-15 11:38:23] [INFO ] Time to serialize properties into /tmp/UpperBounds11318644349999467008.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/UpperBounds11582325988510944882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11318644349999467008.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...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11318644349999467008.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-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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