MCC'2024- Execution of r289-tajo-171654445900413

About the Execution of GreatSPN+red for PolyORBNT-COL-S10J30

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.871	3600000.00	12345623.00	1812.80	1 2 ? 1 1 1 10 1 1 1 4 1 3 1 1 10	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445900413.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716881413370

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:30:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 07:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:30:14] [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.
[2024-05-28 07:30:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:30:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 672 ms
[2024-05-28 07:30:15] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-28 07:30:15] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 07:30:15] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:30:15] [INFO ] Computed 13 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 10] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 07:30:15] [INFO ] Invariant cache hit.
[2024-05-28 07:30:15] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 07:30:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 07:30:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 07:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:30:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:15] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 23 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2024-05-28 07:30:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 07:30:16] [INFO ] Added : 36 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 07:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 07:30:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
[2024-05-28 07:30:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-05-28 07:30:16] [INFO ] Added : 20 causal constraints over 4 iterations in 248 ms. Result :sat
Minimization took 130 ms.
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:30:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:30:16] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-28 07:30:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:30:17] [INFO ] Added : 22 causal constraints over 5 iterations in 124 ms. Result :sat
Minimization took 177 ms.
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 175 ms
[2024-05-28 07:30:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2024-05-28 07:30:17] [INFO ] Added : 36 causal constraints over 8 iterations in 113 ms. Result :sat
Minimization took 26 ms.
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 07:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:30:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:17] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-28 07:30:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 07:30:18] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 26 ms.
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-28 07:30:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 07:30:18] [INFO ] Added : 36 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-28 07:30:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-28 07:30:18] [INFO ] Added : 36 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 07:30:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:30:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-28 07:30:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:30:19] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:19] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 14 ms.
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:30:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 07:30:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:19] [INFO ] Added : 15 causal constraints over 3 iterations in 518 ms. Result :sat
Minimization took 125 ms.
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 07:30:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:30:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:30:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 5 ms to minimize.
[2024-05-28 07:30:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-28 07:30:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:20] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 26 ms.
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:30:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 99 ms returned sat
[2024-05-28 07:30:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2024-05-28 07:30:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:20] [INFO ] Added : 21 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 112 ms.
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:30:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:30:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2024-05-28 07:30:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-28 07:30:21] [INFO ] Added : 36 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 43 ms.
[2024-05-28 07:30:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:30:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:30:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:30:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:30:21] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, 10, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:30:21] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 209 ms.
[2024-05-28 07:30:21] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 28 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
[2024-05-28 07:30:21] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-28 07:30:21] [INFO ] Computed 92 invariants in 107 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 11, 10, 1, 3, 32, 31]
RANDOM walk for 10000 steps (559 resets) in 247 ms. (40 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (1043 resets) in 466 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 0, 1, 1, 0, 1, 1] Max Struct:[11, 2, 4, 31, 32, 11, 10, 3, 32, 31]
[2024-05-28 07:30:22] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 07:30:22] [INFO ] Invariant cache hit.
[2024-05-28 07:30:22] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2024-05-28 07:30:22] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-28 07:30:22] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 07:30:22] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 07:30:23] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-05-28 07:30:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:23] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-28 07:30:23] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:24] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2024-05-28 07:30:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:30:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 114 ms returned sat
[2024-05-28 07:30:24] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 312 ms.
[2024-05-28 07:30:26] [INFO ] Added : 10 causal constraints over 2 iterations in 1483 ms. Result :unknown
[2024-05-28 07:30:26] [INFO ] [Real]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 07:30:26] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:30:26] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2024-05-28 07:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:27] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-05-28 07:30:27] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:27] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-28 07:30:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 83 ms returned sat
[2024-05-28 07:30:28] [INFO ] Deduced a trap composed of 282 places in 557 ms of which 5 ms to minimize.
[2024-05-28 07:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1108 ms
[2024-05-28 07:30:29] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 425 ms.
[2024-05-28 07:30:29] [INFO ] Added : 11 causal constraints over 3 iterations in 773 ms. Result :sat
Minimization took 690 ms.
[2024-05-28 07:30:30] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 07:30:30] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-28 07:30:30] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-05-28 07:30:30] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:31] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2024-05-28 07:30:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:31] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 07:30:31] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 07:30:32] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-28 07:30:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2024-05-28 07:30:32] [INFO ] Deduced a trap composed of 154 places in 530 ms of which 5 ms to minimize.
[2024-05-28 07:30:33] [INFO ] Deduced a trap composed of 323 places in 509 ms of which 4 ms to minimize.
[2024-05-28 07:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1234 ms
[2024-05-28 07:30:33] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 177 ms.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 12 places in 628 ms of which 5 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 19 places in 853 ms of which 6 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1730 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 07:30:36] [INFO ] [Real]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 07:30:36] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-28 07:30:36] [INFO ] [Real]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 07:30:36] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:37] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2024-05-28 07:30:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:37] [INFO ] [Nat]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 07:30:37] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:38] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-28 07:30:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 233 ms returned sat
[2024-05-28 07:30:39] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 224 ms.
[2024-05-28 07:30:39] [INFO ] Added : 6 causal constraints over 2 iterations in 633 ms. Result :sat
Minimization took 904 ms.
[2024-05-28 07:30:40] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-28 07:30:40] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 07:30:41] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2024-05-28 07:30:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:30:41] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 07:30:41] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:30:42] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-28 07:30:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 213 ms returned sat
[2024-05-28 07:30:42] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 392 ms.
[2024-05-28 07:30:44] [INFO ] Deduced a trap composed of 292 places in 741 ms of which 5 ms to minimize.
[2024-05-28 07:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1025 ms
[2024-05-28 07:30:44] [INFO ] Added : 11 causal constraints over 3 iterations in 2057 ms. Result :sat
Minimization took 780 ms.
[2024-05-28 07:30:45] [INFO ] [Real]Absence check using 85 positive place invariants in 31 ms returned sat
[2024-05-28 07:30:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned unsat
[2024-05-28 07:30:45] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 07:30:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 0, 1, 1, 0, 1, 1] Max Struct:[1, 2, 4, 1, 32, 1, 10, 3, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[2, 4, 32, 10, 3]
Support contains 35 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1868
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 158 place count 580 transition count 1866
Applied a total of 158 rules in 420 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 07:30:46] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 07:30:46] [INFO ] Computed 82 invariants in 95 ms
[2024-05-28 07:30:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 (/ 1.0 3.0))
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 1.0 3.0))
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 (/ 1.0 3.0))
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 4.0)
(s199 4.0)
(s200 4.0)
(s201 4.0)
(s202 4.0)
(s203 4.0)
(s204 4.0)
(s205 4.0)
(s206 4.0)
(s207 4.0)
(s208 9.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 07:31:27] [INFO ] Deduced a trap composed of 18 places in 521 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 73 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 1/1 constraints]
After SMT, in 58358ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 58414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58869 ms. Remains : 580/664 places, 1866/1940 transitions.
[2024-05-28 07:31:44] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:31:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[2, 4, 32, 10, 3]
RANDOM walk for 1000000 steps (72784 resets) in 16172 ms. (61 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (26697 resets) in 7916 ms. (378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 4] Max Struct:[4, 32, 10]
[2024-05-28 07:32:08] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:08] [INFO ] Invariant cache hit.
[2024-05-28 07:32:08] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-28 07:32:08] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 07:32:09] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2024-05-28 07:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:32:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-28 07:32:09] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 07:32:10] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2024-05-28 07:32:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:32:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2024-05-28 07:32:10] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 258 ms.
[2024-05-28 07:32:11] [INFO ] Added : 8 causal constraints over 2 iterations in 694 ms. Result :sat
Minimization took 2918 ms.
[2024-05-28 07:32:14] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-28 07:32:14] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned unsat
[2024-05-28 07:32:14] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-28 07:32:14] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 4] Max Struct:[4, 1, 4]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 58 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 580/580 places, 1866/1866 transitions.
[2024-05-28 07:32:14] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72355 resets) in 16019 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (9030 resets) in 2711 ms. (368 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:32:33] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:33] [INFO ] Invariant cache hit.
[2024-05-28 07:32:33] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2024-05-28 07:32:33] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 07:32:33] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-05-28 07:32:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:32:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-28 07:32:33] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 07:32:34] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2024-05-28 07:32:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:32:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 134 ms returned sat
[2024-05-28 07:32:34] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 235 ms.
[2024-05-28 07:32:35] [INFO ] Added : 8 causal constraints over 2 iterations in 776 ms. Result :sat
Minimization took 3715 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 58 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 56 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 07:32:39] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:39] [INFO ] Invariant cache hit.
[2024-05-28 07:32:42] [INFO ] Implicit Places using invariants in 3408 ms returned []
[2024-05-28 07:32:42] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:42] [INFO ] Invariant cache hit.
[2024-05-28 07:32:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:32:45] [INFO ] Implicit Places using invariants and state equation in 2954 ms returned []
Implicit Place search using SMT with State Equation took 6371 ms to find 0 implicit places.
[2024-05-28 07:32:45] [INFO ] Redundant transitions in 92 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 07:32:46] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 07:32:46] [INFO ] Invariant cache hit.
[2024-05-28 07:32:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/579 variables, 9/81 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/2437 variables, and 81 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 0/0 constraints]
After SMT, in 84728ms problems are : Problem set: 558 solved, 1297 unsolved
Search for dead transitions found 558 dead transitions in 84761ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1308/1866 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 07:34:10] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 91423 ms. Remains : 580/580 places, 1308/1866 transitions.
[2024-05-28 07:34:10] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-05-28 07:34:10] [INFO ] Computed 82 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72724 resets) in 10348 ms. (96 steps per ms)
BEST_FIRST walk for 1000001 steps (8911 resets) in 1832 ms. (545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:34:23] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:34:23] [INFO ] Invariant cache hit.
[2024-05-28 07:34:23] [INFO ] [Real]Absence check using 75 positive place invariants in 27 ms returned sat
[2024-05-28 07:34:23] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-28 07:34:23] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-28 07:34:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:23] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-28 07:34:23] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 07:34:24] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-28 07:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:34:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 152 ms returned sat
[2024-05-28 07:34:25] [INFO ] Deduced a trap composed of 232 places in 424 ms of which 4 ms to minimize.
[2024-05-28 07:34:25] [INFO ] Deduced a trap composed of 228 places in 421 ms of which 5 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 230 places in 526 ms of which 4 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 240 places in 429 ms of which 4 ms to minimize.
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 230 places in 417 ms of which 4 ms to minimize.
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 237 places in 406 ms of which 4 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 228 places in 542 ms of which 3 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 230 places in 545 ms of which 4 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 234 places in 547 ms of which 3 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 234 places in 397 ms of which 5 ms to minimize.
[2024-05-28 07:34:30] [INFO ] Deduced a trap composed of 234 places in 532 ms of which 4 ms to minimize.
[2024-05-28 07:34:31] [INFO ] Deduced a trap composed of 236 places in 448 ms of which 3 ms to minimize.
[2024-05-28 07:34:31] [INFO ] Deduced a trap composed of 228 places in 387 ms of which 3 ms to minimize.
[2024-05-28 07:34:32] [INFO ] Deduced a trap composed of 228 places in 448 ms of which 4 ms to minimize.
[2024-05-28 07:34:32] [INFO ] Deduced a trap composed of 234 places in 406 ms of which 3 ms to minimize.
[2024-05-28 07:34:33] [INFO ] Deduced a trap composed of 230 places in 346 ms of which 7 ms to minimize.
[2024-05-28 07:34:33] [INFO ] Deduced a trap composed of 232 places in 541 ms of which 3 ms to minimize.
[2024-05-28 07:34:34] [INFO ] Deduced a trap composed of 226 places in 598 ms of which 3 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 237 places in 583 ms of which 4 ms to minimize.
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 230 places in 530 ms of which 3 ms to minimize.
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 228 places in 487 ms of which 3 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 220 places in 546 ms of which 4 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 224 places in 412 ms of which 4 ms to minimize.
[2024-05-28 07:34:38] [INFO ] Deduced a trap composed of 224 places in 625 ms of which 4 ms to minimize.
[2024-05-28 07:34:38] [INFO ] Deduced a trap composed of 220 places in 510 ms of which 3 ms to minimize.
[2024-05-28 07:34:39] [INFO ] Deduced a trap composed of 228 places in 512 ms of which 4 ms to minimize.
[2024-05-28 07:34:40] [INFO ] Deduced a trap composed of 222 places in 592 ms of which 3 ms to minimize.
[2024-05-28 07:34:42] [INFO ] Deduced a trap composed of 240 places in 529 ms of which 5 ms to minimize.
[2024-05-28 07:34:43] [INFO ] Deduced a trap composed of 234 places in 492 ms of which 4 ms to minimize.
[2024-05-28 07:34:43] [INFO ] Deduced a trap composed of 242 places in 422 ms of which 3 ms to minimize.
[2024-05-28 07:34:44] [INFO ] Deduced a trap composed of 234 places in 450 ms of which 4 ms to minimize.
[2024-05-28 07:34:44] [INFO ] Deduced a trap composed of 236 places in 437 ms of which 4 ms to minimize.
[2024-05-28 07:34:45] [INFO ] Deduced a trap composed of 245 places in 428 ms of which 4 ms to minimize.
[2024-05-28 07:34:45] [INFO ] Deduced a trap composed of 244 places in 454 ms of which 4 ms to minimize.
[2024-05-28 07:34:46] [INFO ] Deduced a trap composed of 242 places in 464 ms of which 5 ms to minimize.
[2024-05-28 07:34:47] [INFO ] Deduced a trap composed of 234 places in 419 ms of which 3 ms to minimize.
[2024-05-28 07:34:48] [INFO ] Deduced a trap composed of 230 places in 429 ms of which 5 ms to minimize.
[2024-05-28 07:34:48] [INFO ] Deduced a trap composed of 238 places in 416 ms of which 4 ms to minimize.
[2024-05-28 07:34:49] [INFO ] Deduced a trap composed of 232 places in 383 ms of which 4 ms to minimize.
[2024-05-28 07:34:49] [INFO ] Deduced a trap composed of 222 places in 385 ms of which 3 ms to minimize.
[2024-05-28 07:34:50] [INFO ] Deduced a trap composed of 230 places in 456 ms of which 5 ms to minimize.
[2024-05-28 07:34:50] [INFO ] Deduced a trap composed of 228 places in 474 ms of which 4 ms to minimize.
[2024-05-28 07:34:51] [INFO ] Deduced a trap composed of 234 places in 449 ms of which 4 ms to minimize.
[2024-05-28 07:34:51] [INFO ] Deduced a trap composed of 236 places in 473 ms of which 5 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 236 places in 439 ms of which 4 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 226 places in 415 ms of which 4 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 230 places in 411 ms of which 5 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 222 places in 404 ms of which 4 ms to minimize.
[2024-05-28 07:34:54] [INFO ] Deduced a trap composed of 232 places in 361 ms of which 3 ms to minimize.
[2024-05-28 07:34:54] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 4 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 236 places in 392 ms of which 4 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 232 places in 363 ms of which 4 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 228 places in 318 ms of which 3 ms to minimize.
[2024-05-28 07:34:56] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 4 ms to minimize.
[2024-05-28 07:34:56] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 4 ms to minimize.
[2024-05-28 07:34:58] [INFO ] Deduced a trap composed of 234 places in 413 ms of which 4 ms to minimize.
[2024-05-28 07:34:59] [INFO ] Deduced a trap composed of 234 places in 368 ms of which 3 ms to minimize.
[2024-05-28 07:34:59] [INFO ] Deduced a trap composed of 230 places in 386 ms of which 4 ms to minimize.
[2024-05-28 07:35:00] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 5 ms to minimize.
[2024-05-28 07:35:00] [INFO ] Deduced a trap composed of 232 places in 459 ms of which 3 ms to minimize.
[2024-05-28 07:35:01] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 4 ms to minimize.
[2024-05-28 07:35:01] [INFO ] Deduced a trap composed of 236 places in 403 ms of which 5 ms to minimize.
[2024-05-28 07:35:02] [INFO ] Deduced a trap composed of 230 places in 394 ms of which 3 ms to minimize.
[2024-05-28 07:35:03] [INFO ] Deduced a trap composed of 230 places in 413 ms of which 5 ms to minimize.
[2024-05-28 07:35:03] [INFO ] Deduced a trap composed of 230 places in 405 ms of which 4 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 228 places in 401 ms of which 4 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 232 places in 392 ms of which 4 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 238 places in 395 ms of which 5 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 228 places in 427 ms of which 4 ms to minimize.
[2024-05-28 07:35:06] [INFO ] Deduced a trap composed of 234 places in 447 ms of which 3 ms to minimize.
[2024-05-28 07:35:07] [INFO ] Deduced a trap composed of 226 places in 436 ms of which 4 ms to minimize.
[2024-05-28 07:35:08] [INFO ] Trap strengthening (SAT) tested/added 71/71 trap constraints in 44209 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 60 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 36 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 07:35:08] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:08] [INFO ] Invariant cache hit.
[2024-05-28 07:35:09] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-28 07:35:09] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:09] [INFO ] Invariant cache hit.
[2024-05-28 07:35:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:35:12] [INFO ] Implicit Places using invariants and state equation in 2834 ms returned []
Implicit Place search using SMT with State Equation took 3854 ms to find 0 implicit places.
[2024-05-28 07:35:12] [INFO ] Redundant transitions in 110 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:35:12] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:12] [INFO ] Invariant cache hit.
[2024-05-28 07:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:31] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 3 ms to minimize.
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 166 places in 383 ms of which 3 ms to minimize.
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 234 places in 409 ms of which 3 ms to minimize.
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 3 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 171 places in 300 ms of which 3 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 176 places in 356 ms of which 4 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 176 places in 310 ms of which 3 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 171 places in 253 ms of which 3 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 230 places in 5386 ms of which 4 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 166 places in 481 ms of which 5 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 156 places in 340 ms of which 3 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 161 places in 366 ms of which 3 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 156 places in 315 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 151 places in 299 ms of which 3 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 4 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 156 places in 421 ms of which 5 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 4 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 4 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 171 places in 249 ms of which 3 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:44] [INFO ] Deduced a trap composed of 244 places in 269 ms of which 4 ms to minimize.
[2024-05-28 07:35:44] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:35:44] [INFO ] Deduced a trap composed of 244 places in 287 ms of which 4 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 161 places in 288 ms of which 5 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 161 places in 286 ms of which 4 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 161 places in 284 ms of which 4 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 176 places in 274 ms of which 4 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 171 places in 282 ms of which 4 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 240 places in 287 ms of which 4 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 244 places in 281 ms of which 4 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 246 places in 229 ms of which 3 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 244 places in 229 ms of which 3 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 4 ms to minimize.
[2024-05-28 07:35:48] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 4 ms to minimize.
[2024-05-28 07:35:48] [INFO ] Deduced a trap composed of 171 places in 239 ms of which 4 ms to minimize.
[2024-05-28 07:35:48] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 4 ms to minimize.
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 5 ms to minimize.
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 176 places in 324 ms of which 4 ms to minimize.
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 181 places in 298 ms of which 5 ms to minimize.
[2024-05-28 07:35:50] [INFO ] Deduced a trap composed of 156 places in 286 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 2 ms to minimize.
[2024-05-28 07:36:05] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 4 ms to minimize.
[2024-05-28 07:36:09] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 4 ms to minimize.
[2024-05-28 07:36:09] [INFO ] Deduced a trap composed of 244 places in 254 ms of which 3 ms to minimize.
[2024-05-28 07:36:10] [INFO ] Deduced a trap composed of 236 places in 375 ms of which 4 ms to minimize.
[2024-05-28 07:36:10] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 4 ms to minimize.
[2024-05-28 07:36:10] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 3 ms to minimize.
[2024-05-28 07:36:10] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:36:11] [INFO ] Deduced a trap composed of 238 places in 407 ms of which 5 ms to minimize.
[2024-05-28 07:36:11] [INFO ] Deduced a trap composed of 239 places in 353 ms of which 4 ms to minimize.
[2024-05-28 07:36:12] [INFO ] Deduced a trap composed of 236 places in 342 ms of which 4 ms to minimize.
[2024-05-28 07:36:12] [INFO ] Deduced a trap composed of 229 places in 385 ms of which 4 ms to minimize.
[2024-05-28 07:36:12] [INFO ] Deduced a trap composed of 228 places in 348 ms of which 4 ms to minimize.
[2024-05-28 07:36:13] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 3 ms to minimize.
[2024-05-28 07:36:13] [INFO ] Deduced a trap composed of 245 places in 353 ms of which 3 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 242 places in 347 ms of which 3 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 236 places in 326 ms of which 6 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 4 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 3 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 236 places in 361 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 132 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 60/60 constraints]
After SMT, in 67970ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72011 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2901 resets) in 1755 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (350 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 384654 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 384654 steps, saw 61886 distinct states, run finished after 3006 ms. (steps per millisecond=127 ) properties seen :0
[2024-05-28 07:36:24] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:24] [INFO ] Invariant cache hit.
[2024-05-28 07:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:36:26] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 3 ms to minimize.
[2024-05-28 07:36:26] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 4 ms to minimize.
[2024-05-28 07:36:26] [INFO ] Deduced a trap composed of 230 places in 353 ms of which 3 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 226 places in 325 ms of which 4 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 230 places in 434 ms of which 13 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:36:29] [INFO ] Deduced a trap composed of 242 places in 510 ms of which 3 ms to minimize.
[2024-05-28 07:36:29] [INFO ] Deduced a trap composed of 243 places in 424 ms of which 4 ms to minimize.
[2024-05-28 07:36:30] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 4 ms to minimize.
[2024-05-28 07:36:30] [INFO ] Deduced a trap composed of 228 places in 358 ms of which 4 ms to minimize.
SMT process timed out in 5870ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 36 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:36:30] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:30] [INFO ] Invariant cache hit.
[2024-05-28 07:36:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 234 places in 312 ms of which 5 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 166 places in 289 ms of which 4 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 234 places in 333 ms of which 3 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 236 places in 409 ms of which 3 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 171 places in 341 ms of which 3 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 176 places in 378 ms of which 3 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 176 places in 306 ms of which 3 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 171 places in 306 ms of which 3 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 156 places in 304 ms of which 3 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 3 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 3 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 156 places in 400 ms of which 3 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 3 ms to minimize.
[2024-05-28 07:36:56] [INFO ] Deduced a trap composed of 171 places in 400 ms of which 3 ms to minimize.
[2024-05-28 07:36:56] [INFO ] Deduced a trap composed of 171 places in 332 ms of which 3 ms to minimize.
[2024-05-28 07:36:56] [INFO ] Deduced a trap composed of 176 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:57] [INFO ] Deduced a trap composed of 244 places in 321 ms of which 5 ms to minimize.
SMT process timed out in 27054ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 27071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27116 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2947 resets) in 973 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (377 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (351 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311375 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311375 steps, saw 50618 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-28 07:37:01] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:37:01] [INFO ] Invariant cache hit.
[2024-05-28 07:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 226 places in 336 ms of which 5 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 228 places in 349 ms of which 3 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 230 places in 327 ms of which 3 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 4 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 3 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 228 places in 440 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 242 places in 422 ms of which 3 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 243 places in 383 ms of which 3 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 232 places in 443 ms of which 3 ms to minimize.
[2024-05-28 07:37:07] [INFO ] Deduced a trap composed of 228 places in 790 ms of which 4 ms to minimize.
[2024-05-28 07:37:08] [INFO ] Deduced a trap composed of 226 places in 350 ms of which 4 ms to minimize.
[2024-05-28 07:37:08] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 4 ms to minimize.
[2024-05-28 07:37:09] [INFO ] Deduced a trap composed of 228 places in 525 ms of which 4 ms to minimize.
[2024-05-28 07:37:09] [INFO ] Deduced a trap composed of 232 places in 422 ms of which 5 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 240 places in 375 ms of which 5 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 234 places in 375 ms of which 4 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 232 places in 350 ms of which 4 ms to minimize.
[2024-05-28 07:37:11] [INFO ] Deduced a trap composed of 239 places in 339 ms of which 4 ms to minimize.
[2024-05-28 07:37:11] [INFO ] Deduced a trap composed of 230 places in 478 ms of which 4 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 232 places in 351 ms of which 4 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 238 places in 362 ms of which 4 ms to minimize.
[2024-05-28 07:37:13] [INFO ] Deduced a trap composed of 249 places in 359 ms of which 4 ms to minimize.
[2024-05-28 07:37:13] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 3 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 234 places in 364 ms of which 3 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 234 places in 408 ms of which 4 ms to minimize.
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 234 places in 523 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 20/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 234 places in 364 ms of which 4 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 228 places in 376 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 234 places in 373 ms of which 6 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 4 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 241 places in 385 ms of which 4 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 232 places in 396 ms of which 5 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 5 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 243 places in 354 ms of which 4 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 236 places in 350 ms of which 4 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 234 places in 577 ms of which 4 ms to minimize.
[2024-05-28 07:37:20] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 3 ms to minimize.
[2024-05-28 07:37:21] [INFO ] Deduced a trap composed of 234 places in 571 ms of which 3 ms to minimize.
[2024-05-28 07:37:22] [INFO ] Deduced a trap composed of 234 places in 410 ms of which 4 ms to minimize.
[2024-05-28 07:37:22] [INFO ] Deduced a trap composed of 228 places in 378 ms of which 4 ms to minimize.
[2024-05-28 07:37:23] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 3 ms to minimize.
[2024-05-28 07:37:23] [INFO ] Deduced a trap composed of 234 places in 322 ms of which 3 ms to minimize.
[2024-05-28 07:37:24] [INFO ] Deduced a trap composed of 245 places in 371 ms of which 3 ms to minimize.
[2024-05-28 07:37:24] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 3 ms to minimize.
[2024-05-28 07:37:27] [INFO ] Deduced a trap composed of 242 places in 2586 ms of which 4 ms to minimize.
[2024-05-28 07:37:28] [INFO ] Deduced a trap composed of 242 places in 370 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1878 variables, 20/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:37:29] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 4 ms to minimize.
[2024-05-28 07:37:29] [INFO ] Deduced a trap composed of 238 places in 405 ms of which 4 ms to minimize.
[2024-05-28 07:37:30] [INFO ] Deduced a trap composed of 238 places in 373 ms of which 3 ms to minimize.
[2024-05-28 07:37:30] [INFO ] Deduced a trap composed of 236 places in 393 ms of which 4 ms to minimize.
[2024-05-28 07:37:31] [INFO ] Deduced a trap composed of 240 places in 608 ms of which 3 ms to minimize.
[2024-05-28 07:37:32] [INFO ] Deduced a trap composed of 234 places in 402 ms of which 5 ms to minimize.
[2024-05-28 07:37:32] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 6 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 237 places in 297 ms of which 3 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 4 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 240 places in 363 ms of which 4 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 242 places in 345 ms of which 4 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 4 ms to minimize.
[2024-05-28 07:37:35] [INFO ] Deduced a trap composed of 243 places in 374 ms of which 4 ms to minimize.
[2024-05-28 07:37:35] [INFO ] Deduced a trap composed of 228 places in 363 ms of which 5 ms to minimize.
[2024-05-28 07:37:36] [INFO ] Deduced a trap composed of 240 places in 359 ms of which 4 ms to minimize.
[2024-05-28 07:37:36] [INFO ] Deduced a trap composed of 232 places in 440 ms of which 5 ms to minimize.
[2024-05-28 07:37:37] [INFO ] Deduced a trap composed of 238 places in 428 ms of which 4 ms to minimize.
[2024-05-28 07:37:38] [INFO ] Deduced a trap composed of 236 places in 442 ms of which 28 ms to minimize.
[2024-05-28 07:37:38] [INFO ] Deduced a trap composed of 236 places in 378 ms of which 3 ms to minimize.
[2024-05-28 07:37:39] [INFO ] Deduced a trap composed of 230 places in 439 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1878 variables, 20/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:37:40] [INFO ] Deduced a trap composed of 230 places in 462 ms of which 4 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 246 places in 397 ms of which 4 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 238 places in 479 ms of which 5 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 238 places in 485 ms of which 4 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 238 places in 396 ms of which 4 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 3 ms to minimize.
[2024-05-28 07:37:43] [INFO ] Deduced a trap composed of 237 places in 303 ms of which 3 ms to minimize.
[2024-05-28 07:37:43] [INFO ] Deduced a trap composed of 230 places in 352 ms of which 4 ms to minimize.
[2024-05-28 07:37:44] [INFO ] Deduced a trap composed of 237 places in 348 ms of which 4 ms to minimize.
[2024-05-28 07:37:44] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 4 ms to minimize.
[2024-05-28 07:37:45] [INFO ] Deduced a trap composed of 241 places in 391 ms of which 3 ms to minimize.
[2024-05-28 07:37:45] [INFO ] Deduced a trap composed of 228 places in 410 ms of which 3 ms to minimize.
[2024-05-28 07:37:45] [INFO ] Deduced a trap composed of 240 places in 406 ms of which 3 ms to minimize.
[2024-05-28 07:37:46] [INFO ] Deduced a trap composed of 247 places in 387 ms of which 3 ms to minimize.
[2024-05-28 07:37:46] [INFO ] Deduced a trap composed of 236 places in 408 ms of which 3 ms to minimize.
[2024-05-28 07:37:47] [INFO ] Deduced a trap composed of 238 places in 426 ms of which 4 ms to minimize.
[2024-05-28 07:37:47] [INFO ] Deduced a trap composed of 240 places in 392 ms of which 3 ms to minimize.
SMT process timed out in 46607ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 31 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 07:37:47] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:37:47] [INFO ] Invariant cache hit.
[2024-05-28 07:37:48] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-28 07:37:48] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:37:48] [INFO ] Invariant cache hit.
[2024-05-28 07:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:37:51] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2024-05-28 07:37:51] [INFO ] Redundant transitions in 20 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:37:51] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:37:51] [INFO ] Invariant cache hit.
[2024-05-28 07:37:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 4 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 3 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 3 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 4 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 171 places in 288 ms of which 3 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 176 places in 276 ms of which 3 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 176 places in 246 ms of which 5 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 171 places in 298 ms of which 3 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 3 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 4 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 156 places in 299 ms of which 4 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 161 places in 261 ms of which 4 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 3 ms to minimize.
[2024-05-28 07:38:14] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:38:14] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:38:14] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 3 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 236 places in 297 ms of which 4 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 171 places in 314 ms of which 3 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 171 places in 268 ms of which 3 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 176 places in 276 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 244 places in 348 ms of which 3 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 3 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 244 places in 279 ms of which 4 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 161 places in 308 ms of which 3 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 161 places in 276 ms of which 4 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 3 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 176 places in 305 ms of which 5 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 171 places in 275 ms of which 3 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 244 places in 305 ms of which 17 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 246 places in 301 ms of which 4 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 244 places in 342 ms of which 3 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 171 places in 2232 ms of which 29 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 171 places in 362 ms of which 4 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 171 places in 356 ms of which 3 ms to minimize.
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 234 places in 2548 ms of which 3 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 234 places in 371 ms of which 4 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 176 places in 441 ms of which 4 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 181 places in 320 ms of which 4 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 156 places in 319 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 1 ms to minimize.
[2024-05-28 07:38:46] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 4 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 3 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 244 places in 326 ms of which 4 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 4 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 230 places in 370 ms of which 3 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 232 places in 313 ms of which 3 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 240 places in 324 ms of which 3 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 238 places in 528 ms of which 4 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 239 places in 474 ms of which 4 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 236 places in 505 ms of which 3 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 229 places in 407 ms of which 4 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 228 places in 531 ms of which 3 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 228 places in 620 ms of which 3 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 245 places in 563 ms of which 3 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 242 places in 575 ms of which 4 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 236 places in 565 ms of which 3 ms to minimize.
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 236 places in 622 ms of which 9 ms to minimize.
[2024-05-28 07:38:58] [INFO ] Deduced a trap composed of 234 places in 444 ms of which 4 ms to minimize.
[2024-05-28 07:38:58] [INFO ] Deduced a trap composed of 236 places in 544 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 132 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 60/60 constraints]
After SMT, in 67465ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71481 ms. Remains : 580/580 places, 1308/1308 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 07:38:59] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:38:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (719 resets) in 100 ms. (99 steps per ms)
BEST_FIRST walk for 10001 steps (85 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:38:59] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:38:59] [INFO ] Invariant cache hit.
[2024-05-28 07:38:59] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2024-05-28 07:38:59] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-28 07:39:00] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-28 07:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:39:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-28 07:39:00] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-28 07:39:00] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-28 07:39:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:39:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 123 ms returned sat
[2024-05-28 07:39:01] [INFO ] Deduced a trap composed of 232 places in 499 ms of which 3 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 228 places in 731 ms of which 4 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 230 places in 567 ms of which 3 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 240 places in 584 ms of which 3 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 230 places in 579 ms of which 4 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 237 places in 578 ms of which 3 ms to minimize.
[2024-05-28 07:39:05] [INFO ] Deduced a trap composed of 228 places in 573 ms of which 5 ms to minimize.
[2024-05-28 07:39:05] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 35 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:39:05] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:39:05] [INFO ] Invariant cache hit.
[2024-05-28 07:39:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
SMT process timed out in 27367ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 27384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27423 ms. Remains : 580/580 places, 1308/1308 transitions.
[2024-05-28 07:39:32] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:39:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72822 resets) in 9742 ms. (102 steps per ms)
BEST_FIRST walk for 1000000 steps (8935 resets) in 1826 ms. (547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:39:44] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:39:44] [INFO ] Invariant cache hit.
[2024-05-28 07:39:44] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-28 07:39:44] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:39:45] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-28 07:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:39:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 25 ms returned sat
[2024-05-28 07:39:45] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 07:39:45] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2024-05-28 07:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:39:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 118 ms returned sat
[2024-05-28 07:39:46] [INFO ] Deduced a trap composed of 232 places in 763 ms of which 5 ms to minimize.
[2024-05-28 07:39:47] [INFO ] Deduced a trap composed of 228 places in 571 ms of which 3 ms to minimize.
[2024-05-28 07:39:48] [INFO ] Deduced a trap composed of 230 places in 572 ms of which 3 ms to minimize.
[2024-05-28 07:39:48] [INFO ] Deduced a trap composed of 240 places in 556 ms of which 3 ms to minimize.
[2024-05-28 07:39:49] [INFO ] Deduced a trap composed of 230 places in 459 ms of which 3 ms to minimize.
[2024-05-28 07:39:49] [INFO ] Deduced a trap composed of 237 places in 428 ms of which 3 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 228 places in 403 ms of which 3 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 230 places in 452 ms of which 3 ms to minimize.
[2024-05-28 07:39:51] [INFO ] Deduced a trap composed of 234 places in 492 ms of which 4 ms to minimize.
[2024-05-28 07:39:51] [INFO ] Deduced a trap composed of 234 places in 443 ms of which 3 ms to minimize.
[2024-05-28 07:39:52] [INFO ] Deduced a trap composed of 234 places in 428 ms of which 3 ms to minimize.
[2024-05-28 07:39:52] [INFO ] Deduced a trap composed of 236 places in 374 ms of which 3 ms to minimize.
[2024-05-28 07:39:53] [INFO ] Deduced a trap composed of 228 places in 592 ms of which 4 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 228 places in 450 ms of which 3 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 234 places in 441 ms of which 3 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 230 places in 548 ms of which 4 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 232 places in 402 ms of which 4 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 226 places in 461 ms of which 4 ms to minimize.
[2024-05-28 07:39:57] [INFO ] Deduced a trap composed of 237 places in 462 ms of which 5 ms to minimize.
[2024-05-28 07:39:57] [INFO ] Deduced a trap composed of 230 places in 443 ms of which 3 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 228 places in 450 ms of which 3 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 220 places in 474 ms of which 3 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 224 places in 448 ms of which 3 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 224 places in 492 ms of which 5 ms to minimize.
[2024-05-28 07:40:00] [INFO ] Deduced a trap composed of 220 places in 426 ms of which 5 ms to minimize.
[2024-05-28 07:40:00] [INFO ] Deduced a trap composed of 228 places in 343 ms of which 3 ms to minimize.
[2024-05-28 07:40:01] [INFO ] Deduced a trap composed of 222 places in 376 ms of which 4 ms to minimize.
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 240 places in 519 ms of which 3 ms to minimize.
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 234 places in 541 ms of which 3 ms to minimize.
[2024-05-28 07:40:04] [INFO ] Deduced a trap composed of 242 places in 538 ms of which 4 ms to minimize.
[2024-05-28 07:40:05] [INFO ] Deduced a trap composed of 234 places in 529 ms of which 3 ms to minimize.
[2024-05-28 07:40:05] [INFO ] Deduced a trap composed of 236 places in 565 ms of which 3 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 245 places in 544 ms of which 3 ms to minimize.
[2024-05-28 07:40:14] [INFO ] Deduced a trap composed of 244 places in 8201 ms of which 5 ms to minimize.
[2024-05-28 07:40:15] [INFO ] Deduced a trap composed of 242 places in 397 ms of which 3 ms to minimize.
[2024-05-28 07:40:16] [INFO ] Deduced a trap composed of 234 places in 466 ms of which 5 ms to minimize.
[2024-05-28 07:40:17] [INFO ] Deduced a trap composed of 230 places in 434 ms of which 4 ms to minimize.
[2024-05-28 07:40:17] [INFO ] Deduced a trap composed of 238 places in 435 ms of which 4 ms to minimize.
[2024-05-28 07:40:18] [INFO ] Deduced a trap composed of 232 places in 493 ms of which 4 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 222 places in 500 ms of which 5 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 230 places in 492 ms of which 4 ms to minimize.
[2024-05-28 07:40:20] [INFO ] Deduced a trap composed of 228 places in 451 ms of which 4 ms to minimize.
[2024-05-28 07:40:20] [INFO ] Deduced a trap composed of 234 places in 605 ms of which 5 ms to minimize.
[2024-05-28 07:40:21] [INFO ] Deduced a trap composed of 236 places in 512 ms of which 4 ms to minimize.
[2024-05-28 07:40:22] [INFO ] Deduced a trap composed of 236 places in 412 ms of which 4 ms to minimize.
[2024-05-28 07:40:22] [INFO ] Deduced a trap composed of 226 places in 408 ms of which 3 ms to minimize.
[2024-05-28 07:40:23] [INFO ] Deduced a trap composed of 230 places in 420 ms of which 4 ms to minimize.
[2024-05-28 07:40:23] [INFO ] Deduced a trap composed of 222 places in 442 ms of which 3 ms to minimize.
[2024-05-28 07:40:24] [INFO ] Deduced a trap composed of 232 places in 488 ms of which 4 ms to minimize.
[2024-05-28 07:40:24] [INFO ] Deduced a trap composed of 232 places in 490 ms of which 4 ms to minimize.
[2024-05-28 07:40:25] [INFO ] Deduced a trap composed of 236 places in 513 ms of which 5 ms to minimize.
[2024-05-28 07:40:25] [INFO ] Deduced a trap composed of 232 places in 410 ms of which 4 ms to minimize.
[2024-05-28 07:40:26] [INFO ] Deduced a trap composed of 228 places in 426 ms of which 4 ms to minimize.
[2024-05-28 07:40:27] [INFO ] Deduced a trap composed of 234 places in 550 ms of which 4 ms to minimize.
[2024-05-28 07:40:38] [INFO ] Deduced a trap composed of 230 places in 11628 ms of which 3 ms to minimize.
[2024-05-28 07:40:38] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 07:40:38] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:40:38] [INFO ] Invariant cache hit.
[2024-05-28 07:40:39] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-28 07:40:39] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:40:39] [INFO ] Invariant cache hit.
[2024-05-28 07:40:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:40:42] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
[2024-05-28 07:40:42] [INFO ] Redundant transitions in 24 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:40:42] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:40:42] [INFO ] Invariant cache hit.
[2024-05-28 07:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:41:04] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 5 ms to minimize.
[2024-05-28 07:41:04] [INFO ] Deduced a trap composed of 166 places in 397 ms of which 3 ms to minimize.
[2024-05-28 07:41:04] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 4 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 4 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 171 places in 261 ms of which 4 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 176 places in 252 ms of which 3 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 171 places in 260 ms of which 4 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 4 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 166 places in 280 ms of which 5 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 156 places in 286 ms of which 3 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 161 places in 263 ms of which 3 ms to minimize.
[2024-05-28 07:41:08] [INFO ] Deduced a trap composed of 156 places in 519 ms of which 4 ms to minimize.
[2024-05-28 07:41:10] [INFO ] Deduced a trap composed of 151 places in 2156 ms of which 30 ms to minimize.
[2024-05-28 07:41:10] [INFO ] Deduced a trap composed of 156 places in 422 ms of which 4 ms to minimize.
[2024-05-28 07:41:11] [INFO ] Deduced a trap composed of 156 places in 389 ms of which 4 ms to minimize.
[2024-05-28 07:41:11] [INFO ] Deduced a trap composed of 236 places in 399 ms of which 3 ms to minimize.
[2024-05-28 07:41:12] [INFO ] Deduced a trap composed of 171 places in 384 ms of which 3 ms to minimize.
[2024-05-28 07:41:12] [INFO ] Deduced a trap composed of 171 places in 391 ms of which 4 ms to minimize.
[2024-05-28 07:41:12] [INFO ] Deduced a trap composed of 176 places in 309 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:41:13] [INFO ] Deduced a trap composed of 244 places in 408 ms of which 4 ms to minimize.
[2024-05-28 07:41:13] [INFO ] Deduced a trap composed of 242 places in 392 ms of which 3 ms to minimize.
[2024-05-28 07:41:14] [INFO ] Deduced a trap composed of 244 places in 321 ms of which 3 ms to minimize.
[2024-05-28 07:41:14] [INFO ] Deduced a trap composed of 161 places in 297 ms of which 4 ms to minimize.
[2024-05-28 07:41:15] [INFO ] Deduced a trap composed of 161 places in 394 ms of which 4 ms to minimize.
[2024-05-28 07:41:15] [INFO ] Deduced a trap composed of 161 places in 390 ms of which 3 ms to minimize.
[2024-05-28 07:41:15] [INFO ] Deduced a trap composed of 176 places in 405 ms of which 3 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 171 places in 409 ms of which 4 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 240 places in 406 ms of which 3 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 244 places in 276 ms of which 3 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 246 places in 382 ms of which 3 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 244 places in 387 ms of which 3 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 171 places in 397 ms of which 3 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 171 places in 386 ms of which 3 ms to minimize.
[2024-05-28 07:41:19] [INFO ] Deduced a trap composed of 171 places in 313 ms of which 4 ms to minimize.
[2024-05-28 07:41:19] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 4 ms to minimize.
[2024-05-28 07:41:19] [INFO ] Deduced a trap composed of 234 places in 381 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 109 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:41:22] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 2 ms to minimize.
[2024-05-28 07:41:28] [INFO ] Deduced a trap composed of 243 places in 339 ms of which 3 ms to minimize.
[2024-05-28 07:41:33] [INFO ] Deduced a trap composed of 13 places in 342 ms of which 5 ms to minimize.
[2024-05-28 07:41:36] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 4 ms to minimize.
[2024-05-28 07:41:37] [INFO ] Deduced a trap composed of 236 places in 361 ms of which 3 ms to minimize.
[2024-05-28 07:41:37] [INFO ] Deduced a trap composed of 243 places in 400 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:41:40] [INFO ] Deduced a trap composed of 160 places in 300 ms of which 3 ms to minimize.
[2024-05-28 07:41:41] [INFO ] Deduced a trap composed of 139 places in 310 ms of which 4 ms to minimize.
[2024-05-28 07:41:41] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 3 ms to minimize.
[2024-05-28 07:41:42] [INFO ] Deduced a trap composed of 153 places in 256 ms of which 4 ms to minimize.
[2024-05-28 07:41:42] [INFO ] Deduced a trap composed of 147 places in 281 ms of which 3 ms to minimize.
[2024-05-28 07:41:42] [INFO ] Deduced a trap composed of 153 places in 314 ms of which 5 ms to minimize.
[2024-05-28 07:41:43] [INFO ] Deduced a trap composed of 159 places in 312 ms of which 5 ms to minimize.
[2024-05-28 07:41:43] [INFO ] Deduced a trap composed of 171 places in 333 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 123 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 51/51 constraints]
After SMT, in 67558ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67577ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71116 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2899 resets) in 827 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (357 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (369 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 288275 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 288275 steps, saw 47083 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-28 07:41:53] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:41:53] [INFO ] Invariant cache hit.
[2024-05-28 07:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:41:55] [INFO ] Deduced a trap composed of 226 places in 363 ms of which 4 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 228 places in 342 ms of which 4 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 230 places in 383 ms of which 3 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 226 places in 347 ms of which 4 ms to minimize.
[2024-05-28 07:41:57] [INFO ] Deduced a trap composed of 230 places in 423 ms of which 3 ms to minimize.
[2024-05-28 07:41:58] [INFO ] Deduced a trap composed of 228 places in 1385 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:41:59] [INFO ] Deduced a trap composed of 242 places in 442 ms of which 4 ms to minimize.
SMT process timed out in 6416ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:41:59] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:41:59] [INFO ] Invariant cache hit.
[2024-05-28 07:41:59] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J30

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.311

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 694
TRANSITIONS: 12080
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 112619
UNFOLDING TIME: 1.34

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.291
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.205
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2347
MODEL NAME: /home/mcc/execution/model
694 places, 12080 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J30, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445900413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;