About the Execution of LTSMin+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 |
| 5653.920 | 970089.00 | 1196784.00 | 186.20 | 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.r516-tajo-171654446400117.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400117
=====================================================================
--------------------
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 1717249405089
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:43:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:43:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:43:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 886 ms
[2024-06-01 13:43:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-06-01 13:43:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:43:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:43:27] [INFO ] Computed 26 invariants in 12 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-06-01 13:43:27] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:43:27] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 13:43:27] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 13:43:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-01 13:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 21 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 13:43:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 13:43:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 29 ms returned sat
[2024-06-01 13:43:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 13:43:28] [INFO ] Added : 8 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 41 ms.
[2024-06-01 13:43:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2024-06-01 13:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 13:43:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:43:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 12 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-06-01 13:43:29] [INFO ] Added : 58 causal constraints over 12 iterations in 247 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:43:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:43:29] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2024-06-01 13:43:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:43:29] [INFO ] Added : 59 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 13:43:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:43:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 13:43:30] [INFO ] Added : 54 causal constraints over 11 iterations in 90 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 13:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-06-01 13:43:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:43:30] [INFO ] Added : 56 causal constraints over 12 iterations in 110 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 112 ms
[2024-06-01 13:43:30] [INFO ] Added : 56 causal constraints over 12 iterations in 189 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 62 ms returned sat
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-06-01 13:43:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 13:43:31] [INFO ] Added : 47 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 53 ms.
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:43:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:43:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:43:31] [INFO ] Added : 58 causal constraints over 12 iterations in 96 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:43:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 13:43:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:43:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 13:43:32] [INFO ] Added : 58 causal constraints over 12 iterations in 153 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 13:43:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:43:32] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 13:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:43:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:43:32] [INFO ] Added : 52 causal constraints over 11 iterations in 84 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 13:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:43:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:43:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2024-06-01 13:43:33] [INFO ] Added : 45 causal constraints over 9 iterations in 325 ms. Result :sat
Minimization took 32 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-06-01 13:43:33] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 69 ms.
[2024-06-01 13:43:33] [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-06-01 13:43:33] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 13:43:33] [INFO ] Computed 58 invariants in 87 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 (3 resets) in 123 ms. (80 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 80004 steps (22 resets) in 398 ms. (200 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-06-01 13:43:33] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 13:43:33] [INFO ] Invariant cache hit.
[2024-06-01 13:43:33] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 13:43:34] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned unsat
[2024-06-01 13:43:34] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-06-01 13:43:34] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 41 ms returned sat
[2024-06-01 13:43:35] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2024-06-01 13:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 13:43:35] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned sat
[2024-06-01 13:43:35] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-06-01 13:43:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:43:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:43:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 1017 ms returned unknown
[2024-06-01 13:43:37] [INFO ] [Real]Absence check using 14 positive place invariants in 34 ms returned sat
[2024-06-01 13:43:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 42 ms returned sat
[2024-06-01 13:43:38] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2024-06-01 13:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 13:43:38] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 36 ms returned sat
[2024-06-01 13:43:40] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2024-06-01 13:43:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:43:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 1019 ms returned unknown
[2024-06-01 13:43:41] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-06-01 13:43:41] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 31 ms returned sat
[2024-06-01 13:43:41] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-06-01 13:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-06-01 13:43:42] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned sat
[2024-06-01 13:43:43] [INFO ] [Nat]Absence check using state equation in 1531 ms returned unknown
[2024-06-01 13:43:43] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 13:43:43] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned unsat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned unsat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 13:43:44] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 38 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 3 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 274 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-06-01 13:43:44] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-06-01 13:43:44] [INFO ] Computed 56 invariants in 46 ms
[2024-06-01 13:43:44] [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-06-01 13:44:00] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 214 places in 430 ms of which 24 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 218 places in 417 ms of which 3 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 348 places in 321 ms of which 4 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 20039 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-06-01 13:44:19] [INFO ] Deduced a trap composed of 186 places in 394 ms of which 5 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 20033 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 43639ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43979 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-06-01 13:44:28] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:44:28] [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 (372 resets) in 5130 ms. (194 steps per ms)
BEST_FIRST walk for 3000002 steps (1195 resets) in 6696 ms. (447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
[2024-06-01 13:44:40] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:44:40] [INFO ] Invariant cache hit.
[2024-06-01 13:44:40] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 13:44:40] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 23 ms returned sat
[2024-06-01 13:44:40] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-06-01 13:44:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:44:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 13:44:41] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 19 ms returned sat
[2024-06-01 13:44:41] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-06-01 13:44:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:44:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 706 ms returned sat
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 685 ms
[2024-06-01 13:44:42] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-06-01 13:44:42] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 21 ms returned sat
[2024-06-01 13:44:43] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2024-06-01 13:44:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:44:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 13:44:43] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 25 ms returned sat
[2024-06-01 13:44:46] [INFO ] [Nat]Absence check using state equation in 2535 ms returned sat
[2024-06-01 13:44:46] [INFO ] [Nat]Added 120 Read/Feed constraints in 682 ms returned sat
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 209 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 735 ms
[2024-06-01 13:44:47] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 144 ms.
[2024-06-01 13:44:48] [INFO ] Added : 38 causal constraints over 8 iterations in 1061 ms. Result :sat
Minimization took 4705 ms.
[2024-06-01 13:44:53] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-06-01 13:44:53] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 30 ms returned sat
[2024-06-01 13:44:54] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-06-01 13:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:44:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 13:44:54] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 23 ms returned sat
[2024-06-01 13:44:55] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2024-06-01 13:44:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 1924 ms returned sat
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1879 ms
[2024-06-01 13:44:59] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 116 ms.
[2024-06-01 13:44:59] [INFO ] Added : 18 causal constraints over 4 iterations in 739 ms. Result :sat
Minimization took 4704 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 69 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 69 ms. Remains : 552/552 places, 1362/1362 transitions.
[2024-06-01 13:45:04] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:45: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 (360 resets) in 4606 ms. (217 steps per ms)
BEST_FIRST walk for 2000002 steps (265 resets) in 4349 ms. (459 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-06-01 13:45:13] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:45:13] [INFO ] Invariant cache hit.
[2024-06-01 13:45:13] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 13:45:13] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 23 ms returned sat
[2024-06-01 13:45:14] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2024-06-01 13:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:45:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 13:45:14] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 43 ms returned sat
[2024-06-01 13:45:16] [INFO ] [Nat]Absence check using state equation in 2492 ms returned sat
[2024-06-01 13:45:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 528 ms returned sat
[2024-06-01 13:45:17] [INFO ] Deduced a trap composed of 209 places in 247 ms of which 11 ms to minimize.
[2024-06-01 13:45:17] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:45:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
[2024-06-01 13:45:18] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 89 ms.
[2024-06-01 13:45:18] [INFO ] Added : 38 causal constraints over 8 iterations in 980 ms. Result :sat
Minimization took 4706 ms.
[2024-06-01 13:45:23] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 13:45:23] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 18 ms returned sat
[2024-06-01 13:45:24] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2024-06-01 13:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:45:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 13:45:24] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 38 ms returned sat
[2024-06-01 13:45:25] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2024-06-01 13:45:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 1924 ms returned sat
[2024-06-01 13:45:27] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1676 ms
[2024-06-01 13:45:29] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 101 ms.
[2024-06-01 13:45:29] [INFO ] Added : 18 causal constraints over 4 iterations in 687 ms. Result :sat
Minimization took 4505 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 53 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 53 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 33 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-06-01 13:45:34] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:45:34] [INFO ] Invariant cache hit.
[2024-06-01 13:45:34] [INFO ] Implicit Places using invariants in 569 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 573 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 71 ms. Remains 532 /542 variables (removed 10) and now considering 1352/1362 (removed 10) transitions.
[2024-06-01 13:45:34] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
// Phase 1: matrix 1332 rows 532 cols
[2024-06-01 13:45:34] [INFO ] Computed 46 invariants in 26 ms
[2024-06-01 13:45:35] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 13:45:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:35] [INFO ] Invariant cache hit.
[2024-06-01 13:45:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:44] [INFO ] Implicit Places using invariants and state equation in 9097 ms returned []
Implicit Place search using SMT with State Equation took 9705 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 10383 ms. Remains : 532/552 places, 1352/1362 transitions.
[2024-06-01 13:45:44] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3, 4]
RANDOM walk for 1000000 steps (397 resets) in 4192 ms. (238 steps per ms)
BEST_FIRST walk for 2000002 steps (259 resets) in 3345 ms. (597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-06-01 13:45:52] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:52] [INFO ] Invariant cache hit.
[2024-06-01 13:45:52] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 13:45:52] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 51 ms returned sat
[2024-06-01 13:45:52] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2024-06-01 13:45:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:45:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 13:45:52] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 22 ms returned sat
[2024-06-01 13:45:53] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2024-06-01 13:45:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:46:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 9014 ms returned unknown
[2024-06-01 13:46:03] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:46:03] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2024-06-01 13:46:03] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-06-01 13:46:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:46:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:46:03] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2024-06-01 13:46:04] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2024-06-01 13:46:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 1936 ms returned sat
[2024-06-01 13:46:06] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 156 ms.
[2024-06-01 13:46:08] [INFO ] Added : 47 causal constraints over 10 iterations in 1641 ms. Result :sat
Minimization took 6342 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 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 21 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 32 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:46:14] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:46:14] [INFO ] Invariant cache hit.
[2024-06-01 13:46:15] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 13:46:15] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:46:15] [INFO ] Invariant cache hit.
[2024-06-01 13:46:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:46:24] [INFO ] Implicit Places using invariants and state equation in 9163 ms returned []
Implicit Place search using SMT with State Equation took 9871 ms to find 0 implicit places.
[2024-06-01 13:46:24] [INFO ] Redundant transitions in 86 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:46:24] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:46:24] [INFO ] Invariant cache hit.
[2024-06-01 13:46:24] [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-06-01 13:46:37] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 3 ms to minimize.
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 196 places in 203 ms of which 2 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:46:40] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 203 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:46:48] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:46:49] [INFO ] Deduced a trap composed of 223 places in 308 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 30037 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-06-01 13:47:00] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 186 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:47:10] [INFO ] Deduced a trap composed of 79 places in 313 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 30041 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 63495ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73529 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (20 resets) in 1860 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 171124 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 171124 steps, saw 100350 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 13:47:32] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:47:32] [INFO ] Invariant cache hit.
[2024-06-01 13:47:32] [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-06-01 13:47:32] [INFO ] Deduced a trap composed of 218 places in 367 ms of which 7 ms to minimize.
[2024-06-01 13:47:32] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:47:33] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 3 ms to minimize.
[2024-06-01 13:47:33] [INFO ] Deduced a trap composed of 212 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:47:33] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 209 places in 266 ms of which 3 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 200 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 226 places in 295 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1862/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5011 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: 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-06-01 13:47:38] [INFO ] Deduced a trap composed of 44 places in 70 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
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5004 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: 15/15 constraints]
After SMT, in 10048ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3388 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 29 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:47:45] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:47:45] [INFO ] Invariant cache hit.
[2024-06-01 13:47:45] [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-06-01 13:47:56] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 3 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 2 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:47:58] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:47:59] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 203 places in 239 ms of which 4 ms to minimize.
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 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 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 20024 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-06-01 13:48:10] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:48:16] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 265 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 186 places in 225 ms of which 2 ms to minimize.
[2024-06-01 13:48:25] [INFO ] Deduced a trap composed of 200 places in 201 ms of which 2 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 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: 18/18 constraints]
After SMT, in 42672ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 42686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42719 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (20 resets) in 473 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 150298 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 150298 steps, saw 88463 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 13:48:31] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:48:31] [INFO ] Invariant cache hit.
[2024-06-01 13:48:31] [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-06-01 13:48:32] [INFO ] Deduced a trap composed of 218 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:48:32] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:48:32] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 212 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 209 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 2 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 200 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 226 places in 233 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 6612 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-06-01 13:48:38] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 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
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27494 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: 15/15 constraints]
After SMT, in 34144ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2396 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 19 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-06-01 13:49:08] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:49:08] [INFO ] Invariant cache hit.
[2024-06-01 13:49:08] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 13:49:08] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:49:08] [INFO ] Invariant cache hit.
[2024-06-01 13:49:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:18] [INFO ] Implicit Places using invariants and state equation in 10100 ms returned []
Implicit Place search using SMT with State Equation took 10522 ms to find 0 implicit places.
[2024-06-01 13:49:19] [INFO ] Redundant transitions in 86 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:49:19] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:49:19] [INFO ] Invariant cache hit.
[2024-06-01 13:49:19] [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-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 4 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 203 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:49:43] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:49:44] [INFO ] Deduced a trap composed of 223 places in 230 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 30024 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-06-01 13:49:54] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 186 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:50:03] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 2 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 30019 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 62999ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73655 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-06-01 13:50:22] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:50:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (4 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (5 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-06-01 13:50:22] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:50:22] [INFO ] Invariant cache hit.
[2024-06-01 13:50:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:50:22] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 28 ms returned sat
[2024-06-01 13:50:22] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-06-01 13:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:50:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:50:22] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 19 ms returned sat
[2024-06-01 13:50:23] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2024-06-01 13:50:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:50:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:50:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 1010 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 17 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:50:24] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:50:24] [INFO ] Invariant cache hit.
[2024-06-01 13:50:24] [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-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:50:37] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:50:37] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 2 ms to minimize.
[2024-06-01 13:50:46] [INFO ] Deduced a trap composed of 203 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:50:47] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20018 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: 14/14 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, 14/58 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 320 places in 245 ms of which 2 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 186 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 332 places in 253 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 5/63 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 63 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: 19/19 constraints]
After SMT, in 43037ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43070 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-06-01 13:51:07] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:51:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (351 resets) in 4143 ms. (241 steps per ms)
BEST_FIRST walk for 1000001 steps (133 resets) in 1945 ms. (513 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-06-01 13:51:14] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:51:14] [INFO ] Invariant cache hit.
[2024-06-01 13:51:14] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2024-06-01 13:51:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 44 ms returned sat
[2024-06-01 13:51:14] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-06-01 13:51:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:51:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 13:51:14] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2024-06-01 13:51:15] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2024-06-01 13:51:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:51:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:51:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 7702 ms returned sat
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2024-06-01 13:51:24] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 98 ms.
[2024-06-01 13:51:24] [INFO ] Added : 18 causal constraints over 4 iterations in 464 ms. Result :sat
Minimization took 6509 ms.
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 44 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 45 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 24 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:51:31] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:51:31] [INFO ] Invariant cache hit.
[2024-06-01 13:51:31] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-01 13:51:31] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:51:31] [INFO ] Invariant cache hit.
[2024-06-01 13:51:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:51:40] [INFO ] Implicit Places using invariants and state equation in 9275 ms returned []
Implicit Place search using SMT with State Equation took 9843 ms to find 0 implicit places.
[2024-06-01 13:51:40] [INFO ] Redundant transitions in 26 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:51:41] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:51:41] [INFO ] Invariant cache hit.
[2024-06-01 13:51:41] [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-06-01 13:51:52] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 543 ms of which 1 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:51:55] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 203 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:52:04] [INFO ] Deduced a trap composed of 223 places in 227 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
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 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30021 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-06-01 13:52:16] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 186 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:52:24] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 2 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 30017 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 63149ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73087 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (16 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 158855 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 158855 steps, saw 93408 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 13:52:47] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:52:47] [INFO ] Invariant cache hit.
[2024-06-01 13:52:47] [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 1278 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-06-01 13:52:48] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:52:49] [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-06-01 13:52:51] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 3 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 3117 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 4436ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 124 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 18 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:52:51] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:52:51] [INFO ] Invariant cache hit.
[2024-06-01 13:52:51] [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-06-01 13:53:03] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:53:03] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:53:04] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:53:06] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:53:13] [INFO ] Deduced a trap composed of 203 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:53:14] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:53:14] [INFO ] Deduced a trap composed of 223 places in 190 ms of which 3 ms to minimize.
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 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: 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-06-01 13:53:17] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:53:25] [INFO ] Deduced a trap composed of 79 places in 209 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 20040 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 43417ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43454 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (18 resets) in 445 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 119439 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 119439 steps, saw 70919 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 13:53:38] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:53:38] [INFO ] Invariant cache hit.
[2024-06-01 13:53:38] [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 983 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-06-01 13:53:39] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 44 places in 69 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-06-01 13:53:42] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 3 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 3262 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 4268ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 116 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 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 18 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 35 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:53:43] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:53:43] [INFO ] Invariant cache hit.
[2024-06-01 13:53:43] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-01 13:53:43] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:53:43] [INFO ] Invariant cache hit.
[2024-06-01 13:53:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:53:53] [INFO ] Implicit Places using invariants and state equation in 10025 ms returned []
Implicit Place search using SMT with State Equation took 10558 ms to find 0 implicit places.
[2024-06-01 13:53:53] [INFO ] Redundant transitions in 12 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:53:53] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:53:53] [INFO ] Invariant cache hit.
[2024-06-01 13:53:53] [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-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:54:15] [INFO ] Deduced a trap composed of 203 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 224 places in 619 ms of which 3 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 223 places in 205 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 30036 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-06-01 13:54:29] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 186 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 79 places in 239 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 30017 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 63333ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73980 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 274985 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-06-01 13:54:57] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:54:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10001 steps (5 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-06-01 13:54:57] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:54:57] [INFO ] Invariant cache hit.
[2024-06-01 13:54:57] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 13:54:57] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 67 ms returned sat
[2024-06-01 13:54:57] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-06-01 13:54:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:54:57] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned sat
[2024-06-01 13:54:58] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-06-01 13:54:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:54:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:54:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 1027 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 17 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:54:59] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:54:59] [INFO ] Invariant cache hit.
[2024-06-01 13:54: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-06-01 13:55:12] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 3 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 38 places in 160 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 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: 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-06-01 13:55:29] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 186 places in 245 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 1)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 9)
(s213 0)
(s214 1)
(s215 1)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(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 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20016 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 43272ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43304 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-06-01 13:55:42] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:55:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (361 resets) in 5349 ms. (186 steps per ms)
BEST_FIRST walk for 1000001 steps (119 resets) in 2537 ms. (394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-06-01 13:55:50] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:55:50] [INFO ] Invariant cache hit.
[2024-06-01 13:55:50] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 13:55:50] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2024-06-01 13:55:51] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-06-01 13:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 13:55:51] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 28 ms returned sat
[2024-06-01 13:55:52] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-06-01 13:55:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:55:53] [INFO ] [Nat]Added 120 Read/Feed constraints in 1714 ms returned sat
[2024-06-01 13:55:54] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 91 ms.
[2024-06-01 13:55:55] [INFO ] Added : 47 causal constraints over 10 iterations in 1791 ms. Result :sat
Minimization took 6293 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 37 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 37 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:56:02] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:56:02] [INFO ] Invariant cache hit.
[2024-06-01 13:56:02] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-06-01 13:56:02] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:56:02] [INFO ] Invariant cache hit.
[2024-06-01 13:56:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:56:12] [INFO ] Implicit Places using invariants and state equation in 9871 ms returned []
Implicit Place search using SMT with State Equation took 10461 ms to find 0 implicit places.
[2024-06-01 13:56:12] [INFO ] Redundant transitions in 16 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:56:12] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:56:12] [INFO ] Invariant cache hit.
[2024-06-01 13:56:12] [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-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 4 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:56:38] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:56:39] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:56:39] [INFO ] Deduced a trap composed of 223 places in 200 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
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 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.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 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 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30034 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-06-01 13:56:49] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 186 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:56:59] [INFO ] Deduced a trap composed of 79 places in 249 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 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 64325ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 64341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74867 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (15 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 210015 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 210015 steps, saw 122241 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 13:57:20] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:57:20] [INFO ] Invariant cache hit.
[2024-06-01 13:57:20] [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 1099 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-06-01 13:57:21] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 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 3145 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 4268ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 200 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 21 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:57:24] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:57:24] [INFO ] Invariant cache hit.
[2024-06-01 13:57:24] [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-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 5 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 4 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:57:47] [INFO ] Deduced a trap composed of 203 places in 203 ms of which 3 ms to minimize.
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 20043 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-06-01 13:57:51] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 332 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:58:05] [INFO ] Deduced a trap composed of 265 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:58:06] [INFO ] Deduced a trap composed of 186 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:58:06] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 2 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 20042 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 43459ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43499 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (16 resets) in 620 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (11 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 234764 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 234764 steps, saw 135986 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 13:58:11] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:58:11] [INFO ] Invariant cache hit.
[2024-06-01 13:58:11] [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 1501 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-06-01 13:58:13] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:58:13] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:58:13] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:58:13] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 44 places in 39 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-06-01 13:58:17] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 3 ms to minimize.
[2024-06-01 13:58:17] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 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 5609 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 7148ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1019 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 21 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 22 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 21 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:58:19] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:58:19] [INFO ] Invariant cache hit.
[2024-06-01 13:58:20] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 13:58:20] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:58:20] [INFO ] Invariant cache hit.
[2024-06-01 13:58:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:58:30] [INFO ] Implicit Places using invariants and state equation in 10164 ms returned []
Implicit Place search using SMT with State Equation took 10748 ms to find 0 implicit places.
[2024-06-01 13:58:30] [INFO ] Redundant transitions in 26 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:58:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:58:30] [INFO ] Invariant cache hit.
[2024-06-01 13:58:30] [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-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 4 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:58:49] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:58:57] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:58:58] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:58:58] [INFO ] Deduced a trap composed of 223 places in 200 ms of which 2 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 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-06-01 13:59:07] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:59:07] [INFO ] Deduced a trap composed of 186 places in 323 ms of which 3 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 79 places in 288 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 30031 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 63873ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74726 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 277504 ms.
[2024-06-01 13:59:34] [INFO ] Flatten gal took : 247 ms
[2024-06-01 13:59:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 13:59:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 1352 transitions and 6970 arcs took 18 ms.
Total runtime 968576 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-UpperBounds-04
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-UpperBounds-10
BK_STOP 1717250375178
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBLF-COL-S02J06T10-UpperBounds-04
ub formula formula --maxsum=/tmp/1898/ub_0_
ub formula name PolyORBLF-COL-S02J06T10-UpperBounds-10
ub formula formula --maxsum=/tmp/1898/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-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 r516-tajo-171654446400117"
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 ;