About the Execution of 2022-gold for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.264 | 3600000.00 | 2655827.00 | 645557.10 | 4 ? 1 3 2 1 10 ? 1 1 5 2 4 3 1 1 | normal |
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-167873969900084.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-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 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 94K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678875601278
Running Version 202205111006
[2023-03-15 10:20:02] [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:20:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:20:02] [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:20:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:20:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 651 ms
[2023-03-15 10:20:03] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-15 10:20:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-15 10:20:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:20:03] [INFO ] Computed 13 place invariants in 8 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:20:03] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 10:20:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:20:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-15 10:20:03] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
[2023-03-15 10:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-15 10:20:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:20:03] [INFO ] Added : 23 causal constraints over 6 iterations in 189 ms. Result :sat
Minimization took 26 ms.
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:20:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:20:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:20:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
[2023-03-15 10:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 10:20:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:20:04] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 10:20:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:20:04] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 10:20:04] [INFO ] Added : 33 causal constraints over 7 iterations in 217 ms. Result :sat
Minimization took 61 ms.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-15 10:20:04] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 10:20:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 10:20:04] [INFO ] Added : 21 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 43 ms.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 10:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-15 10:20:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 10:20:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:20:04] [INFO ] Added : 20 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2023-03-15 10:20:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:20:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2023-03-15 10:20:05] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-15 10:20:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-15 10:20:05] [INFO ] Added : 23 causal constraints over 5 iterations in 487 ms. Result :sat
Minimization took 131 ms.
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:20:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-15 10:20:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:20:05] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:20:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:20:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-15 10:20:06] [INFO ] Added : 36 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:20:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:20:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 10:20:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:20:06] [INFO ] Added : 18 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:20:06] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-15 10:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-15 10:20:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:20:06] [INFO ] Added : 9 causal constraints over 2 iterations in 145 ms. Result :sat
Minimization took 217 ms.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 0 ms returned unsat
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:20:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:20:07] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-15 10:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-15 10:20:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:20:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-15 10:20:07] [INFO ] Added : 36 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:20:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:20:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:20:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:20:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:20:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-15 10:20:07] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2023-03-15 10:20:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2023-03-15 10:20:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:20:07] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [10, 4, 1, 3, 2, 10, -1, -1, 2, 10, 3, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 3 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:20:07] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 55 ms.
[2023-03-15 10:20:07] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :22
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :22
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :16
[2023-03-15 10:20:07] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 10:20:07] [INFO ] Computed 182 place invariants in 190 ms
[2023-03-15 10:20:08] [INFO ] [Real]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 10:20:08] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned unsat
[2023-03-15 10:20:08] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 10:20:08] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 10:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:08] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2023-03-15 10:20:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:09] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 10:20:09] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 10:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:10] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2023-03-15 10:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:20:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1128 ms returned sat
[2023-03-15 10:20:11] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 175 ms.
[2023-03-15 10:20:12] [INFO ] Deduced a trap composed of 664 places in 623 ms of which 1 ms to minimize.
[2023-03-15 10:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 933 ms
[2023-03-15 10:20:13] [INFO ] Added : 19 causal constraints over 4 iterations in 1853 ms. Result :sat
Minimization took 623 ms.
[2023-03-15 10:20:13] [INFO ] [Real]Absence check using 175 positive place invariants in 66 ms returned sat
[2023-03-15 10:20:13] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:14] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-15 10:20:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:14] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 10:20:14] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 10:20:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:15] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-15 10:20:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-15 10:20:15] [INFO ] Deduced a trap composed of 403 places in 478 ms of which 1 ms to minimize.
[2023-03-15 10:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2023-03-15 10:20:16] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 105 ms.
[2023-03-15 10:20:16] [INFO ] Added : 17 causal constraints over 4 iterations in 760 ms. Result :sat
Minimization took 565 ms.
[2023-03-15 10:20:17] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-15 10:20:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned unsat
[2023-03-15 10:20:17] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-15 10:20:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned unsat
[2023-03-15 10:20:17] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 10:20:18] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 15 ms returned unsat
[2023-03-15 10:20:18] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-15 10:20:18] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned unsat
[2023-03-15 10:20:18] [INFO ] [Real]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 10:20:18] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 10, 1, 1, 4, 1, 1] Max seen :[4, 3, 3, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 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 351 place count 1011 transition count 1522
Applied a total of 351 rules in 434 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-15 10:20:18] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-15 10:20:19] [INFO ] Computed 177 place invariants in 113 ms
[2023-03-15 10:20:20] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 82 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:20:20] [INFO ] Computed 177 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 47383 resets, run finished after 5689 ms. (steps per millisecond=175 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2718 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2611 resets, run finished after 1511 ms. (steps per millisecond=661 ) properties (out of 2) seen :6
[2023-03-15 10:20:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:20:29] [INFO ] Computed 177 place invariants in 40 ms
[2023-03-15 10:20:29] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 10:20:29] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:29] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2023-03-15 10:20:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:29] [INFO ] [Nat]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 10:20:29] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 10:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:30] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-15 10:20:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:20:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 246 ms returned sat
[2023-03-15 10:20:31] [INFO ] Deduced a trap composed of 311 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:20:31] [INFO ] Deduced a trap composed of 400 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:20:31] [INFO ] Deduced a trap composed of 324 places in 325 ms of which 1 ms to minimize.
[2023-03-15 10:20:32] [INFO ] Deduced a trap composed of 314 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:20:32] [INFO ] Deduced a trap composed of 318 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:20:33] [INFO ] Deduced a trap composed of 315 places in 371 ms of which 0 ms to minimize.
[2023-03-15 10:20:33] [INFO ] Deduced a trap composed of 317 places in 358 ms of which 1 ms to minimize.
[2023-03-15 10:20:33] [INFO ] Deduced a trap composed of 333 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:20:35] [INFO ] Deduced a trap composed of 317 places in 373 ms of which 3 ms to minimize.
[2023-03-15 10:20:36] [INFO ] Deduced a trap composed of 332 places in 338 ms of which 1 ms to minimize.
[2023-03-15 10:20:36] [INFO ] Deduced a trap composed of 327 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:20:38] [INFO ] Deduced a trap composed of 290 places in 320 ms of which 1 ms to minimize.
[2023-03-15 10:20:39] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 1 ms to minimize.
[2023-03-15 10:20:42] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 11970 ms
[2023-03-15 10:20:42] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 10:20:42] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 10:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:43] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-15 10:20:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:20:43] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:20:43] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:20:43] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2023-03-15 10:20:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 79 ms returned sat
[2023-03-15 10:20:44] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:20:44] [INFO ] Deduced a trap composed of 308 places in 306 ms of which 1 ms to minimize.
[2023-03-15 10:20:45] [INFO ] Deduced a trap composed of 317 places in 320 ms of which 1 ms to minimize.
[2023-03-15 10:20:45] [INFO ] Deduced a trap composed of 341 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:20:45] [INFO ] Deduced a trap composed of 312 places in 306 ms of which 1 ms to minimize.
[2023-03-15 10:20:46] [INFO ] Deduced a trap composed of 330 places in 319 ms of which 0 ms to minimize.
[2023-03-15 10:20:47] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 0 ms to minimize.
[2023-03-15 10:20:47] [INFO ] Deduced a trap composed of 332 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:20:47] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 1 ms to minimize.
[2023-03-15 10:20:48] [INFO ] Deduced a trap composed of 320 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:20:48] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:20:49] [INFO ] Deduced a trap composed of 329 places in 335 ms of which 1 ms to minimize.
[2023-03-15 10:20:49] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 1 ms to minimize.
[2023-03-15 10:20:49] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 0 ms to minimize.
[2023-03-15 10:20:50] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 1 ms to minimize.
[2023-03-15 10:20:50] [INFO ] Deduced a trap composed of 341 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:20:51] [INFO ] Deduced a trap composed of 308 places in 369 ms of which 1 ms to minimize.
[2023-03-15 10:20:51] [INFO ] Deduced a trap composed of 341 places in 344 ms of which 1 ms to minimize.
[2023-03-15 10:20:52] [INFO ] Deduced a trap composed of 341 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:20:53] [INFO ] Deduced a trap composed of 336 places in 344 ms of which 1 ms to minimize.
[2023-03-15 10:20:53] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-15 10:20:53] [INFO ] Deduced a trap composed of 311 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:20:54] [INFO ] Deduced a trap composed of 320 places in 342 ms of which 0 ms to minimize.
[2023-03-15 10:20:55] [INFO ] Deduced a trap composed of 326 places in 348 ms of which 1 ms to minimize.
[2023-03-15 10:20:56] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-15 10:20:57] [INFO ] Deduced a trap composed of 314 places in 342 ms of which 2 ms to minimize.
[2023-03-15 10:20:57] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 1 ms to minimize.
[2023-03-15 10:20:58] [INFO ] Deduced a trap composed of 329 places in 329 ms of which 1 ms to minimize.
[2023-03-15 10:20:58] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:20:59] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 1 ms to minimize.
[2023-03-15 10:20:59] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:21:01] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 0 ms to minimize.
[2023-03-15 10:21:02] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:21:02] [INFO ] Deduced a trap composed of 335 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:21:03] [INFO ] Deduced a trap composed of 326 places in 331 ms of which 2 ms to minimize.
[2023-03-15 10:21:06] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 22384 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 40 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 10:21:06] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:21:06] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-15 10:21:07] [INFO ] Implicit Places using invariants in 1314 ms returned []
[2023-03-15 10:21:07] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:21:07] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-15 10:21:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:21:17] [INFO ] Implicit Places using invariants and state equation in 9408 ms returned []
Implicit Place search using SMT with State Equation took 10724 ms to find 0 implicit places.
[2023-03-15 10:21:17] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-15 10:21:17] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:21:17] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 10:21:18] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:21:18] [INFO ] Computed 177 place invariants in 33 ms
Incomplete random walk after 10001 steps, including 475 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-15 10:21:18] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:21:18] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 10:21:18] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:21:18] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:21:19] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-15 10:21:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:21:19] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:21:19] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 10:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:21:19] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2023-03-15 10:21:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:21:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 225 ms returned sat
[2023-03-15 10:21:20] [INFO ] Deduced a trap composed of 311 places in 331 ms of which 2 ms to minimize.
[2023-03-15 10:21:20] [INFO ] Deduced a trap composed of 400 places in 367 ms of which 1 ms to minimize.
[2023-03-15 10:21:21] [INFO ] Deduced a trap composed of 324 places in 355 ms of which 3 ms to minimize.
[2023-03-15 10:21:21] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 2 ms to minimize.
[2023-03-15 10:21:22] [INFO ] Deduced a trap composed of 318 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:21:22] [INFO ] Deduced a trap composed of 315 places in 344 ms of which 0 ms to minimize.
[2023-03-15 10:21:22] [INFO ] Deduced a trap composed of 317 places in 352 ms of which 1 ms to minimize.
[2023-03-15 10:21:23] [INFO ] Deduced a trap composed of 333 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:21:24] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4167 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 65 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-15 10:21:24] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:21:24] [INFO ] Computed 177 place invariants in 45 ms
[2023-03-15 10:21:25] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:21:25] [INFO ] Computed 177 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 51995 resets, run finished after 5909 ms. (steps per millisecond=169 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2727 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties (out of 1) seen :3
[2023-03-15 10:21:32] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:21:32] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-15 10:21:33] [INFO ] [Real]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-15 10:21:33] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 10:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:21:33] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-15 10:21:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:21:33] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:21:33] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:21:34] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-15 10:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:21:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 138 ms returned sat
[2023-03-15 10:21:34] [INFO ] Deduced a trap composed of 323 places in 317 ms of which 1 ms to minimize.
[2023-03-15 10:21:34] [INFO ] Deduced a trap composed of 311 places in 317 ms of which 1 ms to minimize.
[2023-03-15 10:21:35] [INFO ] Deduced a trap composed of 311 places in 322 ms of which 1 ms to minimize.
[2023-03-15 10:21:35] [INFO ] Deduced a trap composed of 329 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:21:36] [INFO ] Deduced a trap composed of 326 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:21:36] [INFO ] Deduced a trap composed of 311 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:21:37] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 1 ms to minimize.
[2023-03-15 10:21:37] [INFO ] Deduced a trap composed of 341 places in 327 ms of which 1 ms to minimize.
[2023-03-15 10:21:37] [INFO ] Deduced a trap composed of 329 places in 320 ms of which 0 ms to minimize.
[2023-03-15 10:21:38] [INFO ] Deduced a trap composed of 344 places in 310 ms of which 0 ms to minimize.
[2023-03-15 10:21:38] [INFO ] Deduced a trap composed of 317 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:21:39] [INFO ] Deduced a trap composed of 317 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:21:39] [INFO ] Deduced a trap composed of 311 places in 322 ms of which 1 ms to minimize.
[2023-03-15 10:21:39] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 1 ms to minimize.
[2023-03-15 10:21:40] [INFO ] Deduced a trap composed of 329 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:21:40] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:21:41] [INFO ] Deduced a trap composed of 308 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:21:41] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-15 10:21:42] [INFO ] Deduced a trap composed of 311 places in 314 ms of which 1 ms to minimize.
[2023-03-15 10:21:45] [INFO ] Deduced a trap composed of 311 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:21:45] [INFO ] Deduced a trap composed of 342 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:21:45] [INFO ] Deduced a trap composed of 320 places in 337 ms of which 0 ms to minimize.
[2023-03-15 10:21:46] [INFO ] Deduced a trap composed of 341 places in 343 ms of which 1 ms to minimize.
[2023-03-15 10:21:47] [INFO ] Deduced a trap composed of 320 places in 343 ms of which 1 ms to minimize.
[2023-03-15 10:21:49] [INFO ] Deduced a trap composed of 330 places in 352 ms of which 1 ms to minimize.
[2023-03-15 10:21:50] [INFO ] Deduced a trap composed of 321 places in 339 ms of which 1 ms to minimize.
[2023-03-15 10:21:51] [INFO ] Deduced a trap composed of 323 places in 333 ms of which 1 ms to minimize.
[2023-03-15 10:21:52] [INFO ] Deduced a trap composed of 338 places in 353 ms of which 0 ms to minimize.
[2023-03-15 10:21:55] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 20803 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 89 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 70 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 10:21:55] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:21:55] [INFO ] Computed 177 place invariants in 46 ms
[2023-03-15 10:21:56] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2023-03-15 10:21:56] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:21:56] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 10:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:22:03] [INFO ] Implicit Places using invariants and state equation in 6509 ms returned []
Implicit Place search using SMT with State Equation took 7938 ms to find 0 implicit places.
[2023-03-15 10:22:03] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-15 10:22:03] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 10:22:03] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 10:22:04] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01 in 45897 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:04] [INFO ] Computed 177 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 490 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-15 10:22:04] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:04] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 10:22:04] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-15 10:22:04] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:22:05] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-15 10:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:22:05] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:22:05] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 10:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:22:05] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2023-03-15 10:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:22:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 78 ms returned sat
[2023-03-15 10:22:06] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:22:06] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 0 ms to minimize.
[2023-03-15 10:22:06] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 1 ms to minimize.
[2023-03-15 10:22:07] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2023-03-15 10:22:07] [INFO ] Deduced a trap composed of 312 places in 329 ms of which 1 ms to minimize.
[2023-03-15 10:22:08] [INFO ] Deduced a trap composed of 330 places in 358 ms of which 1 ms to minimize.
[2023-03-15 10:22:08] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 1 ms to minimize.
[2023-03-15 10:22:09] [INFO ] Deduced a trap composed of 332 places in 318 ms of which 1 ms to minimize.
[2023-03-15 10:22:09] [INFO ] Deduced a trap composed of 314 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:22:10] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:22:10] [INFO ] Deduced a trap composed of 320 places in 312 ms of which 1 ms to minimize.
[2023-03-15 10:22:10] [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 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 40 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 10:22:10] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:10] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 10:22:11] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:11] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 47350 resets, run finished after 5741 ms. (steps per millisecond=174 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2623 resets, run finished after 1563 ms. (steps per millisecond=639 ) properties (out of 1) seen :3
[2023-03-15 10:22:18] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:18] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-15 10:22:19] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 10:22:19] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:22:19] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-15 10:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:22:19] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-15 10:22:19] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 10:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:22:20] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-15 10:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:22:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 80 ms returned sat
[2023-03-15 10:22:20] [INFO ] Deduced a trap composed of 338 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:22:21] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-15 10:22:21] [INFO ] Deduced a trap composed of 317 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:22:21] [INFO ] Deduced a trap composed of 341 places in 326 ms of which 1 ms to minimize.
[2023-03-15 10:22:22] [INFO ] Deduced a trap composed of 312 places in 333 ms of which 1 ms to minimize.
[2023-03-15 10:22:22] [INFO ] Deduced a trap composed of 330 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:22:23] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:22:23] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:22:24] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2023-03-15 10:22:24] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2023-03-15 10:22:24] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:22:25] [INFO ] Deduced a trap composed of 329 places in 336 ms of which 0 ms to minimize.
[2023-03-15 10:22:25] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 1 ms to minimize.
[2023-03-15 10:22:26] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 0 ms to minimize.
[2023-03-15 10:22:26] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2023-03-15 10:22:26] [INFO ] Deduced a trap composed of 341 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:22:27] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 1 ms to minimize.
[2023-03-15 10:22:28] [INFO ] Deduced a trap composed of 341 places in 336 ms of which 1 ms to minimize.
[2023-03-15 10:22:28] [INFO ] Deduced a trap composed of 341 places in 333 ms of which 1 ms to minimize.
[2023-03-15 10:22:29] [INFO ] Deduced a trap composed of 336 places in 352 ms of which 1 ms to minimize.
[2023-03-15 10:22:29] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:22:30] [INFO ] Deduced a trap composed of 311 places in 327 ms of which 1 ms to minimize.
[2023-03-15 10:22:31] [INFO ] Deduced a trap composed of 320 places in 349 ms of which 1 ms to minimize.
[2023-03-15 10:22:31] [INFO ] Deduced a trap composed of 326 places in 354 ms of which 1 ms to minimize.
[2023-03-15 10:22:32] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 3 ms to minimize.
[2023-03-15 10:22:33] [INFO ] Deduced a trap composed of 314 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:22:33] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2023-03-15 10:22:34] [INFO ] Deduced a trap composed of 329 places in 309 ms of which 1 ms to minimize.
[2023-03-15 10:22:34] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 1 ms to minimize.
[2023-03-15 10:22:35] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 1 ms to minimize.
[2023-03-15 10:22:35] [INFO ] Deduced a trap composed of 329 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:22:37] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 1 ms to minimize.
[2023-03-15 10:22:38] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:22:38] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 10:22:39] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2023-03-15 10:22:42] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 22095 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 37 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 38 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 10:22:42] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:42] [INFO ] Computed 177 place invariants in 26 ms
[2023-03-15 10:22:43] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2023-03-15 10:22:43] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:43] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 10:22:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:22:53] [INFO ] Implicit Places using invariants and state equation in 9597 ms returned []
Implicit Place search using SMT with State Equation took 10875 ms to find 0 implicit places.
[2023-03-15 10:22:53] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 10:22:53] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 10:22:53] [INFO ] Computed 177 place invariants in 45 ms
[2023-03-15 10:22:54] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07 in 50222 ms.
[2023-03-15 10:22:54] [INFO ] Flatten gal took : 225 ms
[2023-03-15 10:22:54] [INFO ] Applying decomposition
[2023-03-15 10:22:55] [INFO ] Flatten gal took : 127 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/graph3293012683384104738.txt' '-o' '/tmp/graph3293012683384104738.bin' '-w' '/tmp/graph3293012683384104738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3293012683384104738.bin' '-l' '-1' '-v' '-w' '/tmp/graph3293012683384104738.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:22:55] [INFO ] Decomposing Gal with order
[2023-03-15 10:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:22:56] [INFO ] Removed a total of 1694 redundant transitions.
[2023-03-15 10:22:56] [INFO ] Flatten gal took : 850 ms
[2023-03-15 10:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 50 ms.
[2023-03-15 10:22:56] [INFO ] Time to serialize gal into /tmp/UpperBounds4761388501779622435.gal : 24 ms
[2023-03-15 10:22:56] [INFO ] Time to serialize properties into /tmp/UpperBounds17427811114614135215.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/UpperBounds4761388501779622435.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17427811114614135215.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/UpperBounds17427811114614135215.prop.
Detected timeout of ITS tools.
[2023-03-15 10:44:01] [INFO ] Applying decomposition
[2023-03-15 10:44:02] [INFO ] Flatten gal took : 479 ms
[2023-03-15 10:44:02] [INFO ] Decomposing Gal with order
[2023-03-15 10:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:44:03] [INFO ] Removed a total of 5164 redundant transitions.
[2023-03-15 10:44:03] [INFO ] Flatten gal took : 924 ms
[2023-03-15 10:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 392 ms.
[2023-03-15 10:44:09] [INFO ] Time to serialize gal into /tmp/UpperBounds17799209399538396224.gal : 42 ms
[2023-03-15 10:44:09] [INFO ] Time to serialize properties into /tmp/UpperBounds3009696726650260452.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/UpperBounds17799209399538396224.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3009696726650260452.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/UpperBounds3009696726650260452.prop.
Detected timeout of ITS tools.
[2023-03-15 11:05:27] [INFO ] Flatten gal took : 811 ms
[2023-03-15 11:05:29] [INFO ] Input system was already deterministic with 1427 transitions.
[2023-03-15 11:05:29] [INFO ] Transformed 1011 places.
[2023-03-15 11:05:29] [INFO ] Transformed 1427 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:06:00] [INFO ] Time to serialize gal into /tmp/UpperBounds15127564043349348782.gal : 37 ms
[2023-03-15 11:06:00] [INFO ] Time to serialize properties into /tmp/UpperBounds16551831817953990442.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/UpperBounds15127564043349348782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16551831817953990442.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/UpperBounds16551831817953990442.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-S05J80"
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-S05J80, 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-167873969900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 '
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 ;