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.r516-tajo-171654446300093.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 ltsminxred
Input is PolyORBLF-COL-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717248372545

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:26:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:26:13] [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-06-01 13:26:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:26:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2024-06-01 13:26:14] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-06-01 13:26:14] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:26:14] [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-06-01 13:26:14] [INFO ] Computed 26 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 1, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 13:26:14] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:26:14] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 13:26:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:26:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 13:26:14] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 13:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:26:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 13:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 9 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 2 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2024-06-01 13:26:15] [INFO ] Added : 58 causal constraints over 12 iterations in 264 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 13:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:26:15] [INFO ] Added : 58 causal constraints over 12 iterations in 77 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 13:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:26:15] [INFO ] Added : 9 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-06-01 13:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 13:26:16] [INFO ] Added : 61 causal constraints over 13 iterations in 118 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-01 13:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:26:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:26:16] [INFO ] Added : 27 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:26:16] [INFO ] Added : 9 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:26:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:26:16] [INFO ] Added : 54 causal constraints over 11 iterations in 60 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:26:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 13:26:16] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-01 13:26:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:26:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:26:17] [INFO ] Added : 44 causal constraints over 10 iterations in 59 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:26:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:26:17] [INFO ] Added : 54 causal constraints over 11 iterations in 56 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:26:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:26:17] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:26:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 13:26:17] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:26:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 31 ms returned sat
[2024-06-01 13:26:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:26:17] [INFO ] Added : 60 causal constraints over 12 iterations in 91 ms. Result :sat
Minimization took 71 ms.
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 13:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:26:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 13:26:18] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:26:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:26:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:26:18] [INFO ] Added : 27 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
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-06-01 13:26:18] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 55 ms.
[2024-06-01 13:26:18] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
[2024-06-01 13:26:18] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 13:26:18] [INFO ] Computed 54 invariants in 72 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 9, 10, 10, 20]
RANDOM walk for 10000 steps (3 resets) in 133 ms. (74 steps per ms)
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100005 steps (21 resets) in 463 ms. (215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[10, 2, 2, 2, 20, 20, 4, 9, 10, 20]
[2024-06-01 13:26:19] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:26:19] [INFO ] Invariant cache hit.
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 28 ms returned unsat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned unsat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2024-06-01 13:26:19] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 29 ms returned unsat
[2024-06-01 13:26:20] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 13:26:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-06-01 13:26:20] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2024-06-01 13:26:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:26:21] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned sat
[2024-06-01 13:26:21] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2024-06-01 13:26:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:26:22] [INFO ] [Nat]Added 120 Read/Feed constraints in 417 ms returned sat
[2024-06-01 13:26:22] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 155 ms.
[2024-06-01 13:26:24] [INFO ] Added : 65 causal constraints over 14 iterations in 1838 ms. Result :sat
Minimization took 572 ms.
[2024-06-01 13:26:24] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 13:26:24] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-06-01 13:26:25] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2024-06-01 13:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-01 13:26:25] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-06-01 13:26:27] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2024-06-01 13:26:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 156 ms returned sat
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 4 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 3 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1151 ms
[2024-06-01 13:26:28] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 78 ms.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-06-01 13:26:30] [INFO ] Added : 62 causal constraints over 17 iterations in 2048 ms. Result :sat
Minimization took 128 ms.
[2024-06-01 13:26:30] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-01 13:26:30] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 27 ms returned sat
[2024-06-01 13:26:31] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2024-06-01 13:26:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-01 13:26:32] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2024-06-01 13:26:33] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2024-06-01 13:26:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:26:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 897 ms returned sat
[2024-06-01 13:26:34] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 119 ms.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 396 places in 439 ms of which 4 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 442 places in 298 ms of which 5 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 942 ms
[2024-06-01 13:26:36] [INFO ] Added : 55 causal constraints over 12 iterations in 2452 ms. Result :sat
Minimization took 202 ms.
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 15 ms returned unsat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned unsat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned sat
[2024-06-01 13:26:37] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-06-01 13:26:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:26:38] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2024-06-01 13:26:38] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2024-06-01 13:26:39] [INFO ] [Nat]Added 120 Read/Feed constraints in 461 ms returned sat
[2024-06-01 13:26:39] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 110 ms.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 428 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2024-06-01 13:26:41] [INFO ] Added : 80 causal constraints over 17 iterations in 2465 ms. Result :sat
Minimization took 566 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[1, 1, 1, 1, 20, 20, 4, 2, 1, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 462 place count 520 transition count 1182
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 472 place count 520 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 482 place count 510 transition count 1172
Applied a total of 482 rules in 307 ms. Remains 510 /752 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2024-06-01 13:26:42] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 510 cols
[2024-06-01 13:26:42] [INFO ] Computed 52 invariants in 63 ms
[2024-06-01 13:26:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 181 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 171 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1662 variables, and 64 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-06-01 13:27:13] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 296 places in 260 ms of which 10 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 281 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 3 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 299 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 16 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 217 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 316 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 321 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 345 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 336 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 218 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 309 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1662 variables, and 79 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 29/29 constraints]
After SMT, in 43269ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 43312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43678 ms. Remains : 510/752 places, 1172/1412 transitions.
[2024-06-01 13:27:26] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 13:27:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (306 resets) in 3977 ms. (251 steps per ms)
BEST_FIRST walk for 4000004 steps (468 resets) in 7899 ms. (506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-06-01 13:27:37] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 13:27:37] [INFO ] Invariant cache hit.
[2024-06-01 13:27:38] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 13:27:38] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2024-06-01 13:27:38] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2024-06-01 13:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:27:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 13:27:38] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 16 ms returned sat
[2024-06-01 13:27:39] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2024-06-01 13:27:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:27:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 380 ms returned sat
[2024-06-01 13:27:40] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 124 ms.
[2024-06-01 13:27:41] [INFO ] Added : 35 causal constraints over 7 iterations in 760 ms. Result :sat
Minimization took 4507 ms.
[2024-06-01 13:27:45] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:27:45] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2024-06-01 13:27:46] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 13:27:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:27:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:27:46] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 28 ms returned sat
[2024-06-01 13:27:46] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 13:27:47] [INFO ] [Nat]Added 120 Read/Feed constraints in 423 ms returned sat
[2024-06-01 13:27:47] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 78 ms.
[2024-06-01 13:27:48] [INFO ] Added : 36 causal constraints over 8 iterations in 800 ms. Result :sat
Minimization took 5224 ms.
[2024-06-01 13:27:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:27:53] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 16 ms returned sat
[2024-06-01 13:27:53] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-06-01 13:27:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:27:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:27:53] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 35 ms returned sat
[2024-06-01 13:27:54] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-06-01 13:27:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 104 ms returned sat
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 181 places in 328 ms of which 3 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 985 ms
[2024-06-01 13:27:55] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 110 ms.
[2024-06-01 13:27:56] [INFO ] Added : 28 causal constraints over 6 iterations in 715 ms. Result :sat
Minimization took 5232 ms.
[2024-06-01 13:28:01] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 13:28:01] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 23 ms returned sat
[2024-06-01 13:28:02] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-06-01 13:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:28:02] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2024-06-01 13:28:02] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2024-06-01 13:28:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 391 ms returned sat
[2024-06-01 13:28:03] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 94 ms.
[2024-06-01 13:28:04] [INFO ] Added : 32 causal constraints over 7 iterations in 711 ms. Result :sat
Minimization took 5202 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 64 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 510/510 places, 1172/1172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 44 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-06-01 13:28:09] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 13:28:09] [INFO ] Invariant cache hit.
[2024-06-01 13:28:09] [INFO ] Implicit Places using invariants in 517 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 525 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/510 places, 1172/1172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 490 transition count 1162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 490 transition count 1162
Applied a total of 20 rules in 85 ms. Remains 490 /500 variables (removed 10) and now considering 1162/1172 (removed 10) transitions.
[2024-06-01 13:28:10] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-06-01 13:28:10] [INFO ] Computed 42 invariants in 43 ms
[2024-06-01 13:28:10] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-06-01 13:28:10] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:28:10] [INFO ] Invariant cache hit.
[2024-06-01 13:28:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:28:16] [INFO ] Implicit Places using invariants and state equation in 6060 ms returned []
Implicit Place search using SMT with State Equation took 6741 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 490/510 places, 1162/1172 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7397 ms. Remains : 490/510 places, 1162/1172 transitions.
[2024-06-01 13:28:16] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:28:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (311 resets) in 4378 ms. (228 steps per ms)
BEST_FIRST walk for 4000003 steps (483 resets) in 7189 ms. (556 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-06-01 13:28:28] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:28:28] [INFO ] Invariant cache hit.
[2024-06-01 13:28:28] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 13:28:28] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2024-06-01 13:28:28] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-06-01 13:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 13:28:29] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-06-01 13:28:29] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 13:28:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:28:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 274 ms returned sat
[2024-06-01 13:28:30] [INFO ] Deduced a trap composed of 23 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:28:30] [INFO ] Deduced a trap composed of 204 places in 304 ms of which 16 ms to minimize.
[2024-06-01 13:28:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2024-06-01 13:28:30] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 75 ms.
[2024-06-01 13:28:31] [INFO ] Added : 27 causal constraints over 6 iterations in 501 ms. Result :sat
Minimization took 4381 ms.
[2024-06-01 13:28:35] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:28:35] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-06-01 13:28:36] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-06-01 13:28:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:28:36] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:28:36] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 13:28:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 211 ms returned sat
[2024-06-01 13:28:36] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 86 ms.
[2024-06-01 13:28:37] [INFO ] Deduced a trap composed of 207 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:28:37] [INFO ] Deduced a trap composed of 199 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
[2024-06-01 13:28:38] [INFO ] Added : 28 causal constraints over 6 iterations in 1257 ms. Result :sat
Minimization took 4507 ms.
[2024-06-01 13:28:42] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 13:28:42] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:28:43] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-06-01 13:28:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:28:43] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 19 ms returned sat
[2024-06-01 13:28:44] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2024-06-01 13:28:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:28:53] [INFO ] [Nat]Added 120 Read/Feed constraints in 8515 ms returned sat
[2024-06-01 13:28:53] [INFO ] Deduced a trap composed of 193 places in 344 ms of which 3 ms to minimize.
[2024-06-01 13:28:58] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4883 ms
[2024-06-01 13:28:58] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 13:28:58] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 13:28:58] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-06-01 13:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 13:28:58] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 13:28:59] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-06-01 13:28:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 222 ms returned sat
[2024-06-01 13:28:59] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 97 ms.
[2024-06-01 13:29:00] [INFO ] Deduced a trap composed of 172 places in 362 ms of which 4 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 173 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1276 ms
[2024-06-01 13:29:02] [INFO ] Added : 40 causal constraints over 9 iterations in 2365 ms. Result :sat
Minimization took 4284 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 17 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 17 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-06-01 13:29:07] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:29:07] [INFO ] Invariant cache hit.
[2024-06-01 13:29:08] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-01 13:29:08] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:29:08] [INFO ] Invariant cache hit.
[2024-06-01 13:29:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:29:14] [INFO ] Implicit Places using invariants and state equation in 6209 ms returned []
Implicit Place search using SMT with State Equation took 6721 ms to find 0 implicit places.
[2024-06-01 13:29:14] [INFO ] Redundant transitions in 72 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-06-01 13:29:14] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:29:14] [INFO ] Invariant cache hit.
[2024-06-01 13:29:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 6 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 179 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 204 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 185 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 185 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 173 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:29:34] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:29:35] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 153 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 61 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 9)
(s193 0)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 62 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 22/22 constraints]
After SMT, in 62586ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69465 ms. Remains : 490/490 places, 1162/1162 transitions.
RANDOM walk for 40001 steps (16 resets) in 1475 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 489 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 332 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 435 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 349 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 152535 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 8
Probabilistic random walk after 152535 steps, saw 88594 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 13:30:21] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:30:21] [INFO ] Invariant cache hit.
[2024-06-01 13:30:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 13:30:24] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 7 ms to minimize.
[2024-06-01 13:30:24] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:30:24] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:30:24] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:30:24] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 5/663 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 0/663 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1632 variables, 2/665 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1632 variables, 1/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 666 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 7023ms problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1024 ms.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 18 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Running 1160 sub problems to find dead transitions.
[2024-06-01 13:30:29] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:30:29] [INFO ] Invariant cache hit.
[2024-06-01 13:30:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:30:39] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:30:39] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 494 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:30:41] [INFO ] Deduced a trap composed of 179 places in 327 ms of which 3 ms to minimize.
[2024-06-01 13:30:42] [INFO ] Deduced a trap composed of 204 places in 937 ms of which 2 ms to minimize.
[2024-06-01 13:30:42] [INFO ] Deduced a trap composed of 185 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:30:42] [INFO ] Deduced a trap composed of 206 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:30:43] [INFO ] Deduced a trap composed of 200 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:30:43] [INFO ] Deduced a trap composed of 185 places in 326 ms of which 2 ms to minimize.
[2024-06-01 13:30:43] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:30:44] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:30:45] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:30:51] [INFO ] Deduced a trap composed of 155 places in 207 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 60 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:30:55] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 61 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 21/21 constraints]
After SMT, in 42375ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 42395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42416 ms. Remains : 490/490 places, 1162/1162 transitions.
RANDOM walk for 40000 steps (13 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 204622 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 204622 steps, saw 117615 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 13:31:15] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:31:15] [INFO ] Invariant cache hit.
[2024-06-01 13:31:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 0 solved, 3 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 184 places in 255 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1632 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1632 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1632 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:31:21] [INFO ] Deduced a trap composed of 181 places in 253 ms of which 3 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/1632 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 667 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10640 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 11531ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5195 ms.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 27 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 15 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-06-01 13:31:32] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:31:32] [INFO ] Invariant cache hit.
[2024-06-01 13:31:32] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 13:31:32] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:31:32] [INFO ] Invariant cache hit.
[2024-06-01 13:31:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:31:38] [INFO ] Implicit Places using invariants and state equation in 5674 ms returned []
Implicit Place search using SMT with State Equation took 6039 ms to find 0 implicit places.
[2024-06-01 13:31:38] [INFO ] Redundant transitions in 69 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-06-01 13:31:38] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:31:38] [INFO ] Invariant cache hit.
[2024-06-01 13:31:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:31:48] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:31:48] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 179 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 204 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 185 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 185 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 173 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 2 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 153 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 61 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 62 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 22/22 constraints]
After SMT, in 62752ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68909 ms. Remains : 490/490 places, 1162/1162 transitions.
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[2, 2, 2] Max Struct:[20, 20, 20]
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 13:32:41] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:32:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (4 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:32:41] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:32:41] [INFO ] Invariant cache hit.
[2024-06-01 13:32:41] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:32:41] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 13:32:41] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-06-01 13:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:32:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 13:32:41] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 13:32:42] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-06-01 13:32:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:32:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 316 ms returned sat
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 204 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 708 ms
[2024-06-01 13:32:43] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 81 ms.
[2024-06-01 13:32:43] [INFO ] Added : 27 causal constraints over 6 iterations in 402 ms. Result :sat
Minimization took 542 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 45 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:32:44] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-06-01 13:32:44] [INFO ] Computed 42 invariants in 12 ms
[2024-06-01 13:32:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 0 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 614 ms of which 0 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:33:02] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 2 ms to minimize.
[2024-06-01 13:33:02] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 54 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 290 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 58 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 18/18 constraints]
After SMT, in 42661ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42672ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42719 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-06-01 13:33:26] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:33:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (328 resets) in 3707 ms. (269 steps per ms)
BEST_FIRST walk for 1000001 steps (143 resets) in 1502 ms. (665 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:33:32] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:33:32] [INFO ] Invariant cache hit.
[2024-06-01 13:33:32] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-06-01 13:33:32] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-06-01 13:33:32] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 13:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:33:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:33:32] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2024-06-01 13:33:33] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-06-01 13:33:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:33:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 483 ms returned sat
[2024-06-01 13:33:33] [INFO ] Deduced a trap composed of 204 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2024-06-01 13:33:34] [INFO ] Computed and/alt/rep : 370/818/360 causal constraints (skipped 770 transitions) in 71 ms.
[2024-06-01 13:33:34] [INFO ] Added : 29 causal constraints over 6 iterations in 660 ms. Result :sat
Minimization took 4514 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 43 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-06-01 13:33:39] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:33:39] [INFO ] Invariant cache hit.
[2024-06-01 13:33:39] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 13:33:39] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:33:39] [INFO ] Invariant cache hit.
[2024-06-01 13:33:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:33:44] [INFO ] Implicit Places using invariants and state equation in 4829 ms returned []
Implicit Place search using SMT with State Equation took 5264 ms to find 0 implicit places.
[2024-06-01 13:33:44] [INFO ] Redundant transitions in 21 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:33:44] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:33:44] [INFO ] Invariant cache hit.
[2024-06-01 13:33:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 210 places in 249 ms of which 2 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 188 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 181 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 190 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:34:12] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:34:12] [INFO ] Deduced a trap composed of 198 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 59 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 306 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 62479ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67827 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (21 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 151078 steps, run timeout after 3009 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 151078 steps, saw 87156 distinct states, run finished after 3010 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 13:34:50] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:34:50] [INFO ] Invariant cache hit.
[2024-06-01 13:34:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1612 variables, 2/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 1/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 644 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/478 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1132/1610 variables, 478/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1612 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3160ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:34:53] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:34:53] [INFO ] Invariant cache hit.
[2024-06-01 13:34:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:35:03] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:35:03] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:35:03] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:35:04] [INFO ] Deduced a trap composed of 210 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 188 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 2 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 290 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 244 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 193 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 62 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 22/22 constraints]
After SMT, in 42663ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42711 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (14 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360243 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360243 steps, saw 201792 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-06-01 13:35:39] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:35:39] [INFO ] Invariant cache hit.
[2024-06-01 13:35:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1610 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1612 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 650 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2352 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3308ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-06-01 13:35:42] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:35:42] [INFO ] Invariant cache hit.
[2024-06-01 13:35:43] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-01 13:35:43] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:35:43] [INFO ] Invariant cache hit.
[2024-06-01 13:35:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:35:48] [INFO ] Implicit Places using invariants and state equation in 5593 ms returned []
Implicit Place search using SMT with State Equation took 6045 ms to find 0 implicit places.
[2024-06-01 13:35:48] [INFO ] Redundant transitions in 69 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:35:48] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:35:48] [INFO ] Invariant cache hit.
[2024-06-01 13:35:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 210 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 188 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 181 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 190 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 198 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 59 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:36:26] [INFO ] Deduced a trap composed of 306 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:36:27] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:36:27] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:36:27] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:36:27] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2024-06-01 13:36:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 62596ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68766 ms. Remains : 480/480 places, 1152/1152 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05 in 250367 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 13:36:51] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-06-01 13:36:51] [INFO ] Computed 42 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (5 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:36:51] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:36:51] [INFO ] Invariant cache hit.
[2024-06-01 13:36:51] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:51] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-06-01 13:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 25 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-06-01 13:36:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:36:53] [INFO ] [Nat]Added 120 Read/Feed constraints in 254 ms returned sat
[2024-06-01 13:36:53] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 106 ms.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 207 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 199 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 808 ms
[2024-06-01 13:36:54] [INFO ] Added : 28 causal constraints over 6 iterations in 1431 ms. Result :sat
Minimization took 544 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 490 transition count 1152
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 41 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:36:55] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-06-01 13:36:55] [INFO ] Computed 42 invariants in 18 ms
[2024-06-01 13:36:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 5 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 182 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 219 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 190 places in 319 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 55 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 177 places in 340 ms of which 6 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 96 places in 229 ms of which 2 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 60 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 20/20 constraints]
After SMT, in 42387ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42450 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-06-01 13:37:37] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:37:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (315 resets) in 3929 ms. (254 steps per ms)
BEST_FIRST walk for 1000000 steps (121 resets) in 1761 ms. (567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:37:43] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:37:43] [INFO ] Invariant cache hit.
[2024-06-01 13:37:43] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 13:37:43] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 25 ms returned sat
[2024-06-01 13:37:43] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2024-06-01 13:37:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 13:37:44] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 19 ms returned sat
[2024-06-01 13:37:44] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-06-01 13:37:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:37:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 538 ms returned sat
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 186 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2024-06-01 13:37:45] [INFO ] Computed and/alt/rep : 460/1018/450 causal constraints (skipped 680 transitions) in 65 ms.
[2024-06-01 13:37:46] [INFO ] Added : 27 causal constraints over 6 iterations in 429 ms. Result :sat
Minimization took 3956 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-06-01 13:37:50] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:37:50] [INFO ] Invariant cache hit.
[2024-06-01 13:37:51] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-06-01 13:37:51] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:37:51] [INFO ] Invariant cache hit.
[2024-06-01 13:37:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:37:58] [INFO ] Implicit Places using invariants and state equation in 6834 ms returned []
Implicit Place search using SMT with State Equation took 7457 ms to find 0 implicit places.
[2024-06-01 13:37:58] [INFO ] Redundant transitions in 7 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 218 places in 275 ms of which 2 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 181 places in 269 ms of which 2 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 198 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 190 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:38:11] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 32955ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 32967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40465 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (17 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 212262 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 212262 steps, saw 121518 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 13:38:34] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:38:34] [INFO ] Invariant cache hit.
[2024-06-01 13:38:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1612 variables, 2/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 177 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 181 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/478 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1132/1610 variables, 478/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1610 variables, 120/651 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 1/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1612 variables, 2/654 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 1/655 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 0/655 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1612 variables, 0/655 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 655 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2643 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 4430ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 15 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:38:38] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:38:38] [INFO ] Invariant cache hit.
[2024-06-01 13:38:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 40 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 218 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 181 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 190 places in 237 ms of which 2 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 56 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:39:03] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 171 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 61 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 21/21 constraints]
After SMT, in 42731ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42759 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (12 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 371350 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371350 steps, saw 207937 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 13:39:24] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:39:24] [INFO ] Invariant cache hit.
[2024-06-01 13:39:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 181 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1132/1610 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1610 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1612 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1612 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4053ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 24 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 32 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-06-01 13:39:28] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:39:28] [INFO ] Invariant cache hit.
[2024-06-01 13:39:29] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 13:39:29] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:39:29] [INFO ] Invariant cache hit.
[2024-06-01 13:39:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:39:35] [INFO ] Implicit Places using invariants and state equation in 6015 ms returned []
Implicit Place search using SMT with State Equation took 6528 ms to find 0 implicit places.
[2024-06-01 13:39:35] [INFO ] Redundant transitions in 8 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-06-01 13:39:35] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-06-01 13:39:35] [INFO ] Invariant cache hit.
[2024-06-01 13:39:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 218 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 198 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 190 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:39:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 32296ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 32306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38882 ms. Remains : 480/480 places, 1152/1152 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1132
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 470 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 470 transition count 1132
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 470 transition count 1122
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 460 transition count 1122
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 460 transition count 1112
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 450 transition count 1112
Applied a total of 120 rules in 124 ms. Remains 450 /480 variables (removed 30) and now considering 1112/1152 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1112 rows 450 cols
[2024-06-01 13:40:07] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 13:40:07] [INFO ] [Real]Absence check using 14 positive place invariants in 76 ms returned sat
[2024-06-01 13:40:07] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 20 ms returned sat
[2024-06-01 13:40:07] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:40:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 13:40:08] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 25 ms returned sat
[2024-06-01 13:40:13] [INFO ] After 4949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 169 places in 349 ms of which 5 ms to minimize.
[2024-06-01 13:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
TRAPS : Iteration 1
[2024-06-01 13:40:15] [INFO ] After 7306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:40:16] [INFO ] After 8745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 9179 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06 in 205198 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 13:40:16] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-06-01 13:40:16] [INFO ] Computed 42 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (4 resets) in 34 ms. (285 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:[20]
[2024-06-01 13:40:16] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 13:40:16] [INFO ] Invariant cache hit.
[2024-06-01 13:40:16] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 13:40:16] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 13:40:17] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2024-06-01 13:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:40:17] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 19 ms returned sat
[2024-06-01 13:40:17] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-06-01 13:40:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:40:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 209 ms returned sat
[2024-06-01 13:40:18] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 94 ms.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 172 places in 240 ms of which 2 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 173 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 944 ms
[2024-06-01 13:40:20] [INFO ] Added : 40 causal constraints over 9 iterations in 1801 ms. Result :sat
Minimization took 505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 480 transition count 1142
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 470 transition count 1142
Applied a total of 40 rules in 118 ms. Remains 470 /490 variables (removed 20) and now considering 1142/1162 (removed 20) transitions.
Running 1140 sub problems to find dead transitions.
[2024-06-01 13:40:20] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 470 cols
[2024-06-01 13:40:20] [INFO ] Computed 42 invariants in 17 ms
[2024-06-01 13:40:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:40:33] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:40:33] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 280 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 182 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 23147ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 23162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23284 ms. Remains : 470/490 places, 1142/1162 transitions.
[2024-06-01 13:40:43] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:40:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (360 resets) in 3673 ms. (272 steps per ms)
BEST_FIRST walk for 1000001 steps (124 resets) in 1908 ms. (523 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:40:49] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:40:49] [INFO ] Invariant cache hit.
[2024-06-01 13:40:49] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:40:49] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-06-01 13:40:50] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-06-01 13:40:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:40:50] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 13:40:50] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-06-01 13:40:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:40:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 418 ms returned sat
[2024-06-01 13:40:51] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 770 transitions) in 110 ms.
[2024-06-01 13:40:51] [INFO ] Added : 22 causal constraints over 5 iterations in 569 ms. Result :sat
Minimization took 4480 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 20 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 19 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-06-01 13:40:56] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:40:56] [INFO ] Invariant cache hit.
[2024-06-01 13:40:57] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 13:40:57] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:40:57] [INFO ] Invariant cache hit.
[2024-06-01 13:40:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:41:03] [INFO ] Implicit Places using invariants and state equation in 6521 ms returned []
Implicit Place search using SMT with State Equation took 6993 ms to find 0 implicit places.
[2024-06-01 13:41:03] [INFO ] Redundant transitions in 18 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-06-01 13:41:03] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:41:03] [INFO ] Invariant cache hit.
[2024-06-01 13:41:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 182 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:41:18] [INFO ] Deduced a trap composed of 280 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 176 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
SMT process timed out in 32937ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 32955ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39995 ms. Remains : 470/470 places, 1142/1142 transitions.
RANDOM walk for 40000 steps (16 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 199223 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 199223 steps, saw 113843 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-06-01 13:41:39] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:41:39] [INFO ] Invariant cache hit.
[2024-06-01 13:41:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1590/1592 variables, and 515 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 468/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2878ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 27 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Running 1140 sub problems to find dead transitions.
[2024-06-01 13:41:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:41:42] [INFO ] Invariant cache hit.
[2024-06-01 13:41:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 182 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 280 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 176 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 171 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 58 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 18/18 constraints]
After SMT, in 43031ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 43052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43084 ms. Remains : 470/470 places, 1142/1142 transitions.
RANDOM walk for 40000 steps (15 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327484 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327484 steps, saw 183513 distinct states, run finished after 3003 ms. (steps per millisecond=109 ) properties seen :0
[2024-06-01 13:42:29] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:42:29] [INFO ] Invariant cache hit.
[2024-06-01 13:42:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1122/1590 variables, 468/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 120/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1590 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1590 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1592 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1592 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1592/1592 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2581 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3384ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 21 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 20 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-06-01 13:42:32] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:42:32] [INFO ] Invariant cache hit.
[2024-06-01 13:42:33] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-01 13:42:33] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:42:33] [INFO ] Invariant cache hit.
[2024-06-01 13:42:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:42:39] [INFO ] Implicit Places using invariants and state equation in 6004 ms returned []
Implicit Place search using SMT with State Equation took 6482 ms to find 0 implicit places.
[2024-06-01 13:42:39] [INFO ] Redundant transitions in 20 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-06-01 13:42:39] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 13:42:39] [INFO ] Invariant cache hit.
[2024-06-01 13:42:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 182 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 280 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 176 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 13:43:35] [INFO ] Deduced a trap composed of 172 places in 276 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 59 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 19/19 constraints]
After SMT, in 63177ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 63197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69729 ms. Remains : 470/470 places, 1142/1142 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15 in 205552 ms.
[2024-06-01 13:43:42] [INFO ] Flatten gal took : 195 ms
[2024-06-01 13:43:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 13:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 1162 transitions and 5800 arcs took 13 ms.
Total runtime 1048783 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-UpperBounds-05
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-UpperBounds-06
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-UpperBounds-15

BK_STOP 1717249422921

--------------------
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
mcc2024
ub formula name PolyORBLF-COL-S02J04T10-UpperBounds-05
ub formula formula --maxsum=/tmp/2331/ub_0_
ub formula name PolyORBLF-COL-S02J04T10-UpperBounds-06
ub formula formula --maxsum=/tmp/2331/ub_1_
ub formula name PolyORBLF-COL-S02J04T10-UpperBounds-15
ub formula formula --maxsum=/tmp/2331/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J04T10, 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 r516-tajo-171654446300093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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