fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445200109
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6887.691 1196299.00 2431657.00 396.20 0 0 1 1 8 1 1 10 1 2 10 2 2 8 0 1 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-171654445200109.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 PolyORBLF-COL-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716848035687

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:13:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 22:13:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:13:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:13:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:13:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2024-05-27 22:13:57] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-27 22:13:57] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 22:13:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:13:58] [INFO ] Computed 26 invariants in 20 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 1, 1, 8, 1, 8, 11, 2, 28, 20, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 22:13:58] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:13:58] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-27 22:13:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-27 22:13:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 22:13:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:13:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:13:58] [INFO ] Added : 44 causal constraints over 10 iterations in 100 ms. Result :sat
Minimization took 39 ms.
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:13:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 32 ms returned sat
[2024-05-27 22:13:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-27 22:13:58] [INFO ] Added : 54 causal constraints over 12 iterations in 93 ms. Result :sat
Minimization took 28 ms.
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:13:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:13:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:13:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:13:58] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-27 22:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:13:59] [INFO ] Added : 54 causal constraints over 11 iterations in 82 ms. Result :sat
Minimization took 25 ms.
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:13:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:13:59] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 25 ms to minimize.
[2024-05-27 22:13:59] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-05-27 22:13:59] [INFO ] Added : 58 causal constraints over 12 iterations in 270 ms. Result :sat
Minimization took 26 ms.
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-27 22:13:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:13:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-27 22:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-27 22:13:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:14:00] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:14:00] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:14:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:14:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2024-05-27 22:14:00] [INFO ] Added : 54 causal constraints over 11 iterations in 236 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-27 22:14:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-27 22:14:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:14:00] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:14:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:14:00] [INFO ] Added : 25 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 33 ms.
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-27 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:14:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:14:00] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:14:00] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-27 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:14:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:14:01] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-27 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-27 22:14:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:14:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-05-27 22:14:01] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:14:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-27 22:14:01] [INFO ] Added : 49 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 55 ms.
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-27 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-27 22:14:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:14:01] [INFO ] Added : 45 causal constraints over 9 iterations in 64 ms. Result :sat
Minimization took 37 ms.
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-27 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:14:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:14:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:14:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2024-05-27 22:14:02] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-27 22:14:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:14:02] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-27 22:14:02] [INFO ] Added : 58 causal constraints over 12 iterations in 241 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 10, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:14:02] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 55 ms.
[2024-05-27 22:14:02] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
[2024-05-27 22:14:02] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-27 22:14:02] [INFO ] Computed 54 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
RANDOM walk for 10000 steps (6 resets) in 117 ms. (84 steps per ms)
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90004 steps (24 resets) in 428 ms. (209 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 8, 11, 2, 28, 4, 2]
[2024-05-27 22:14:03] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-27 22:14:03] [INFO ] Invariant cache hit.
[2024-05-27 22:14:03] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2024-05-27 22:14:03] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 53 ms returned sat
[2024-05-27 22:14:04] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2024-05-27 22:14:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2024-05-27 22:14:04] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2024-05-27 22:14:05] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2024-05-27 22:14:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:14:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:14:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 679 ms returned sat
[2024-05-27 22:14:06] [INFO ] Deduced a trap composed of 19 places in 660 ms of which 10 ms to minimize.
[2024-05-27 22:14:07] [INFO ] Deduced a trap composed of 351 places in 447 ms of which 6 ms to minimize.
[2024-05-27 22:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1776 ms
[2024-05-27 22:14:08] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2024-05-27 22:14:08] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2024-05-27 22:14:08] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2024-05-27 22:14:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 33 ms returned sat
[2024-05-27 22:14:09] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 41 ms returned sat
[2024-05-27 22:14:09] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-05-27 22:14:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:14:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 846 ms returned sat
[2024-05-27 22:14:10] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 148 ms.
[2024-05-27 22:14:13] [INFO ] Added : 65 causal constraints over 13 iterations in 2777 ms. Result :unknown
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned unsat
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 13 ms returned unsat
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-05-27 22:14:13] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 27 ms returned unsat
[2024-05-27 22:14:14] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-27 22:14:14] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 28 ms returned sat
[2024-05-27 22:14:14] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2024-05-27 22:14:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-27 22:14:15] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 29 ms returned sat
[2024-05-27 22:14:15] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2024-05-27 22:14:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:14:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 773 ms returned sat
[2024-05-27 22:14:16] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 138 ms.
[2024-05-27 22:14:19] [INFO ] Added : 81 causal constraints over 17 iterations in 2868 ms. Result :sat
Minimization took 353 ms.
[2024-05-27 22:14:20] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-27 22:14:20] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 28 ms returned sat
[2024-05-27 22:14:20] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2024-05-27 22:14:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-27 22:14:21] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 19 ms returned sat
[2024-05-27 22:14:21] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-27 22:14:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:14:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 724 ms returned sat
[2024-05-27 22:14:22] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 121 ms.
[2024-05-27 22:14:25] [INFO ] Added : 55 causal constraints over 11 iterations in 2535 ms. Result :sat
Minimization took 559 ms.
[2024-05-27 22:14:25] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-27 22:14:25] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 1, 10, 1, 28, 4, 1]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 688 transition count 1242
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 138 place count 624 transition count 1234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 11 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 13 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 442 place count 472 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 411 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-27 22:14:26] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2024-05-27 22:14:26] [INFO ] Computed 52 invariants in 36 ms
[2024-05-27 22:14:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-27 22:14:45] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 5 ms to minimize.
[2024-05-27 22:14:45] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-05-27 22:14:46] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2024-05-27 22:14:46] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:14:46] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:14:46] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:14:46] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:14:47] [INFO ] Deduced a trap composed of 165 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:14:47] [INFO ] Deduced a trap composed of 172 places in 255 ms of which 16 ms to minimize.
[2024-05-27 22:14:47] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 195 places in 356 ms of which 4 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 185 places in 382 ms of which 5 ms to minimize.
[2024-05-27 22:14:49] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 5 ms to minimize.
[2024-05-27 22:14:49] [INFO ] Deduced a trap composed of 179 places in 367 ms of which 4 ms to minimize.
[2024-05-27 22:14:49] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.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 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.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 0.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 0.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 0.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 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1530 variables, and 65 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-27 22:14:59] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 2 ms to minimize.
[2024-05-27 22:15:05] [INFO ] Deduced a trap composed of 69 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:15:09] [INFO ] Deduced a trap composed of 150 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 181 places in 339 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1530 variables, and 69 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 19/19 constraints]
After SMT, in 43616ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 43673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44147 ms. Remains : 464/690 places, 1082/1306 transitions.
[2024-05-27 22:15:10] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-27 22:15:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (421 resets) in 4191 ms. (238 steps per ms)
BEST_FIRST walk for 4000001 steps (692 resets) in 7439 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-05-27 22:15:22] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-27 22:15:22] [INFO ] Invariant cache hit.
[2024-05-27 22:15:22] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:15:22] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 26 ms returned sat
[2024-05-27 22:15:22] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2024-05-27 22:15:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:15:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:15:22] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 18 ms returned sat
[2024-05-27 22:15:23] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-27 22:15:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:15:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 874 ms returned sat
[2024-05-27 22:15:24] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 143 ms.
[2024-05-27 22:15:25] [INFO ] Added : 63 causal constraints over 13 iterations in 1609 ms. Result :sat
Minimization took 4275 ms.
[2024-05-27 22:15:30] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 22:15:30] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 32 ms returned sat
[2024-05-27 22:15:30] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-27 22:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:15:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 22:15:31] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 37 ms returned sat
[2024-05-27 22:15:31] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-05-27 22:15:32] [INFO ] [Nat]Added 96 Read/Feed constraints in 733 ms returned sat
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 186 places in 337 ms of which 6 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 661 ms
[2024-05-27 22:15:33] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 112 ms.
[2024-05-27 22:15:34] [INFO ] Added : 36 causal constraints over 8 iterations in 1722 ms. Result :sat
Minimization took 3822 ms.
[2024-05-27 22:15:38] [INFO ] [Real]Absence check using 15 positive place invariants in 38 ms returned sat
[2024-05-27 22:15:38] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 45 ms returned sat
[2024-05-27 22:15:39] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-05-27 22:15:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:15:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 22:15:39] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 25 ms returned sat
[2024-05-27 22:15:40] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2024-05-27 22:15:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 472 ms returned sat
[2024-05-27 22:15:40] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 115 ms.
[2024-05-27 22:15:41] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 4 ms to minimize.
[2024-05-27 22:15:42] [INFO ] Deduced a trap composed of 185 places in 297 ms of which 6 ms to minimize.
[2024-05-27 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1015 ms
[2024-05-27 22:15:42] [INFO ] Added : 42 causal constraints over 10 iterations in 2114 ms. Result :sat
Minimization took 4534 ms.
[2024-05-27 22:15:47] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:15:47] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 26 ms returned sat
[2024-05-27 22:15:48] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-05-27 22:15:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:15:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:15:48] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 17 ms returned sat
[2024-05-27 22:15:48] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-27 22:15:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 1022 ms returned sat
[2024-05-27 22:15:49] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 85 ms.
[2024-05-27 22:15:50] [INFO ] Added : 29 causal constraints over 6 iterations in 906 ms. Result :sat
Minimization took 3902 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 68 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 464/464 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 51 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2024-05-27 22:15:55] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-27 22:15:55] [INFO ] Invariant cache hit.
[2024-05-27 22:15:56] [INFO ] Implicit Places using invariants in 585 ms returned [418, 419, 420, 421, 422, 423, 424, 425]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 590 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/464 places, 1082/1082 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 1074
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 1074
Applied a total of 16 rules in 49 ms. Remains 448 /456 variables (removed 8) and now considering 1074/1082 (removed 8) transitions.
[2024-05-27 22:15:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-05-27 22:15:56] [INFO ] Computed 44 invariants in 16 ms
[2024-05-27 22:15:57] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-27 22:15:57] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:15:57] [INFO ] Invariant cache hit.
[2024-05-27 22:15:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:16:06] [INFO ] Implicit Places using invariants and state equation in 9140 ms returned []
Implicit Place search using SMT with State Equation took 9759 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/464 places, 1074/1082 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10450 ms. Remains : 448/464 places, 1074/1082 transitions.
[2024-05-27 22:16:06] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:16:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (446 resets) in 3762 ms. (265 steps per ms)
BEST_FIRST walk for 4000004 steps (672 resets) in 6402 ms. (624 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-05-27 22:16:16] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:16:16] [INFO ] Invariant cache hit.
[2024-05-27 22:16:16] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:16:16] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 22:16:16] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2024-05-27 22:16:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:16:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:16:17] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 22:16:17] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2024-05-27 22:16:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:16:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:16:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 5670 ms returned sat
[2024-05-27 22:16:23] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 5 ms to minimize.
[2024-05-27 22:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 860 ms
[2024-05-27 22:16:24] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 90 ms.
[2024-05-27 22:16:25] [INFO ] Added : 33 causal constraints over 7 iterations in 1103 ms. Result :sat
Minimization took 3993 ms.
[2024-05-27 22:16:29] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-27 22:16:29] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-27 22:16:29] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-27 22:16:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:16:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:16:29] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 24 ms returned sat
[2024-05-27 22:16:30] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2024-05-27 22:16:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 536 ms returned sat
[2024-05-27 22:16:31] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:16:32] [INFO ] Deduced a trap composed of 184 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:16:32] [INFO ] Deduced a trap composed of 172 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:16:33] [INFO ] Deduced a trap composed of 189 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:16:33] [INFO ] Deduced a trap composed of 180 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:16:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2899 ms
[2024-05-27 22:16:34] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 114 ms.
[2024-05-27 22:16:34] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-27 22:16:35] [INFO ] Added : 42 causal constraints over 9 iterations in 954 ms. Result :sat
Minimization took 4519 ms.
[2024-05-27 22:16:39] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:16:39] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-27 22:16:40] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-05-27 22:16:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:16:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 22:16:40] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-27 22:16:41] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-27 22:16:41] [INFO ] [Nat]Added 96 Read/Feed constraints in 373 ms returned sat
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 189 places in 284 ms of which 4 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2024-05-27 22:16:42] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 109 ms.
[2024-05-27 22:16:43] [INFO ] Added : 41 causal constraints over 9 iterations in 1329 ms. Result :sat
Minimization took 4529 ms.
[2024-05-27 22:16:47] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 22:16:47] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-27 22:16:48] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-05-27 22:16:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:16:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:16:48] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-27 22:16:49] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2024-05-27 22:16:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 665 ms returned sat
[2024-05-27 22:16:50] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:16:50] [INFO ] Deduced a trap composed of 194 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
[2024-05-27 22:16:50] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 79 ms.
[2024-05-27 22:16:51] [INFO ] Added : 30 causal constraints over 6 iterations in 624 ms. Result :sat
Minimization took 4527 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 29 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-27 22:16:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:16:56] [INFO ] Invariant cache hit.
[2024-05-27 22:16:56] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-27 22:16:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:16:56] [INFO ] Invariant cache hit.
[2024-05-27 22:16:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:17:04] [INFO ] Implicit Places using invariants and state equation in 8082 ms returned []
Implicit Place search using SMT with State Equation took 8679 ms to find 0 implicit places.
[2024-05-27 22:17:05] [INFO ] Redundant transitions in 64 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:17:05] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:17:05] [INFO ] Invariant cache hit.
[2024-05-27 22:17:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:17:16] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:17:16] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:17:16] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:17:16] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:17:17] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:17:17] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-27 22:17:17] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:17:17] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:17:17] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 4 ms to minimize.
[2024-05-27 22:17:18] [INFO ] Deduced a trap composed of 191 places in 307 ms of which 5 ms to minimize.
[2024-05-27 22:17:18] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 23 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 55 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-27 22:17:50] [INFO ] Deduced a trap composed of 150 places in 268 ms of which 4 ms to minimize.
[2024-05-27 22:17:51] [INFO ] Deduced a trap composed of 155 places in 312 ms of which 3 ms to minimize.
[2024-05-27 22:17:52] [INFO ] Deduced a trap composed of 152 places in 346 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:17:59] [INFO ] Deduced a trap composed of 288 places in 338 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 446/1506 variables, and 61 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 19/19 constraints]
After SMT, in 61932ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 61949ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70745 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (21 resets) in 1934 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 360 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 416 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 510 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (12 resets) in 389 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (14 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 240 ms. (165 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 113232 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 8
Probabilistic random walk after 113232 steps, saw 65547 distinct states, run finished after 3006 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-27 22:18:11] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:18:11] [INFO ] Invariant cache hit.
[2024-05-27 22:18:11] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX2 is UNSAT
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3278 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 22:18:15] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 4 ms to minimize.
[2024-05-27 22:18:15] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 10 ms to minimize.
[2024-05-27 22:18:15] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2024-05-27 22:18:15] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:18:16] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:18:16] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 7/598 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1506 variables, and 598 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 8341ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 36 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:18:20] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:18:20] [INFO ] Invariant cache hit.
[2024-05-27 22:18:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:18:35] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:18:35] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:18:36] [INFO ] Deduced a trap composed of 173 places in 390 ms of which 4 ms to minimize.
[2024-05-27 22:18:36] [INFO ] Deduced a trap composed of 191 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:18:36] [INFO ] Deduced a trap composed of 167 places in 335 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 3.0)
(s5 0.0)
(s6 1.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 0.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 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.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 0.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 0.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 0.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 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 1.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 1.0)
(s158 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:18:46] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:18:48] [INFO ] Deduced a trap composed of 276 places in 338 ms of which 7 ms to minimize.
[2024-05-27 22:18:49] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-05-27 22:18:55] [INFO ] Deduced a trap composed of 150 places in 218 ms of which 2 ms to minimize.
[2024-05-27 22:18:55] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 16/16 constraints]
After SMT, in 42296ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42354 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (27 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 88993 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 88993 steps, saw 52183 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-27 22:19:05] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:19:05] [INFO ] Invariant cache hit.
[2024-05-27 22:19:05] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:19:06] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:19:06] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:19:06] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:19:06] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 592 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1994 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 212 places in 291 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/443 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/446 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1058/1504 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MIN1 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 4/597 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 22:19:18] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1504 variables, 1/598 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 22:19:28] [INFO ] Deduced a trap composed of 179 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:19:28] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1504 variables, 2/600 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1504 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 47032ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7292 ms.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 448/448 places, 1074/1074 transitions.
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-01 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-00 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[2, 0] Max Struct:[28, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09
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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
[2024-05-27 22:20:00] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:20:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (2 resets) in 45 ms. (217 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-05-27 22:20:00] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:20:00] [INFO ] Invariant cache hit.
[2024-05-27 22:20:00] [INFO ] [Real]Absence check using 15 positive place invariants in 109 ms returned sat
[2024-05-27 22:20:00] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 202 ms returned sat
[2024-05-27 22:20:02] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2024-05-27 22:20:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:20:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:20:02] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 24 ms returned sat
[2024-05-27 22:20:03] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2024-05-27 22:20:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:20:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 361 ms returned sat
[2024-05-27 22:20:03] [INFO ] Deduced a trap composed of 189 places in 471 ms of which 4 ms to minimize.
[2024-05-27 22:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 700 ms
[2024-05-27 22:20:04] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 105 ms.
[2024-05-27 22:20:05] [INFO ] Added : 41 causal constraints over 9 iterations in 1602 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 53 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:20:06] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:20:06] [INFO ] Invariant cache hit.
[2024-05-27 22:20:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:20:16] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:20:16] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:20:16] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:20:16] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:20:16] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:20:17] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:20:17] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:20:17] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:20:17] [INFO ] Deduced a trap composed of 173 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:20:18] [INFO ] Deduced a trap composed of 191 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:20:18] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 2 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 Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:20:33] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:20:35] [INFO ] Deduced a trap composed of 276 places in 218 ms of which 3 ms to minimize.
[2024-05-27 22:20:35] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-27 22:20:41] [INFO ] Deduced a trap composed of 150 places in 232 ms of which 3 ms to minimize.
[2024-05-27 22:20:41] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 16/16 constraints]
After SMT, in 42255ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42273ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42331 ms. Remains : 448/448 places, 1074/1074 transitions.
[2024-05-27 22:20:48] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:20:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[28]
RANDOM walk for 1000000 steps (405 resets) in 3461 ms. (288 steps per ms)
BEST_FIRST walk for 1000000 steps (174 resets) in 1744 ms. (573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-05-27 22:20:53] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:20:53] [INFO ] Invariant cache hit.
[2024-05-27 22:20:53] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 22:20:53] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-27 22:20:54] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-27 22:20:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:20:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-05-27 22:20:54] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 44 ms returned sat
[2024-05-27 22:20:55] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-27 22:20:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:20:55] [INFO ] [Nat]Added 96 Read/Feed constraints in 308 ms returned sat
[2024-05-27 22:20:55] [INFO ] Deduced a trap composed of 189 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2024-05-27 22:20:55] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 92 ms.
[2024-05-27 22:20:57] [INFO ] Added : 41 causal constraints over 9 iterations in 1402 ms. Result :sat
Minimization took 4515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-27 22:21:01] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:21:01] [INFO ] Invariant cache hit.
[2024-05-27 22:21:02] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-27 22:21:02] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:21:02] [INFO ] Invariant cache hit.
[2024-05-27 22:21:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:21:09] [INFO ] Implicit Places using invariants and state equation in 7251 ms returned []
Implicit Place search using SMT with State Equation took 7862 ms to find 0 implicit places.
[2024-05-27 22:21:09] [INFO ] Redundant transitions in 34 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:21:09] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:21:09] [INFO ] Invariant cache hit.
[2024-05-27 22:21:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-27 22:21:20] [INFO ] Deduced a trap composed of 173 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:21:20] [INFO ] Deduced a trap composed of 191 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:21:20] [INFO ] Deduced a trap composed of 167 places in 315 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 172 places in 163 ms of which 2 ms to minimize.
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:21:39] [INFO ] Deduced a trap composed of 159 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:21:40] [INFO ] Deduced a trap composed of 153 places in 334 ms of which 6 ms to minimize.
[2024-05-27 22:21:41] [INFO ] Deduced a trap composed of 145 places in 330 ms of which 3 ms to minimize.
[2024-05-27 22:21:41] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
SMT process timed out in 32140ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 32163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40088 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (18 resets) in 568 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 189881 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189881 steps, saw 107384 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-27 22:21:45] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:21:45] [INFO ] Invariant cache hit.
[2024-05-27 22:21:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 271 places in 234 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 224 places in 390 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1506 variables, and 592 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3335ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 24 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:21:48] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:21:48] [INFO ] Invariant cache hit.
[2024-05-27 22:21:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:21:59] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:21:59] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 3 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:22:01] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:22:01] [INFO ] Deduced a trap composed of 191 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:22:01] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:22:15] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:22:18] [INFO ] Deduced a trap composed of 276 places in 204 ms of which 3 ms to minimize.
[2024-05-27 22:22:18] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-27 22:22:30] [INFO ] Deduced a trap composed of 150 places in 246 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 57 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 15/15 constraints]
After SMT, in 42294ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42350 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (20 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320781 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320781 steps, saw 175432 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-27 22:22:34] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:22:34] [INFO ] Invariant cache hit.
[2024-05-27 22:22:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 271 places in 233 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 224 places in 300 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:22:36] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:22:36] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:22:36] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:22:36] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:22:38] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 597 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 21 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-27 22:22:39] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:22:39] [INFO ] Invariant cache hit.
[2024-05-27 22:22:39] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-27 22:22:39] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:22:39] [INFO ] Invariant cache hit.
[2024-05-27 22:22:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:22:47] [INFO ] Implicit Places using invariants and state equation in 7673 ms returned []
Implicit Place search using SMT with State Equation took 8172 ms to find 0 implicit places.
[2024-05-27 22:22:47] [INFO ] Redundant transitions in 8 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-05-27 22:22:47] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:22:47] [INFO ] Invariant cache hit.
[2024-05-27 22:22:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:22:58] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:22:58] [INFO ] Deduced a trap composed of 173 places in 375 ms of which 5 ms to minimize.
[2024-05-27 22:22:59] [INFO ] Deduced a trap composed of 191 places in 276 ms of which 4 ms to minimize.
[2024-05-27 22:22:59] [INFO ] Deduced a trap composed of 167 places in 267 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:23:09] [INFO ] Deduced a trap composed of 172 places in 130 ms of which 1 ms to minimize.
[2024-05-27 22:23:09] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:23:16] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:23:16] [INFO ] Deduced a trap composed of 153 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:23:17] [INFO ] Deduced a trap composed of 145 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:23:18] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:23:18] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:23:18] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:23:18] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 63 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-27 22:23:25] [INFO ] Deduced a trap composed of 276 places in 243 ms of which 4 ms to minimize.
[2024-05-27 22:23:26] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:23:31] [INFO ] Deduced a trap composed of 225 places in 260 ms of which 4 ms to minimize.
[2024-05-27 22:23:32] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:23:33] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 68 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 26/26 constraints]
After SMT, in 62333ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 62345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70553 ms. Remains : 448/448 places, 1074/1074 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[28]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09 in 229671 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14
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-27 22:23:49] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:23:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (3 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-27 22:23:49] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-27 22:23:49] [INFO ] Invariant cache hit.
[2024-05-27 22:23:50] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:23:50] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 31 ms returned sat
[2024-05-27 22:23:50] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-05-27 22:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:23:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:23:50] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-27 22:23:51] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-05-27 22:23:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:23:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:23:52] [INFO ] [Nat]Added 96 Read/Feed constraints in 893 ms returned sat
[2024-05-27 22:23:52] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 118 ms.
[2024-05-27 22:23:53] [INFO ] Deduced a trap composed of 206 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:23:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2024-05-27 22:23:54] [INFO ] Added : 40 causal constraints over 8 iterations in 1597 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 1066
Applied a total of 16 rules in 77 ms. Remains 440 /448 variables (removed 8) and now considering 1066/1074 (removed 8) transitions.
Running 1064 sub problems to find dead transitions.
[2024-05-27 22:23:55] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2024-05-27 22:23:55] [INFO ] Computed 44 invariants in 15 ms
[2024-05-27 22:23:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:24:04] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 2 ms to minimize.
[2024-05-27 22:24:05] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-05-27 22:24:05] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:24:06] [INFO ] Deduced a trap composed of 172 places in 443 ms of which 4 ms to minimize.
[2024-05-27 22:24:06] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 4 ms to minimize.
[2024-05-27 22:24:07] [INFO ] Deduced a trap composed of 183 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:24:07] [INFO ] Deduced a trap composed of 173 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:24:15] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 4 ms to minimize.
[2024-05-27 22:24:16] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 188 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 152 places in 255 ms of which 3 ms to minimize.
SMT process timed out in 22424ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 22440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22520 ms. Remains : 440/448 places, 1066/1074 transitions.
[2024-05-27 22:24:17] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:24:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (435 resets) in 3526 ms. (283 steps per ms)
BEST_FIRST walk for 1000000 steps (169 resets) in 1662 ms. (601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-27 22:24:22] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:24:22] [INFO ] Invariant cache hit.
[2024-05-27 22:24:22] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-27 22:24:22] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-27 22:24:23] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-05-27 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:24:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 22:24:23] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-27 22:24:23] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2024-05-27 22:24:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:24:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 2079 ms returned sat
[2024-05-27 22:24:26] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 94 ms.
[2024-05-27 22:24:26] [INFO ] Added : 17 causal constraints over 4 iterations in 494 ms. Result :sat
Minimization took 5127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 35 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 27 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-27 22:24:31] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:24:31] [INFO ] Invariant cache hit.
[2024-05-27 22:24:32] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-27 22:24:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:24:32] [INFO ] Invariant cache hit.
[2024-05-27 22:24:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:24:38] [INFO ] Implicit Places using invariants and state equation in 6037 ms returned []
Implicit Place search using SMT with State Equation took 6501 ms to find 0 implicit places.
[2024-05-27 22:24:38] [INFO ] Redundant transitions in 20 ms returned []
Running 1064 sub problems to find dead transitions.
[2024-05-27 22:24:38] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:24:38] [INFO ] Invariant cache hit.
[2024-05-27 22:24:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-05-27 22:24:47] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-27 22:24:48] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-05-27 22:24:48] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-27 22:24:48] [INFO ] Deduced a trap composed of 153 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:24:48] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 4 ms to minimize.
[2024-05-27 22:24:49] [INFO ] Deduced a trap composed of 152 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:24:49] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:24:50] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:24:57] [INFO ] Deduced a trap composed of 146 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:24:58] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 2 ms to minimize.
[2024-05-27 22:24:58] [INFO ] Deduced a trap composed of 81 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:25:09] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:25:18] [INFO ] Deduced a trap composed of 268 places in 294 ms of which 3 ms to minimize.
[2024-05-27 22:25:21] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-27 22:25:21] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:25:26] [INFO ] Deduced a trap composed of 150 places in 233 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1064 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 Int declared 438/1490 variables, and 63 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 21/21 constraints]
After SMT, in 62142ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 62162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68722 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (19 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 201814 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201814 steps, saw 114048 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-27 22:25:43] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:25:43] [INFO ] Invariant cache hit.
[2024-05-27 22:25:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:25:43] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 3 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 3 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:25:45] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:25:47] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:25:47] [INFO ] Deduced a trap composed of 171 places in 308 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 591 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 4483ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 618 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 36 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2024-05-27 22:25:48] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:25:48] [INFO ] Invariant cache hit.
[2024-05-27 22:25:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:25:58] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:25:59] [INFO ] Deduced a trap composed of 153 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:25:59] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 3 ms to minimize.
[2024-05-27 22:25:59] [INFO ] Deduced a trap composed of 152 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:26:00] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 2 ms to minimize.
[2024-05-27 22:26:01] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:26:07] [INFO ] Deduced a trap composed of 146 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:26:08] [INFO ] Deduced a trap composed of 172 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:26:09] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:26:23] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-27 22:26:24] [INFO ] Deduced a trap composed of 150 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 60 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 18/18 constraints]
After SMT, in 42374ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 42396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42436 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (16 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 201158 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201158 steps, saw 113708 distinct states, run finished after 3007 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-27 22:26:34] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:26:34] [INFO ] Invariant cache hit.
[2024-05-27 22:26:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:26:34] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:26:36] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:26:39] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 4 ms to minimize.
[2024-05-27 22:26:39] [INFO ] Deduced a trap composed of 194 places in 297 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:26:40] [INFO ] Deduced a trap composed of 181 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:26:41] [INFO ] Deduced a trap composed of 190 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:26:43] [INFO ] Deduced a trap composed of 177 places in 300 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1490 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1490 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 594 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9852 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 11547ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6634 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 17 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-27 22:26:52] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:26:52] [INFO ] Invariant cache hit.
[2024-05-27 22:26:53] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 22:26:53] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:26:53] [INFO ] Invariant cache hit.
[2024-05-27 22:26:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 22:26:59] [INFO ] Implicit Places using invariants and state equation in 5921 ms returned []
Implicit Place search using SMT with State Equation took 6285 ms to find 0 implicit places.
[2024-05-27 22:26:59] [INFO ] Redundant transitions in 21 ms returned []
Running 1064 sub problems to find dead transitions.
[2024-05-27 22:26:59] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-05-27 22:26:59] [INFO ] Invariant cache hit.
[2024-05-27 22:26:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:27:08] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:27:09] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:27:10] [INFO ] Deduced a trap composed of 153 places in 292 ms of which 4 ms to minimize.
[2024-05-27 22:27:10] [INFO ] Deduced a trap composed of 171 places in 245 ms of which 4 ms to minimize.
[2024-05-27 22:27:10] [INFO ] Deduced a trap composed of 152 places in 289 ms of which 4 ms to minimize.
[2024-05-27 22:27:10] [INFO ] Deduced a trap composed of 160 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:27:11] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 2 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 172 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:27:45] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:27:47] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-27 22:27:57] [INFO ] Deduced a trap composed of 268 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:27:58] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 62 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 20/20 constraints]
After SMT, in 62558ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 62581ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68918 ms. Remains : 440/440 places, 1066/1066 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14 in 251872 ms.
[2024-05-27 22:28:02] [INFO ] Flatten gal took : 259 ms
[2024-05-27 22:28:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-27 22:28:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 1074 transitions and 5490 arcs took 31 ms.
Total runtime 845131 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 448
TRANSITIONS: 1074
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.039s, Sys 0.012s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
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: 1829
MODEL NAME: /home/mcc/execution/419/model
448 places, 1074 transitions.

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..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-09 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-14 0 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716849231986

--------------------
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="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, 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-171654445200109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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