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.r297-tall-167873950800661.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 ltsminxred
Input is PolyORBNT-COL-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800661
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679602920276

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 20:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:22: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-23 20:22:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 20:22:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2023-03-23 20:22:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 20:22:02] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 20:22:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 20:22:03] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 20:22:03] [INFO ] Invariant cache hit.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 20:22:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-23 20:22:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:22:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-23 20:22:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-23 20:22:03] [INFO ] Added : 33 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 20:22:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 20:22:03] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 20:22:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:03] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:22:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2023-03-23 20:22:03] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 132 ms to minimize.
[2023-03-23 20:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-23 20:22:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 20:22:04] [INFO ] Added : 20 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 20:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2023-03-23 20:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-23 20:22:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:22:04] [INFO ] Added : 36 causal constraints over 8 iterations in 129 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 20:22:04] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 20:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2023-03-23 20:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-23 20:22:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 20:22:04] [INFO ] Added : 21 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 20:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-23 20:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-23 20:22:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:22:04] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-23 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-23 20:22:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-23 20:22:05] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-23 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-23 20:22:05] [INFO ] Added : 36 causal constraints over 8 iterations in 205 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:22:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-23 20:22:05] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2023-03-23 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-23 20:22:05] [INFO ] Added : 36 causal constraints over 8 iterations in 197 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 20:22:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 20:22:05] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-23 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-23 20:22:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 20:22:06] [INFO ] Added : 20 causal constraints over 4 iterations in 228 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 20:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:22:06] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 20:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 20:22:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-23 20:22:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-23 20:22:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:22:06] [INFO ] Added : 21 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 180 ms.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:06] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 20:22:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:22:06] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-23 20:22:06] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-23 20:22:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-23 20:22:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2023-03-23 20:22:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:22:06] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 20:22:06] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:22:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-23 20:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:22:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:22:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:07] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 20:22:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 20:22:07] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-23 20:22:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-23 20:22:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 20:22:07] [INFO ] Added : 22 causal constraints over 5 iterations in 172 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [5, -1, 2, -1, -1, 3, 1, -1, -1, 4, -1, 10, -1, 4]
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-23 20:22:07] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 65 ms.
[2023-03-23 20:22:07] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 667 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 14) seen :27
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :12
[2023-03-23 20:22:08] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-23 20:22:08] [INFO ] Computed 142 place invariants in 97 ms
[2023-03-23 20:22:08] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-23 20:22:08] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 20:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:08] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-23 20:22:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:08] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-23 20:22:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 20:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:13] [INFO ] [Nat]Absence check using state equation in 4830 ms returned unknown
[2023-03-23 20:22:13] [INFO ] [Real]Absence check using 135 positive place invariants in 51 ms returned sat
[2023-03-23 20:22:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 41 ms returned sat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 20:22:14] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-23 20:22:15] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 20:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:15] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-23 20:22:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 40 ms returned sat
[2023-03-23 20:22:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 20:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:16] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-23 20:22:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:22:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 307 ms returned sat
[2023-03-23 20:22:16] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 127 ms.
[2023-03-23 20:22:17] [INFO ] Added : 16 causal constraints over 4 iterations in 1162 ms. Result :sat
Minimization took 443 ms.
[2023-03-23 20:22:18] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-23 20:22:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 20:22:18] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2023-03-23 20:22:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 20:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:19] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2023-03-23 20:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:19] [INFO ] [Nat]Absence check using 135 positive place invariants in 43 ms returned sat
[2023-03-23 20:22:19] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 20:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:19] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2023-03-23 20:22:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 449 ms returned sat
[2023-03-23 20:22:20] [INFO ] Deduced a trap composed of 507 places in 414 ms of which 1 ms to minimize.
[2023-03-23 20:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 602 ms
[2023-03-23 20:22:20] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 82 ms.
[2023-03-23 20:22:21] [INFO ] Added : 19 causal constraints over 4 iterations in 536 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 1, 1, 1, 1, 10, 1, 4] Max seen :[4, 1, 1, 1, 1, 1, 1, 3, 1, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 307 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 200 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2023-03-23 20:22:22] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2023-03-23 20:22:22] [INFO ] Computed 137 place invariants in 37 ms
[2023-03-23 20:22:23] [INFO ] Dead Transitions using invariants and state equation in 1025 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 REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 43 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 ms. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:22:23] [INFO ] Computed 137 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 47311 resets, run finished after 10715 ms. (steps per millisecond=93 ) properties (out of 3) seen :10
Finished Best-First random walk after 876596 steps, including 3073 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=175 )
Incomplete Best-First random walk after 1000001 steps, including 3358 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 3341 resets, run finished after 1718 ms. (steps per millisecond=582 ) properties (out of 3) seen :10
[2023-03-23 20:22:42] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:22:42] [INFO ] Computed 137 place invariants in 28 ms
[2023-03-23 20:22:42] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2023-03-23 20:22:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 20:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:42] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-23 20:22:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 32 ms returned sat
[2023-03-23 20:22:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 20:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:46] [INFO ] [Nat]Absence check using state equation in 3722 ms returned unsat
[2023-03-23 20:22:47] [INFO ] [Real]Absence check using 130 positive place invariants in 32 ms returned sat
[2023-03-23 20:22:47] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 20:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:47] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2023-03-23 20:22:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 35 ms returned sat
[2023-03-23 20:22:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-23 20:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:48] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-23 20:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:22:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 263 ms returned sat
[2023-03-23 20:22:48] [INFO ] Deduced a trap composed of 239 places in 321 ms of which 1 ms to minimize.
[2023-03-23 20:22:49] [INFO ] Deduced a trap composed of 233 places in 297 ms of which 0 ms to minimize.
[2023-03-23 20:22:49] [INFO ] Deduced a trap composed of 242 places in 302 ms of which 0 ms to minimize.
[2023-03-23 20:22:49] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 1 ms to minimize.
[2023-03-23 20:22:50] [INFO ] Deduced a trap composed of 233 places in 292 ms of which 1 ms to minimize.
[2023-03-23 20:22:50] [INFO ] Deduced a trap composed of 245 places in 290 ms of which 1 ms to minimize.
[2023-03-23 20:22:51] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 1 ms to minimize.
[2023-03-23 20:22:51] [INFO ] Deduced a trap composed of 245 places in 289 ms of which 0 ms to minimize.
[2023-03-23 20:22:51] [INFO ] Deduced a trap composed of 227 places in 283 ms of which 1 ms to minimize.
[2023-03-23 20:22:52] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 1 ms to minimize.
[2023-03-23 20:22:52] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 1 ms to minimize.
[2023-03-23 20:22:54] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:22:55] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 0 ms to minimize.
[2023-03-23 20:22:58] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 9611 ms
[2023-03-23 20:22:58] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:22:58] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 20:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:58] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-23 20:22:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:22:58] [INFO ] [Nat]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:22:58] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 20:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:22:59] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-23 20:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2023-03-23 20:22:59] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 1 ms to minimize.
[2023-03-23 20:23:00] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:00] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 2 ms to minimize.
[2023-03-23 20:23:00] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:23:01] [INFO ] Deduced a trap composed of 245 places in 281 ms of which 1 ms to minimize.
[2023-03-23 20:23:01] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:23:01] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 4 ms to minimize.
[2023-03-23 20:23:02] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:02] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 1 ms to minimize.
[2023-03-23 20:23:03] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-23 20:23:03] [INFO ] Deduced a trap composed of 224 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:03] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 1 ms to minimize.
[2023-03-23 20:23:04] [INFO ] Deduced a trap composed of 255 places in 278 ms of which 1 ms to minimize.
[2023-03-23 20:23:04] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:23:05] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:05] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:06] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:23:06] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 0 ms to minimize.
[2023-03-23 20:23:07] [INFO ] Deduced a trap composed of 231 places in 302 ms of which 1 ms to minimize.
[2023-03-23 20:23:07] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 1 ms to minimize.
[2023-03-23 20:23:08] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 1 ms to minimize.
[2023-03-23 20:23:08] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 1 ms to minimize.
[2023-03-23 20:23:08] [INFO ] Deduced a trap composed of 245 places in 267 ms of which 1 ms to minimize.
[2023-03-23 20:23:09] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 1 ms to minimize.
[2023-03-23 20:23:09] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 0 ms to minimize.
[2023-03-23 20:23:10] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:23:11] [INFO ] Deduced a trap composed of 239 places in 272 ms of which 0 ms to minimize.
[2023-03-23 20:23:12] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 2 ms to minimize.
[2023-03-23 20:23:15] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 16160 ms
Current structural bounds on expressions (after SMT) : [4, 10, 4] Max seen :[4, 3, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 40 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:23:15] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47313 resets, run finished after 5651 ms. (steps per millisecond=176 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3365 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3356 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties (out of 2) seen :6
[2023-03-23 20:23:24] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:23:24] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-23 20:23:24] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:23:24] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 20:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:24] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-23 20:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:23:24] [INFO ] [Nat]Absence check using 130 positive place invariants in 34 ms returned sat
[2023-03-23 20:23:24] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 20:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:25] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-23 20:23:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:23:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 242 ms returned sat
[2023-03-23 20:23:25] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 1 ms to minimize.
[2023-03-23 20:23:26] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 0 ms to minimize.
[2023-03-23 20:23:26] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:23:26] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 0 ms to minimize.
[2023-03-23 20:23:27] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 1 ms to minimize.
[2023-03-23 20:23:27] [INFO ] Deduced a trap composed of 245 places in 281 ms of which 0 ms to minimize.
[2023-03-23 20:23:27] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
[2023-03-23 20:23:28] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:23:28] [INFO ] Deduced a trap composed of 227 places in 284 ms of which 1 ms to minimize.
[2023-03-23 20:23:29] [INFO ] Deduced a trap composed of 242 places in 287 ms of which 2 ms to minimize.
[2023-03-23 20:23:29] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 1 ms to minimize.
[2023-03-23 20:23:31] [INFO ] Deduced a trap composed of 248 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:23:31] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 2 ms to minimize.
[2023-03-23 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 9313 ms
[2023-03-23 20:23:34] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:23:35] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 20:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:35] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-23 20:23:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:23:35] [INFO ] [Nat]Absence check using 130 positive place invariants in 29 ms returned sat
[2023-03-23 20:23:35] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 20:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:35] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-23 20:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 266 ms returned sat
[2023-03-23 20:23:36] [INFO ] Deduced a trap composed of 251 places in 281 ms of which 1 ms to minimize.
[2023-03-23 20:23:36] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-23 20:23:37] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-23 20:23:37] [INFO ] Deduced a trap composed of 239 places in 253 ms of which 0 ms to minimize.
[2023-03-23 20:23:37] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 1 ms to minimize.
[2023-03-23 20:23:38] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 0 ms to minimize.
[2023-03-23 20:23:38] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 1 ms to minimize.
[2023-03-23 20:23:39] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 0 ms to minimize.
[2023-03-23 20:23:39] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 1 ms to minimize.
[2023-03-23 20:23:39] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-23 20:23:40] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 0 ms to minimize.
[2023-03-23 20:23:40] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2023-03-23 20:23:40] [INFO ] Deduced a trap composed of 255 places in 261 ms of which 1 ms to minimize.
[2023-03-23 20:23:41] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 0 ms to minimize.
[2023-03-23 20:23:41] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-23 20:23:41] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:43] [INFO ] Deduced a trap composed of 245 places in 267 ms of which 1 ms to minimize.
[2023-03-23 20:23:43] [INFO ] Deduced a trap composed of 245 places in 265 ms of which 1 ms to minimize.
[2023-03-23 20:23:43] [INFO ] Deduced a trap composed of 231 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:23:44] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-23 20:23:44] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 1 ms to minimize.
[2023-03-23 20:23:45] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 0 ms to minimize.
[2023-03-23 20:23:45] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:23:45] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 1 ms to minimize.
[2023-03-23 20:23:46] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:23:46] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 0 ms to minimize.
[2023-03-23 20:23:47] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:23:48] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 1 ms to minimize.
[2023-03-23 20:23:51] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 15822 ms
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 35 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 34 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-23 20:23:52] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:23:52] [INFO ] Invariant cache hit.
[2023-03-23 20:23:53] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-23 20:23:53] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:23:53] [INFO ] Invariant cache hit.
[2023-03-23 20:23:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:23:57] [INFO ] Implicit Places using invariants and state equation in 4356 ms returned []
Implicit Place search using SMT with State Equation took 5285 ms to find 0 implicit places.
[2023-03-23 20:23:57] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-23 20:23:57] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:23:57] [INFO ] Invariant cache hit.
[2023-03-23 20:23:58] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6196 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:23:58] [INFO ] Computed 137 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 477 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-23 20:23:58] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:23:58] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-23 20:23:58] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:23:58] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 20:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:59] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-23 20:23:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:23:59] [INFO ] [Nat]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:23:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 20:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:23:59] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-23 20:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:23:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 241 ms returned sat
[2023-03-23 20:24:00] [INFO ] Deduced a trap composed of 239 places in 278 ms of which 0 ms to minimize.
[2023-03-23 20:24:00] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 1 ms to minimize.
[2023-03-23 20:24:00] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 1 ms to minimize.
[2023-03-23 20:24:01] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 1 ms to minimize.
[2023-03-23 20:24:01] [INFO ] Deduced a trap composed of 233 places in 271 ms of which 0 ms to minimize.
[2023-03-23 20:24:01] [INFO ] Deduced a trap composed of 245 places in 269 ms of which 1 ms to minimize.
[2023-03-23 20:24:02] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-23 20:24:02] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 1 ms to minimize.
[2023-03-23 20:24:03] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 1 ms to minimize.
[2023-03-23 20:24:03] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:24:03] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 0 ms to minimize.
[2023-03-23 20:24:04] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 4208 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-23 20:24:04] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:24:04] [INFO ] Invariant cache hit.
[2023-03-23 20:24:05] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1008 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:24:05] [INFO ] Computed 137 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 47606 resets, run finished after 5480 ms. (steps per millisecond=182 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 3340 resets, run finished after 1317 ms. (steps per millisecond=759 ) properties (out of 1) seen :3
[2023-03-23 20:24:11] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:24:11] [INFO ] Computed 137 place invariants in 28 ms
[2023-03-23 20:24:12] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2023-03-23 20:24:12] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 20:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:12] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2023-03-23 20:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:24:12] [INFO ] [Nat]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-23 20:24:12] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 20:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:13] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2023-03-23 20:24:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:24:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 247 ms returned sat
[2023-03-23 20:24:13] [INFO ] Deduced a trap composed of 239 places in 274 ms of which 1 ms to minimize.
[2023-03-23 20:24:14] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 0 ms to minimize.
[2023-03-23 20:24:14] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 1 ms to minimize.
[2023-03-23 20:24:14] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 0 ms to minimize.
[2023-03-23 20:24:15] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 0 ms to minimize.
[2023-03-23 20:24:15] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:24:15] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:24:16] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 0 ms to minimize.
[2023-03-23 20:24:16] [INFO ] Deduced a trap composed of 227 places in 272 ms of which 1 ms to minimize.
[2023-03-23 20:24:17] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 1 ms to minimize.
[2023-03-23 20:24:17] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 1 ms to minimize.
[2023-03-23 20:24:18] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 0 ms to minimize.
[2023-03-23 20:24:19] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 1 ms to minimize.
[2023-03-23 20:24:22] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 9210 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-23 20:24:22] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:24:22] [INFO ] Invariant cache hit.
[2023-03-23 20:24:23] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-23 20:24:23] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:24:23] [INFO ] Invariant cache hit.
[2023-03-23 20:24:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:24:27] [INFO ] Implicit Places using invariants and state equation in 3985 ms returned []
Implicit Place search using SMT with State Equation took 4865 ms to find 0 implicit places.
[2023-03-23 20:24:27] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 20:24:27] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-23 20:24:27] [INFO ] Invariant cache hit.
[2023-03-23 20:24:28] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5790 ms. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12 in 30210 ms.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:24:28] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 465 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-23 20:24:28] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-23 20:24:28] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-23 20:24:28] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2023-03-23 20:24:28] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 20:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:29] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-23 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:24:29] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2023-03-23 20:24:29] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 20:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:29] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-23 20:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:24:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 274 ms returned sat
[2023-03-23 20:24:30] [INFO ] Deduced a trap composed of 251 places in 273 ms of which 0 ms to minimize.
[2023-03-23 20:24:30] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-23 20:24:30] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 0 ms to minimize.
[2023-03-23 20:24:31] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 0 ms to minimize.
[2023-03-23 20:24:31] [INFO ] Deduced a trap composed of 245 places in 270 ms of which 1 ms to minimize.
[2023-03-23 20:24:32] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 1 ms to minimize.
[2023-03-23 20:24:32] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:24:33] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:24:33] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 1 ms to minimize.
[2023-03-23 20:24:33] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:24:34] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 1 ms to minimize.
[2023-03-23 20:24:34] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-23 20:24:34] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 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 771 transition count 1086
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 770 transition count 1086
Applied a total of 2 rules in 46 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2023-03-23 20:24:34] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-23 20:24:34] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-23 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 905 ms. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2023-03-23 20:24:35] [INFO ] Computed 137 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 52118 resets, run finished after 5931 ms. (steps per millisecond=168 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3500 resets, run finished after 1349 ms. (steps per millisecond=741 ) properties (out of 1) seen :3
[2023-03-23 20:24:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-23 20:24:42] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-23 20:24:42] [INFO ] [Real]Absence check using 130 positive place invariants in 32 ms returned sat
[2023-03-23 20:24:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 20:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:43] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-23 20:24:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:24:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2023-03-23 20:24:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 20:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:24:43] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-23 20:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:24:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 281 ms returned sat
[2023-03-23 20:24:44] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 1 ms to minimize.
[2023-03-23 20:24:44] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 1 ms to minimize.
[2023-03-23 20:24:45] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 1 ms to minimize.
[2023-03-23 20:24:45] [INFO ] Deduced a trap composed of 221 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:24:45] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-23 20:24:46] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 1 ms to minimize.
[2023-03-23 20:24:46] [INFO ] Deduced a trap composed of 251 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:24:46] [INFO ] Deduced a trap composed of 251 places in 263 ms of which 1 ms to minimize.
[2023-03-23 20:24:47] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 0 ms to minimize.
[2023-03-23 20:24:47] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 2 ms to minimize.
[2023-03-23 20:24:48] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 1 ms to minimize.
[2023-03-23 20:24:48] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-23 20:24:49] [INFO ] Deduced a trap composed of 248 places in 281 ms of which 1 ms to minimize.
[2023-03-23 20:24:49] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 1 ms to minimize.
[2023-03-23 20:24:50] [INFO ] Deduced a trap composed of 248 places in 266 ms of which 1 ms to minimize.
[2023-03-23 20:24:50] [INFO ] Deduced a trap composed of 248 places in 272 ms of which 1 ms to minimize.
[2023-03-23 20:24:51] [INFO ] Deduced a trap composed of 245 places in 269 ms of which 1 ms to minimize.
[2023-03-23 20:24:52] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 0 ms to minimize.
[2023-03-23 20:24:52] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:24:52] [INFO ] Deduced a trap composed of 239 places in 279 ms of which 0 ms to minimize.
[2023-03-23 20:24:53] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 1 ms to minimize.
[2023-03-23 20:24:53] [INFO ] Deduced a trap composed of 224 places in 269 ms of which 0 ms to minimize.
[2023-03-23 20:24:53] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 1 ms to minimize.
[2023-03-23 20:24:54] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 0 ms to minimize.
[2023-03-23 20:24:55] [INFO ] Deduced a trap composed of 224 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:24:55] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 1 ms to minimize.
[2023-03-23 20:24:55] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-23 20:24:56] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 1 ms to minimize.
[2023-03-23 20:24:58] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 1 ms to minimize.
[2023-03-23 20:25:00] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 0 ms to minimize.
[2023-03-23 20:25:00] [INFO ] Deduced a trap composed of 254 places in 254 ms of which 1 ms to minimize.
[2023-03-23 20:25:03] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 19657 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 23 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-23 20:25:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-23 20:25:03] [INFO ] Invariant cache hit.
[2023-03-23 20:25:04] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-23 20:25:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-23 20:25:04] [INFO ] Invariant cache hit.
[2023-03-23 20:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:25:08] [INFO ] Implicit Places using invariants and state equation in 4354 ms returned []
Implicit Place search using SMT with State Equation took 5267 ms to find 0 implicit places.
[2023-03-23 20:25:09] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 20:25:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-23 20:25:09] [INFO ] Invariant cache hit.
[2023-03-23 20:25:09] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6119 ms. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14 in 41360 ms.
[2023-03-23 20:25:10] [INFO ] Flatten gal took : 137 ms
[2023-03-23 20:25:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 20:25:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 771 places, 1087 transitions and 5511 arcs took 8 ms.
Total runtime 187799 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1199/ub_0_ --maxsum=/tmp/1199/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15198040 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093576 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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-S05J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S05J60, 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 r297-tall-167873950800661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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