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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 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 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 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-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678876359725

Running Version 202205111006
[2023-03-15 10:32:40] [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:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:32:40] [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:32:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:32:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2023-03-15 10:32:41] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 10:32:43] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 9 ms.
[2023-03-15 10:32:43] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:32:43] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:32:43] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:32:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 9 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-15 10:32:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:44] [INFO ] Added : 36 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 10:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 10:32:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 10:32:44] [INFO ] Added : 20 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-15 10:32:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2023-03-15 10:32:44] [INFO ] Added : 36 causal constraints over 8 iterations in 226 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:45] [INFO ] Added : 21 causal constraints over 5 iterations in 308 ms. Result :sat
Minimization took 62 ms.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:45] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-15 10:32:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-15 10:32:46] [INFO ] Added : 24 causal constraints over 6 iterations in 388 ms. Result :sat
Minimization took 49 ms.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-15 10:32:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:32:46] [INFO ] Added : 36 causal constraints over 8 iterations in 113 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:32:46] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2023-03-15 10:32:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:32:46] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:32:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:32:46] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-15 10:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-15 10:32:46] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-15 10:32:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:32:46] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1, 2, 1, 10, 10, -1, -1, 10, 1, -1, -1, -1, -1, 3]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 10:32:47] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 225 ms.
[2023-03-15 10:32:47] [INFO ] Unfolded 12 HLPN properties in 4 ms.
Deduced a syphon composed of 30 places in 24 ms
Reduce places removed 30 places and 30 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 220 ms. (steps per millisecond=45 ) properties (out of 12) seen :4
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 10000 steps, including 103 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 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 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :3
[2023-03-15 10:32:47] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 10:32:48] [INFO ] Computed 92 place invariants in 87 ms
[2023-03-15 10:32:48] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:32:48] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:48] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-15 10:32:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:48] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-15 10:32:48] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 10:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:49] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2023-03-15 10:32:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:32:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 241 ms returned sat
[2023-03-15 10:32:50] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 223 ms.
[2023-03-15 10:32:51] [INFO ] Deduced a trap composed of 342 places in 518 ms of which 1 ms to minimize.
[2023-03-15 10:32:51] [INFO ] Deduced a trap composed of 19 places in 454 ms of which 1 ms to minimize.
[2023-03-15 10:32:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1197 ms
[2023-03-15 10:32:51] [INFO ] Added : 22 causal constraints over 5 iterations in 1979 ms. Result :sat
Minimization took 988 ms.
[2023-03-15 10:32:52] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:32:52] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:53] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-15 10:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:53] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:32:53] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:55] [INFO ] [Nat]Absence check using state equation in 2085 ms returned sat
[2023-03-15 10:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 53 ms returned sat
[2023-03-15 10:32:56] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 465 ms.
[2023-03-15 10:32:57] [INFO ] Deduced a trap composed of 324 places in 499 ms of which 1 ms to minimize.
[2023-03-15 10:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2023-03-15 10:32:57] [INFO ] Added : 11 causal constraints over 3 iterations in 1648 ms. Result :sat
Minimization took 796 ms.
[2023-03-15 10:32:58] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:32:58] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 10:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:32:58] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-15 10:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:32:59] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:32:59] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 10:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:04] [INFO ] [Nat]Absence check using state equation in 4905 ms returned unknown
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:04] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-15 10:33:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:04] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:05] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:06] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2023-03-15 10:33:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2023-03-15 10:33:06] [INFO ] Deduced a trap composed of 172 places in 474 ms of which 1 ms to minimize.
[2023-03-15 10:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 737 ms
[2023-03-15 10:33:07] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 157 ms.
[2023-03-15 10:33:09] [INFO ] Added : 10 causal constraints over 2 iterations in 2766 ms. Result :unknown
[2023-03-15 10:33:10] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:10] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:10] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-15 10:33:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:10] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:10] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:11] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-15 10:33:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 179 ms returned sat
[2023-03-15 10:33:11] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 146 ms.
[2023-03-15 10:33:11] [INFO ] Added : 7 causal constraints over 2 iterations in 423 ms. Result :sat
Minimization took 314 ms.
[2023-03-15 10:33:12] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:12] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 10:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:12] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-15 10:33:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:13] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:13] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 10:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:13] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2023-03-15 10:33:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 220 ms returned sat
[2023-03-15 10:33:14] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 143 ms.
[2023-03-15 10:33:14] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 1 ms to minimize.
[2023-03-15 10:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-15 10:33:15] [INFO ] Added : 27 causal constraints over 6 iterations in 1261 ms. Result :sat
Minimization took 809 ms.
[2023-03-15 10:33:16] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:16] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 10:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:16] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-15 10:33:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:16] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:16] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:17] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-15 10:33:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 138 ms returned sat
[2023-03-15 10:33:17] [INFO ] Deduced a trap composed of 180 places in 400 ms of which 1 ms to minimize.
[2023-03-15 10:33:18] [INFO ] Deduced a trap composed of 195 places in 383 ms of which 0 ms to minimize.
[2023-03-15 10:33:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 966 ms
[2023-03-15 10:33:18] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 154 ms.
[2023-03-15 10:33:19] [INFO ] Deduced a trap composed of 19 places in 467 ms of which 0 ms to minimize.
[2023-03-15 10:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2023-03-15 10:33:20] [INFO ] Added : 27 causal constraints over 6 iterations in 1760 ms. Result :sat
Minimization took 934 ms.
[2023-03-15 10:33:21] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:21] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:33:21] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-15 10:33:21] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:21] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2023-03-15 10:33:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:22] [INFO ] [Nat]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-15 10:33:22] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 10:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:23] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2023-03-15 10:33:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2023-03-15 10:33:23] [INFO ] Deduced a trap composed of 182 places in 474 ms of which 0 ms to minimize.
[2023-03-15 10:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 615 ms
[2023-03-15 10:33:23] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 146 ms.
[2023-03-15 10:33:24] [INFO ] Added : 14 causal constraints over 3 iterations in 564 ms. Result :sat
Minimization took 816 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2, 10, 1, 1, 10, 2147483647, 2147483647, 2147483647, 1, 3] Max seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 77 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 654 transition count 1937
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 651 transition count 1936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 650 transition count 1936
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 18 place count 650 transition count 1902
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 86 place count 616 transition count 1902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 615 transition count 1901
Applied a total of 88 rules in 287 ms. Remains 615 /664 variables (removed 49) and now considering 1901/1940 (removed 39) transitions.
[2023-03-15 10:33:25] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
// Phase 1: matrix 1892 rows 615 cols
[2023-03-15 10:33:25] [INFO ] Computed 82 place invariants in 93 ms
[2023-03-15 10:33:26] [INFO ] Dead Transitions using invariants and state equation in 997 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 : 615/664 places, 1286/1940 transitions.
Applied a total of 0 rules in 35 ms. Remains 615 /615 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 615/664 places, 1286/1940 transitions.
Normalized transition count is 1277 out of 1286 initially.
// Phase 1: matrix 1277 rows 615 cols
[2023-03-15 10:33:26] [INFO ] Computed 82 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 68161 resets, run finished after 9911 ms. (steps per millisecond=100 ) properties (out of 8) seen :16
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8847 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 6070 resets, run finished after 1744 ms. (steps per millisecond=573 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8816 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 8633 resets, run finished after 2302 ms. (steps per millisecond=434 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 8873 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000000 steps, including 8721 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties (out of 6) seen :11
[2023-03-15 10:33:48] [INFO ] Flow matrix only has 1277 transitions (discarded 9 similar events)
// Phase 1: matrix 1277 rows 615 cols
[2023-03-15 10:33:48] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned unsat
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:49] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-15 10:33:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:33:49] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-15 10:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:33:49] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-15 10:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:33:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 99 ms returned sat
[2023-03-15 10:33:50] [INFO ] Deduced a trap composed of 279 places in 297 ms of which 1 ms to minimize.
[2023-03-15 10:33:50] [INFO ] Deduced a trap composed of 275 places in 287 ms of which 1 ms to minimize.
[2023-03-15 10:33:51] [INFO ] Deduced a trap composed of 271 places in 287 ms of which 1 ms to minimize.
[2023-03-15 10:33:51] [INFO ] Deduced a trap composed of 277 places in 293 ms of which 1 ms to minimize.
[2023-03-15 10:33:51] [INFO ] Deduced a trap composed of 269 places in 290 ms of which 1 ms to minimize.
[2023-03-15 10:33:52] [INFO ] Deduced a trap composed of 277 places in 297 ms of which 0 ms to minimize.
[2023-03-15 10:33:52] [INFO ] Deduced a trap composed of 275 places in 267 ms of which 1 ms to minimize.
[2023-03-15 10:33:52] [INFO ] Deduced a trap composed of 273 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:33:53] [INFO ] Deduced a trap composed of 281 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:33:53] [INFO ] Deduced a trap composed of 277 places in 279 ms of which 1 ms to minimize.
[2023-03-15 10:33:53] [INFO ] Deduced a trap composed of 277 places in 295 ms of which 0 ms to minimize.
[2023-03-15 10:33:54] [INFO ] Deduced a trap composed of 265 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:33:54] [INFO ] Deduced a trap composed of 279 places in 281 ms of which 1 ms to minimize.
[2023-03-15 10:33:55] [INFO ] Deduced a trap composed of 273 places in 302 ms of which 4 ms to minimize.
[2023-03-15 10:33:55] [INFO ] Deduced a trap composed of 279 places in 313 ms of which 0 ms to minimize.
[2023-03-15 10:33:55] [INFO ] Deduced a trap composed of 279 places in 298 ms of which 1 ms to minimize.
[2023-03-15 10:33:56] [INFO ] Deduced a trap composed of 267 places in 313 ms of which 2 ms to minimize.
[2023-03-15 10:33:57] [INFO ] Deduced a trap composed of 279 places in 322 ms of which 1 ms to minimize.
[2023-03-15 10:33:57] [INFO ] Deduced a trap composed of 277 places in 320 ms of which 1 ms to minimize.
[2023-03-15 10:33:57] [INFO ] Deduced a trap composed of 277 places in 283 ms of which 0 ms to minimize.
[2023-03-15 10:33:58] [INFO ] Deduced a trap composed of 283 places in 300 ms of which 0 ms to minimize.
[2023-03-15 10:33:59] [INFO ] Deduced a trap composed of 279 places in 298 ms of which 0 ms to minimize.
[2023-03-15 10:33:59] [INFO ] Deduced a trap composed of 281 places in 275 ms of which 0 ms to minimize.
[2023-03-15 10:33:59] [INFO ] Deduced a trap composed of 277 places in 288 ms of which 1 ms to minimize.
[2023-03-15 10:34:00] [INFO ] Deduced a trap composed of 275 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:34:00] [INFO ] Deduced a trap composed of 268 places in 296 ms of which 0 ms to minimize.
[2023-03-15 10:34:00] [INFO ] Deduced a trap composed of 277 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:34:01] [INFO ] Deduced a trap composed of 283 places in 306 ms of which 0 ms to minimize.
[2023-03-15 10:34:01] [INFO ] Deduced a trap composed of 277 places in 273 ms of which 0 ms to minimize.
[2023-03-15 10:34:02] [INFO ] Deduced a trap composed of 271 places in 287 ms of which 1 ms to minimize.
[2023-03-15 10:34:03] [INFO ] Deduced a trap composed of 276 places in 291 ms of which 0 ms to minimize.
[2023-03-15 10:34:03] [INFO ] Deduced a trap composed of 281 places in 291 ms of which 1 ms to minimize.
[2023-03-15 10:34:04] [INFO ] Deduced a trap composed of 279 places in 272 ms of which 0 ms to minimize.
[2023-03-15 10:34:04] [INFO ] Deduced a trap composed of 277 places in 272 ms of which 1 ms to minimize.
[2023-03-15 10:34:05] [INFO ] Deduced a trap composed of 268 places in 277 ms of which 5 ms to minimize.
[2023-03-15 10:34:06] [INFO ] Deduced a trap composed of 285 places in 290 ms of which 0 ms to minimize.
[2023-03-15 10:34:09] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 19371 ms
[2023-03-15 10:34:09] [INFO ] [Real]Absence check using 76 positive place invariants in 21 ms returned sat
[2023-03-15 10:34:09] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-15 10:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:34:09] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-15 10:34:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:34:09] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-15 10:34:09] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-15 10:34:10] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-15 10:34:10] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:34:10] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-15 10:34:10] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 10, 1, 1, 1] Max seen :[1, 4, 3, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 1286/1286 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 615 transition count 1285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 614 transition count 1285
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 2 place count 614 transition count 1254
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 64 place count 583 transition count 1254
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 68 place count 581 transition count 1252
Applied a total of 68 rules in 70 ms. Remains 581 /615 variables (removed 34) and now considering 1252/1286 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/615 places, 1252/1286 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:10] [INFO ] Computed 82 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 70115 resets, run finished after 8810 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8715 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties (out of 1) seen :3
[2023-03-15 10:34:20] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:20] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-15 10:34:20] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 10:34:20] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:34:21] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-15 10:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:34:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 10:34:21] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 10:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:34:21] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-15 10:34:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:34:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2023-03-15 10:34:22] [INFO ] Deduced a trap composed of 236 places in 288 ms of which 1 ms to minimize.
[2023-03-15 10:34:22] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 1 ms to minimize.
[2023-03-15 10:34:22] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-15 10:34:23] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2023-03-15 10:34:23] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:34:23] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:34:23] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 0 ms to minimize.
[2023-03-15 10:34:24] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:34:24] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:34:25] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:34:25] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 2 ms to minimize.
[2023-03-15 10:34:25] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 1 ms to minimize.
[2023-03-15 10:34:26] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-15 10:34:26] [INFO ] Deduced a trap composed of 238 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:34:26] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 0 ms to minimize.
[2023-03-15 10:34:27] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:34:27] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 0 ms to minimize.
[2023-03-15 10:34:28] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 1 ms to minimize.
[2023-03-15 10:34:28] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 0 ms to minimize.
[2023-03-15 10:34:28] [INFO ] Deduced a trap composed of 226 places in 283 ms of which 0 ms to minimize.
[2023-03-15 10:34:29] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 0 ms to minimize.
[2023-03-15 10:34:29] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:34:30] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-15 10:34:30] [INFO ] Deduced a trap composed of 234 places in 299 ms of which 3 ms to minimize.
[2023-03-15 10:34:30] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 0 ms to minimize.
[2023-03-15 10:34:31] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-15 10:34:31] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-15 10:34:32] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 0 ms to minimize.
[2023-03-15 10:34:32] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2023-03-15 10:34:33] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 0 ms to minimize.
[2023-03-15 10:34:33] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-15 10:34:33] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:34:34] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-15 10:34:34] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-15 10:34:34] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-15 10:34:35] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-15 10:34:35] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:34:35] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-15 10:34:36] [INFO ] Deduced a trap composed of 236 places in 285 ms of which 1 ms to minimize.
[2023-03-15 10:34:36] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:34:37] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-15 10:34:37] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:34:37] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 0 ms to minimize.
[2023-03-15 10:34:39] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2023-03-15 10:34:39] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 0 ms to minimize.
[2023-03-15 10:34:40] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-15 10:34:40] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 1 ms to minimize.
[2023-03-15 10:34:41] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-15 10:34:41] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-15 10:34:42] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 0 ms to minimize.
[2023-03-15 10:34:43] [INFO ] Deduced a trap composed of 238 places in 281 ms of which 1 ms to minimize.
[2023-03-15 10:34:43] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:34:43] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-15 10:34:44] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-15 10:34:44] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-15 10:34:45] [INFO ] Deduced a trap composed of 222 places in 268 ms of which 0 ms to minimize.
[2023-03-15 10:34:45] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-15 10:34:46] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:34:46] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:34:47] [INFO ] Deduced a trap composed of 224 places in 274 ms of which 1 ms to minimize.
[2023-03-15 10:34:48] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-15 10:34:51] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2023-03-15 10:34:52] [INFO ] Deduced a trap composed of 224 places in 277 ms of which 1 ms to minimize.
[2023-03-15 10:34:55] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 33284 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 52 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 43 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 10:34:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:55] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-15 10:34:55] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-15 10:34:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:55] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-15 10:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:34:58] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-15 10:34:58] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-15 10:34:58] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:58] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-15 10:34:58] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:58] [INFO ] Computed 82 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 709 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-15 10:34:59] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:34:59] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-15 10:34:59] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 10:34:59] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:34:59] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2023-03-15 10:34:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:34:59] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 10:34:59] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:34:59] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-03-15 10:34:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:34:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2023-03-15 10:35:00] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2023-03-15 10:35:00] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 1 ms to minimize.
[2023-03-15 10:35:00] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-15 10:35:01] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-15 10:35:01] [INFO ] Deduced a trap composed of 222 places in 281 ms of which 1 ms to minimize.
[2023-03-15 10:35:01] [INFO ] Deduced a trap composed of 232 places in 298 ms of which 0 ms to minimize.
[2023-03-15 10:35:02] [INFO ] Deduced a trap composed of 238 places in 273 ms of which 0 ms to minimize.
[2023-03-15 10:35:02] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 1 ms to minimize.
[2023-03-15 10:35:02] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-15 10:35:03] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-15 10:35:03] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:35:03] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 1 ms to minimize.
[2023-03-15 10:35:04] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:35:04] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 0 ms to minimize.
[2023-03-15 10:35:04] [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 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 23 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 10:35:04] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:04] [INFO ] Computed 82 place invariants in 29 ms
[2023-03-15 10:35:05] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:05] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70459 resets, run finished after 8735 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8851 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 1) seen :3
[2023-03-15 10:35:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:15] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 10:35:15] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 10:35:15] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:35:16] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-15 10:35:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:35:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 10:35:16] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:35:16] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-15 10:35:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:35:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2023-03-15 10:35:17] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 10:35:17] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 1 ms to minimize.
[2023-03-15 10:35:17] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:35:17] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2023-03-15 10:35:18] [INFO ] Deduced a trap composed of 222 places in 278 ms of which 0 ms to minimize.
[2023-03-15 10:35:18] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:35:18] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:35:19] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 0 ms to minimize.
[2023-03-15 10:35:19] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:35:20] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:35:20] [INFO ] Deduced a trap composed of 238 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:35:20] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:35:21] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:35:21] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 1 ms to minimize.
[2023-03-15 10:35:21] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-15 10:35:22] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-15 10:35:22] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-15 10:35:22] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2023-03-15 10:35:23] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:35:23] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-15 10:35:24] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:35:24] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:35:24] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 0 ms to minimize.
[2023-03-15 10:35:25] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 1 ms to minimize.
[2023-03-15 10:35:25] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 10:35:26] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 1 ms to minimize.
[2023-03-15 10:35:26] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-15 10:35:26] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 1 ms to minimize.
[2023-03-15 10:35:27] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-15 10:35:27] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 0 ms to minimize.
[2023-03-15 10:35:28] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 0 ms to minimize.
[2023-03-15 10:35:28] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-15 10:35:28] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-15 10:35:29] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:35:29] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-15 10:35:29] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2023-03-15 10:35:30] [INFO ] Deduced a trap composed of 238 places in 277 ms of which 0 ms to minimize.
[2023-03-15 10:35:30] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-15 10:35:31] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 0 ms to minimize.
[2023-03-15 10:35:31] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:35:31] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-15 10:35:32] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-15 10:35:32] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-15 10:35:33] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 1 ms to minimize.
[2023-03-15 10:35:34] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 1 ms to minimize.
[2023-03-15 10:35:34] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:35:35] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2023-03-15 10:35:36] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 0 ms to minimize.
[2023-03-15 10:35:36] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-15 10:35:36] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 1 ms to minimize.
[2023-03-15 10:35:37] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2023-03-15 10:35:37] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 10:35:38] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-15 10:35:38] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-15 10:35:39] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-15 10:35:39] [INFO ] Deduced a trap composed of 222 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:35:40] [INFO ] Deduced a trap composed of 234 places in 295 ms of which 0 ms to minimize.
[2023-03-15 10:35:40] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:35:40] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 3 ms to minimize.
[2023-03-15 10:35:42] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 0 ms to minimize.
[2023-03-15 10:35:42] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:35:45] [INFO ] Deduced a trap composed of 234 places in 300 ms of which 1 ms to minimize.
[2023-03-15 10:35:46] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 0 ms to minimize.
[2023-03-15 10:35:49] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 33039 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 40 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 22 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 10:35:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:49] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 10:35:50] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-15 10:35:50] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:50] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 10:35:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:35:52] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2023-03-15 10:35:53] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-15 10:35:53] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 10:35:53] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 10:35:53] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08 in 54802 ms.
[2023-03-15 10:35:53] [INFO ] Flatten gal took : 229 ms
[2023-03-15 10:35:54] [INFO ] Applying decomposition
[2023-03-15 10:35:54] [INFO ] Flatten gal took : 137 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/graph14638630609810928589.txt' '-o' '/tmp/graph14638630609810928589.bin' '-w' '/tmp/graph14638630609810928589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14638630609810928589.bin' '-l' '-1' '-v' '-w' '/tmp/graph14638630609810928589.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:35:54] [INFO ] Decomposing Gal with order
[2023-03-15 10:35:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:35:54] [INFO ] Removed a total of 3066 redundant transitions.
[2023-03-15 10:35:55] [INFO ] Flatten gal took : 283 ms
[2023-03-15 10:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 72 ms.
[2023-03-15 10:35:55] [INFO ] Time to serialize gal into /tmp/UpperBounds17603914053933948114.gal : 31 ms
[2023-03-15 10:35:55] [INFO ] Time to serialize properties into /tmp/UpperBounds7309043897076281891.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/UpperBounds17603914053933948114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7309043897076281891.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/UpperBounds7309043897076281891.prop.
Detected timeout of ITS tools.
[2023-03-15 10:57:02] [INFO ] Applying decomposition
[2023-03-15 10:57:02] [INFO ] Flatten gal took : 454 ms
[2023-03-15 10:57:03] [INFO ] Decomposing Gal with order
[2023-03-15 10:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:57:04] [INFO ] Removed a total of 6719 redundant transitions.
[2023-03-15 10:57:04] [INFO ] Flatten gal took : 1333 ms
[2023-03-15 10:57:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 85 ms.
[2023-03-15 10:57:04] [INFO ] Time to serialize gal into /tmp/UpperBounds15808647550434325046.gal : 21 ms
[2023-03-15 10:57:04] [INFO ] Time to serialize properties into /tmp/UpperBounds13363027615322954504.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/UpperBounds15808647550434325046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13363027615322954504.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds13363027615322954504.prop.
Detected timeout of ITS tools.
[2023-03-15 11:18:17] [INFO ] Flatten gal took : 803 ms
[2023-03-15 11:18:19] [INFO ] Input system was already deterministic with 1252 transitions.
[2023-03-15 11:18:19] [INFO ] Transformed 581 places.
[2023-03-15 11:18:19] [INFO ] Transformed 1252 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:18:50] [INFO ] Time to serialize gal into /tmp/UpperBounds10682214137599883536.gal : 21 ms
[2023-03-15 11:18:50] [INFO ] Time to serialize properties into /tmp/UpperBounds13617401509608068849.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/UpperBounds10682214137599883536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13617401509608068849.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/UpperBounds13617401509608068849.prop.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
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-S10J30, 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-167873969900086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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