About the Execution of GreatSPN+red for PolyORBLF-COL-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8732.323 | 3600000.00 | 11620808.00 | 287.00 | 2 1 2 1 ? 1 1 1 1 10 ? 1 1 2 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445200117.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716848799016
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:26:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 22:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:26:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:26:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:26:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 887 ms
[2024-05-27 22:26:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 48 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2024-05-27 22:26:41] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2024-05-27 22:26:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:26:41] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 10, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 1, 1, 22, 4, 2, 10, 2, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 22:26:41] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:26:41] [INFO ] Computed 26 invariants in 3 ms
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-27 22:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-27 22:26:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 22:26:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2024-05-27 22:26:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-27 22:26:42] [INFO ] Added : 8 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-27 22:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:26:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:26:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:26:43] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 40 ms to minimize.
[2024-05-27 22:26:43] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:26:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-05-27 22:26:43] [INFO ] Added : 58 causal constraints over 12 iterations in 410 ms. Result :sat
Minimization took 34 ms.
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using 11 positive place invariants in 41 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-27 22:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 78 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:26:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 22:26:43] [INFO ] Added : 6 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 19 ms.
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-27 22:26:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-27 22:26:44] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:26:44] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:26:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-27 22:26:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:26:44] [INFO ] Added : 59 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 28 ms.
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-27 22:26:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2024-05-27 22:26:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:26:44] [INFO ] Added : 54 causal constraints over 11 iterations in 145 ms. Result :sat
Minimization took 36 ms.
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-27 22:26:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:26:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-27 22:26:44] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-05-27 22:26:44] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:26:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-27 22:26:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:26:44] [INFO ] Added : 56 causal constraints over 12 iterations in 90 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:26:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-27 22:26:45] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-27 22:26:45] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-27 22:26:45] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-27 22:26:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-27 22:26:45] [INFO ] Added : 56 causal constraints over 12 iterations in 287 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2024-05-27 22:26:45] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-27 22:26:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:26:45] [INFO ] Added : 47 causal constraints over 10 iterations in 57 ms. Result :sat
Minimization took 30 ms.
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:26:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-27 22:26:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:26:46] [INFO ] Added : 58 causal constraints over 12 iterations in 75 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:26:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-27 22:26:46] [INFO ] Added : 58 causal constraints over 12 iterations in 110 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-27 22:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:26:46] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 13 ms.
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:26:46] [INFO ] Added : 52 causal constraints over 11 iterations in 88 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:26:46] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:26:47] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:26:47] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-27 22:26:47] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-27 22:26:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 207 ms
[2024-05-27 22:26:47] [INFO ] Added : 45 causal constraints over 9 iterations in 273 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 10, 4, 2, 10, 2, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:26:47] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 74 ms.
[2024-05-27 22:26:47] [INFO ] Unfolded 13 HLPN properties in 1 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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 10, 10]
[2024-05-27 22:26:47] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-27 22:26:47] [INFO ] Computed 58 invariants in 119 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 10, 10]
RANDOM walk for 10000 steps (2 resets) in 197 ms. (50 steps per ms)
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80002 steps (19 resets) in 436 ms. (183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[10, 2, 3, 4, 2, 10, 10, 10]
[2024-05-27 22:26:48] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:26:48] [INFO ] Invariant cache hit.
[2024-05-27 22:26:48] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 22:26:48] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned unsat
[2024-05-27 22:26:48] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 22:26:48] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 46 ms returned sat
[2024-05-27 22:26:49] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-27 22:26:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 22:26:49] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned sat
[2024-05-27 22:26:50] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2024-05-27 22:26:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:26:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 1042 ms returned unknown
[2024-05-27 22:26:51] [INFO ] [Real]Absence check using 14 positive place invariants in 35 ms returned sat
[2024-05-27 22:26:51] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 109 ms returned sat
[2024-05-27 22:26:52] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2024-05-27 22:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 22:26:52] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 27 ms returned sat
[2024-05-27 22:26:53] [INFO ] [Nat]Absence check using state equation in 1318 ms returned sat
[2024-05-27 22:26:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:26:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 1015 ms returned unknown
[2024-05-27 22:26:55] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 22:26:55] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 40 ms returned sat
[2024-05-27 22:26:55] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2024-05-27 22:26:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:26:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 22:26:55] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned sat
[2024-05-27 22:26:57] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2024-05-27 22:26:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:26:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 728 ms returned sat
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 5 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 15 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 73 places in 580 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1124 ms
[2024-05-27 22:26:59] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 209 ms.
[2024-05-27 22:27:00] [INFO ] Added : 55 causal constraints over 11 iterations in 1819 ms. Result :unknown
[2024-05-27 22:27:00] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2024-05-27 22:27:00] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 64 ms returned unsat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 32 ms returned unsat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned unsat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 22:27:01] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[1, 2, 3, 4, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
Support contains 40 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 516 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-27 22:27:02] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-27 22:27:02] [INFO ] Computed 56 invariants in 59 ms
[2024-05-27 22:27:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 14 ms to minimize.
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:27:17] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 214 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 218 places in 292 ms of which 3 ms to minimize.
[2024-05-27 22:27:23] [INFO ] Deduced a trap composed of 348 places in 297 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 67 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-27 22:27:37] [INFO ] Deduced a trap composed of 186 places in 308 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 14/14 constraints]
After SMT, in 44464ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 44526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45095 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-05-27 22:27:46] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:27:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
RANDOM walk for 1000000 steps (354 resets) in 4695 ms. (212 steps per ms)
BEST_FIRST walk for 3000000 steps (1188 resets) in 6690 ms. (448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
[2024-05-27 22:27:58] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:27:58] [INFO ] Invariant cache hit.
[2024-05-27 22:27:58] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 22:27:58] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-27 22:27:58] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-27 22:27:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:27:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:27:58] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 17 ms returned sat
[2024-05-27 22:27:59] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2024-05-27 22:27:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:27:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 707 ms returned sat
[2024-05-27 22:28:00] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:28:00] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 3 ms to minimize.
[2024-05-27 22:28:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 519 ms
[2024-05-27 22:28:00] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:28:00] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-27 22:28:00] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-27 22:28:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:28:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 22:28:01] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 39 ms returned sat
[2024-05-27 22:28:04] [INFO ] [Nat]Absence check using state equation in 2999 ms returned sat
[2024-05-27 22:28:04] [INFO ] [Nat]Added 120 Read/Feed constraints in 606 ms returned sat
[2024-05-27 22:28:05] [INFO ] Deduced a trap composed of 209 places in 306 ms of which 8 ms to minimize.
[2024-05-27 22:28:05] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 3 ms to minimize.
[2024-05-27 22:28:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2024-05-27 22:28:05] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 85 ms.
[2024-05-27 22:28:06] [INFO ] Added : 38 causal constraints over 8 iterations in 950 ms. Result :sat
Minimization took 4702 ms.
[2024-05-27 22:28:11] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:28:11] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 17 ms returned sat
[2024-05-27 22:28:11] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2024-05-27 22:28:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:28:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:28:11] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-27 22:28:12] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2024-05-27 22:28:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 2288 ms returned sat
[2024-05-27 22:28:15] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1794 ms
[2024-05-27 22:28:16] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 89 ms.
[2024-05-27 22:28:17] [INFO ] Added : 18 causal constraints over 4 iterations in 727 ms. Result :sat
Minimization took 4708 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 3, 4]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 79 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 552/552 places, 1362/1362 transitions.
[2024-05-27 22:28:22] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:28:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3, 4]
RANDOM walk for 1000000 steps (388 resets) in 4506 ms. (221 steps per ms)
BEST_FIRST walk for 2000000 steps (262 resets) in 4138 ms. (483 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-05-27 22:28:30] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:28:30] [INFO ] Invariant cache hit.
[2024-05-27 22:28:31] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:28:31] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-27 22:28:31] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2024-05-27 22:28:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:28:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 22:28:31] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-27 22:28:34] [INFO ] [Nat]Absence check using state equation in 2813 ms returned sat
[2024-05-27 22:28:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:28:35] [INFO ] [Nat]Added 120 Read/Feed constraints in 610 ms returned sat
[2024-05-27 22:28:35] [INFO ] Deduced a trap composed of 209 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:28:35] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 4 ms to minimize.
[2024-05-27 22:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 637 ms
[2024-05-27 22:28:35] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 68 ms.
[2024-05-27 22:28:36] [INFO ] Added : 38 causal constraints over 8 iterations in 919 ms. Result :sat
Minimization took 4698 ms.
[2024-05-27 22:28:41] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 22:28:41] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-27 22:28:42] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-27 22:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:28:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:28:42] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 16 ms returned sat
[2024-05-27 22:28:43] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2024-05-27 22:28:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 2150 ms returned sat
[2024-05-27 22:28:45] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1958 ms
[2024-05-27 22:28:47] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 99 ms.
[2024-05-27 22:28:48] [INFO ] Added : 18 causal constraints over 4 iterations in 802 ms. Result :sat
Minimization took 4701 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[3, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 72 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 57 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-27 22:28:52] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:28:52] [INFO ] Invariant cache hit.
[2024-05-27 22:28:53] [INFO ] Implicit Places using invariants in 810 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 826 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 532 transition count 1352
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 532 transition count 1352
Applied a total of 20 rules in 47 ms. Remains 532 /542 variables (removed 10) and now considering 1352/1362 (removed 10) transitions.
[2024-05-27 22:28:53] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
// Phase 1: matrix 1332 rows 532 cols
[2024-05-27 22:28:53] [INFO ] Computed 46 invariants in 24 ms
[2024-05-27 22:28:54] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2024-05-27 22:28:54] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:28:54] [INFO ] Invariant cache hit.
[2024-05-27 22:28:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:29:04] [INFO ] Implicit Places using invariants and state equation in 10166 ms returned []
Implicit Place search using SMT with State Equation took 11199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 532/552 places, 1352/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12130 ms. Remains : 532/552 places, 1352/1362 transitions.
[2024-05-27 22:29:04] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:29:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3, 4]
RANDOM walk for 1000000 steps (346 resets) in 4043 ms. (247 steps per ms)
BEST_FIRST walk for 2000002 steps (254 resets) in 3651 ms. (547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-05-27 22:29:12] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:29:12] [INFO ] Invariant cache hit.
[2024-05-27 22:29:12] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 22:29:12] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2024-05-27 22:29:13] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-27 22:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:29:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-27 22:29:13] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 53 ms returned sat
[2024-05-27 22:29:14] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2024-05-27 22:29:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:29:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:29:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 9011 ms returned unknown
[2024-05-27 22:29:23] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 22:29:23] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 33 ms returned sat
[2024-05-27 22:29:24] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-27 22:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:29:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-27 22:29:24] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2024-05-27 22:29:25] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2024-05-27 22:29:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 1851 ms returned sat
[2024-05-27 22:29:27] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 87 ms.
[2024-05-27 22:29:28] [INFO ] Added : 47 causal constraints over 10 iterations in 1885 ms. Result :sat
Minimization took 6574 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[3, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 55 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:29:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:29:35] [INFO ] Invariant cache hit.
[2024-05-27 22:29:36] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-05-27 22:29:36] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:29:36] [INFO ] Invariant cache hit.
[2024-05-27 22:29:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:29:46] [INFO ] Implicit Places using invariants and state equation in 10087 ms returned []
Implicit Place search using SMT with State Equation took 10883 ms to find 0 implicit places.
[2024-05-27 22:29:46] [INFO ] Redundant transitions in 57 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:29:46] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:29:46] [INFO ] Invariant cache hit.
[2024-05-27 22:29:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:29:59] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:30:00] [INFO ] Deduced a trap composed of 196 places in 433 ms of which 3 ms to minimize.
[2024-05-27 22:30:00] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:30:02] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2024-05-27 22:30:10] [INFO ] Deduced a trap composed of 203 places in 238 ms of which 3 ms to minimize.
[2024-05-27 22:30:11] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 3 ms to minimize.
[2024-05-27 22:30:11] [INFO ] Deduced a trap composed of 223 places in 289 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
(s255 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 3.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:30:22] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 8 ms to minimize.
[2024-05-27 22:30:22] [INFO ] Deduced a trap composed of 186 places in 312 ms of which 3 ms to minimize.
[2024-05-27 22:30:31] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63162ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74162 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (18 resets) in 1299 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 328 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 144386 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 144386 steps, saw 85135 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-27 22:30:53] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:30:53] [INFO ] Invariant cache hit.
[2024-05-27 22:30:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:30:55] [INFO ] Deduced a trap composed of 218 places in 460 ms of which 3 ms to minimize.
[2024-05-27 22:30:55] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:30:55] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 4 ms to minimize.
[2024-05-27 22:30:56] [INFO ] Deduced a trap composed of 212 places in 421 ms of which 6 ms to minimize.
[2024-05-27 22:30:56] [INFO ] Deduced a trap composed of 44 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:30:56] [INFO ] Deduced a trap composed of 44 places in 435 ms of which 22 ms to minimize.
[2024-05-27 22:30:57] [INFO ] Deduced a trap composed of 209 places in 378 ms of which 4 ms to minimize.
[2024-05-27 22:30:57] [INFO ] Deduced a trap composed of 200 places in 413 ms of which 5 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 5 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 200 places in 408 ms of which 6 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 3 ms to minimize.
SMT process timed out in 5251ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 46 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:30:58] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:30:59] [INFO ] Invariant cache hit.
[2024-05-27 22:30:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:31:11] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:31:11] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:31:11] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:31:11] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:31:11] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:31:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:31:14] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:31:22] [INFO ] Deduced a trap composed of 203 places in 246 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 57 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:31:24] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-27 22:31:29] [INFO ] Deduced a trap composed of 332 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 265 places in 225 ms of which 3 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 186 places in 242 ms of which 3 ms to minimize.
[2024-05-27 22:31:39] [INFO ] Deduced a trap composed of 200 places in 221 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 43323ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43398 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (22 resets) in 682 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 137071 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 4
Probabilistic random walk after 137071 steps, saw 80998 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-27 22:31:46] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:31:46] [INFO ] Invariant cache hit.
[2024-05-27 22:31:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 218 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 212 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 44 places in 413 ms of which 4 ms to minimize.
[2024-05-27 22:31:48] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 3 ms to minimize.
[2024-05-27 22:31:48] [INFO ] Deduced a trap composed of 209 places in 880 ms of which 2 ms to minimize.
[2024-05-27 22:31:49] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:31:49] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-05-27 22:31:49] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 3 ms to minimize.
[2024-05-27 22:31:49] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 2 ms to minimize.
[2024-05-27 22:31:50] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:31:50] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 3 ms to minimize.
[2024-05-27 22:31:50] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/1864 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1864 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 712 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7974 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:31:55] [INFO ] Deduced a trap composed of 44 places in 552 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1862 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1864 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:32:12] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1864 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1864 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 718 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 53033ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2669 ms.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:32:41] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:32:41] [INFO ] Invariant cache hit.
[2024-05-27 22:32:42] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-27 22:32:42] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:32:42] [INFO ] Invariant cache hit.
[2024-05-27 22:32:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:32:52] [INFO ] Implicit Places using invariants and state equation in 10311 ms returned []
Implicit Place search using SMT with State Equation took 10918 ms to find 0 implicit places.
[2024-05-27 22:32:52] [INFO ] Redundant transitions in 26 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:32:52] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:32:52] [INFO ] Invariant cache hit.
[2024-05-27 22:32:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:33:04] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:33:06] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
[2024-05-27 22:33:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:33:07] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:33:15] [INFO ] Deduced a trap composed of 203 places in 339 ms of which 4 ms to minimize.
[2024-05-27 22:33:17] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:33:17] [INFO ] Deduced a trap composed of 223 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:33:28] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:33:28] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 2 ms to minimize.
[2024-05-27 22:33:39] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63341ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74350 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[3, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-04
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:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2024-05-27 22:33:56] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:33:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (3 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-27 22:33:56] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:33:56] [INFO ] Invariant cache hit.
[2024-05-27 22:33:56] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-27 22:33:56] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2024-05-27 22:33:56] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-05-27 22:33:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:33:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-27 22:33:56] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned sat
[2024-05-27 22:33:58] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2024-05-27 22:33:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:33:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:33:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 1014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 53 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:33:59] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:33:59] [INFO ] Invariant cache hit.
[2024-05-27 22:33:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:34:12] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-27 22:34:12] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:34:12] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:34:12] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:34:12] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:34:14] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:34:16] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 4 ms to minimize.
[2024-05-27 22:34:39] [INFO ] Deduced a trap composed of 186 places in 292 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 14/14 constraints]
After SMT, in 44042ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 44069ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44128 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-27 22:34:43] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:34:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (357 resets) in 3793 ms. (263 steps per ms)
BEST_FIRST walk for 1000001 steps (123 resets) in 1714 ms. (583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-27 22:34:48] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:34:48] [INFO ] Invariant cache hit.
[2024-05-27 22:34:48] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 22:34:48] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-27 22:34:49] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-05-27 22:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-27 22:34:49] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2024-05-27 22:34:50] [INFO ] [Nat]Absence check using state equation in 1386 ms returned sat
[2024-05-27 22:34:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:34:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:34:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 9021 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 35 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 27 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:34:59] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:34:59] [INFO ] Invariant cache hit.
[2024-05-27 22:35:00] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-27 22:35:00] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:35:00] [INFO ] Invariant cache hit.
[2024-05-27 22:35:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:35:10] [INFO ] Implicit Places using invariants and state equation in 10500 ms returned []
Implicit Place search using SMT with State Equation took 11023 ms to find 0 implicit places.
[2024-05-27 22:35:11] [INFO ] Redundant transitions in 85 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:35:11] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:35:11] [INFO ] Invariant cache hit.
[2024-05-27 22:35:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 3 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 4 ms to minimize.
[2024-05-27 22:35:26] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:35:28] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 203 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:35:38] [INFO ] Deduced a trap composed of 224 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:35:38] [INFO ] Deduced a trap composed of 223 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 186 places in 302 ms of which 3 ms to minimize.
[2024-05-27 22:35:57] [INFO ] Deduced a trap composed of 79 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63866ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75028 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (21 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 196796 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 2
Probabilistic random walk after 196796 steps, saw 114882 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-27 22:36:18] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:36:18] [INFO ] Invariant cache hit.
[2024-05-27 22:36:18] [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) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:36:19] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-05-27 22:36:19] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 14 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:36:22] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3740 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 4951ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 27 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:36:23] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:36:23] [INFO ] Invariant cache hit.
[2024-05-27 22:36:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:36:38] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:36:38] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:36:38] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:36:38] [INFO ] Deduced a trap composed of 196 places in 384 ms of which 4 ms to minimize.
[2024-05-27 22:36:39] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:36:53] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:37:05] [INFO ] Deduced a trap composed of 186 places in 365 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 14/14 constraints]
After SMT, in 44185ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 44215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44248 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (19 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174028 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 174028 steps, saw 101992 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-27 22:37:10] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:37:10] [INFO ] Invariant cache hit.
[2024-05-27 22:37:10] [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) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 4 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-27 22:37:13] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:37:15] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 5084ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 26 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:37:16] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:37:16] [INFO ] Invariant cache hit.
[2024-05-27 22:37:16] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-27 22:37:16] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:37:16] [INFO ] Invariant cache hit.
[2024-05-27 22:37:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:37:27] [INFO ] Implicit Places using invariants and state equation in 10370 ms returned []
Implicit Place search using SMT with State Equation took 10977 ms to find 0 implicit places.
[2024-05-27 22:37:27] [INFO ] Redundant transitions in 39 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:37:27] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:37:27] [INFO ] Invariant cache hit.
[2024-05-27 22:37:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:37:41] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:37:42] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 3 ms to minimize.
[2024-05-27 22:37:42] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:37:44] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:37:54] [INFO ] Deduced a trap composed of 203 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:37:55] [INFO ] Deduced a trap composed of 224 places in 291 ms of which 4 ms to minimize.
[2024-05-27 22:37:55] [INFO ] Deduced a trap composed of 223 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:38:03] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2024-05-27 22:38:04] [INFO ] Deduced a trap composed of 186 places in 327 ms of which 5 ms to minimize.
[2024-05-27 22:38:14] [INFO ] Deduced a trap composed of 79 places in 301 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63656ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74739 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-04 in 274670 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-27 22:38:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:38:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-27 22:38:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:38:30] [INFO ] Invariant cache hit.
[2024-05-27 22:38:30] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 22:38:31] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 33 ms returned sat
[2024-05-27 22:38:31] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-27 22:38:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:38:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-27 22:38:31] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-27 22:38:32] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2024-05-27 22:38:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:38:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:38:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 1014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 38 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:38:33] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:38:33] [INFO ] Invariant cache hit.
[2024-05-27 22:38:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:38:48] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:38:48] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:38:48] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:38:49] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:38:51] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:39:15] [INFO ] Deduced a trap composed of 186 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 14/14 constraints]
After SMT, in 43910ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43934ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43977 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-27 22:39:17] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:39:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (376 resets) in 4336 ms. (230 steps per ms)
BEST_FIRST walk for 1000001 steps (104 resets) in 2284 ms. (437 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-27 22:39:24] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:39:24] [INFO ] Invariant cache hit.
[2024-05-27 22:39:24] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-27 22:39:24] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2024-05-27 22:39:24] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-05-27 22:39:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:39:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 22:39:24] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2024-05-27 22:39:25] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-05-27 22:39:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:39:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 1983 ms returned sat
[2024-05-27 22:39:27] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 98 ms.
[2024-05-27 22:39:30] [INFO ] Added : 47 causal constraints over 10 iterations in 2220 ms. Result :sat
Minimization took 5241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 26 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 44 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:39:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:39:35] [INFO ] Invariant cache hit.
[2024-05-27 22:39:35] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-27 22:39:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:39:35] [INFO ] Invariant cache hit.
[2024-05-27 22:39:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:39:46] [INFO ] Implicit Places using invariants and state equation in 10387 ms returned []
Implicit Place search using SMT with State Equation took 10991 ms to find 0 implicit places.
[2024-05-27 22:39:46] [INFO ] Redundant transitions in 11 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:39:46] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:39:46] [INFO ] Invariant cache hit.
[2024-05-27 22:39:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:40:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:40:01] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 4 ms to minimize.
[2024-05-27 22:40:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:40:04] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:40:13] [INFO ] Deduced a trap composed of 203 places in 290 ms of which 4 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 4 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 223 places in 271 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:40:23] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-05-27 22:40:23] [INFO ] Deduced a trap composed of 186 places in 342 ms of which 4 ms to minimize.
[2024-05-27 22:40:33] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63932ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75005 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (14 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 188433 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188433 steps, saw 110124 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-27 22:40:53] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:40:53] [INFO ] Invariant cache hit.
[2024-05-27 22:40:53] [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) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-27 22:40:56] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:40:56] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1862/1864 variables, and 703 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 530/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4986ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:40:58] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:40:58] [INFO ] Invariant cache hit.
[2024-05-27 22:40:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 7 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:41:13] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 4 ms to minimize.
[2024-05-27 22:41:13] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:41:15] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:41:28] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 7 ms to minimize.
[2024-05-27 22:41:40] [INFO ] Deduced a trap composed of 186 places in 328 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 14/14 constraints]
After SMT, in 43766ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43810 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (14 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 173185 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 173185 steps, saw 101493 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-27 22:41:45] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:41:45] [INFO ] Invariant cache hit.
[2024-05-27 22:41:45] [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) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:41:47] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-27 22:41:47] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:41:47] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-05-27 22:41:48] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-27 22:41:48] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:41:48] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:41:48] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:41:48] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 22:41:51] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 4 ms to minimize.
[2024-05-27 22:41:51] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 710 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5760 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 7238ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1431 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 23 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 23 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-27 22:41:54] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:41:54] [INFO ] Invariant cache hit.
[2024-05-27 22:41:55] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-27 22:41:55] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:41:55] [INFO ] Invariant cache hit.
[2024-05-27 22:41:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:42:05] [INFO ] Implicit Places using invariants and state equation in 10212 ms returned []
Implicit Place search using SMT with State Equation took 10845 ms to find 0 implicit places.
[2024-05-27 22:42:05] [INFO ] Redundant transitions in 12 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-27 22:42:05] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-27 22:42:05] [INFO ] Invariant cache hit.
[2024-05-27 22:42:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:42:18] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:42:18] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:42:18] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:42:18] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:42:18] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:42:19] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:42:19] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:42:19] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:42:19] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-27 22:42:19] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:42:20] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:42:22] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:42:30] [INFO ] Deduced a trap composed of 203 places in 362 ms of which 4 ms to minimize.
[2024-05-27 22:42:31] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:42:32] [INFO ] Deduced a trap composed of 223 places in 297 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-27 22:42:41] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-27 22:42:42] [INFO ] Deduced a trap composed of 186 places in 352 ms of which 4 ms to minimize.
[2024-05-27 22:42:52] [INFO ] Deduced a trap composed of 79 places in 311 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63987ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74904 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-10 in 278460 ms.
[2024-05-27 22:43:09] [INFO ] Flatten gal took : 170 ms
[2024-05-27 22:43:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-27 22:43:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 1352 transitions and 6970 arcs took 11 ms.
Total runtime 988860 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S02J06T10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 532
TRANSITIONS: 1352
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.000s]
SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1841
MODEL NAME: /home/mcc/execution/419/model
532 places, 1352 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;