Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 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-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716847906396

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 22:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:11:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:11:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:11:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1085 ms
[2024-05-27 22:11:49] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-27 22:11:49] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:11:49] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:11:49] [INFO ] Computed 26 invariants in 13 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 1, 6, 1, 2, 2, 6, 6, 6, 26, 18, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 22:11:49] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:11:49] [INFO ] Computed 26 invariants in 8 ms
[2024-05-27 22:11:49] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 22:11:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:11:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-27 22:11:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 22:11:49] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-27 22:11:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-27 22:11:50] [INFO ] Added : 24 causal constraints over 5 iterations in 64 ms. Result :sat
Minimization took 30 ms.
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:11:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:11:50] [INFO ] Added : 54 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:11:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:11:50] [INFO ] Added : 43 causal constraints over 10 iterations in 64 ms. Result :sat
Minimization took 42 ms.
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-27 22:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-27 22:11:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-27 22:11:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 11 ms to minimize.
[2024-05-27 22:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-27 22:11:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-27 22:11:50] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
[2024-05-27 22:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-27 22:11:51] [INFO ] Added : 59 causal constraints over 12 iterations in 181 ms. Result :sat
Minimization took 31 ms.
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-27 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:11:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:11:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:11:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 22:11:51] [INFO ] Added : 34 causal constraints over 7 iterations in 62 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:11:51] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:11:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2024-05-27 22:11:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:11:51] [INFO ] Added : 57 causal constraints over 12 iterations in 112 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:11:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-27 22:11:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-27 22:11:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:11:52] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-27 22:11:52] [INFO ] Added : 54 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:11:52] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 2 ms to minimize.
[2024-05-27 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-27 22:11:52] [INFO ] Added : 60 causal constraints over 14 iterations in 153 ms. Result :sat
Minimization took 30 ms.
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-27 22:11:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:11:52] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-27 22:11:52] [INFO ] Added : 21 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 23 ms.
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:11:52] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-27 22:11:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:11:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-27 22:11:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:11:53] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:11:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:11:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:11:53] [INFO ] Added : 54 causal constraints over 11 iterations in 60 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:11:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:11:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:11:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:11:53] [INFO ] Added : 58 causal constraints over 12 iterations in 86 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 5, 1, 2, 2, 6, 6, 5, 26, 10, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:11:53] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 52 ms.
[2024-05-27 22:11:53] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
[2024-05-27 22:11:53] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-27 22:11:53] [INFO ] Computed 50 invariants in 62 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
RANDOM walk for 10000 steps (4 resets) in 80 ms. (123 steps per ms)
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (21 resets) in 331 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 6, 2, 2, 6, 6, 26, 2]
[2024-05-27 22:11:54] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-27 22:11:54] [INFO ] Invariant cache hit.
[2024-05-27 22:11:54] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 22:11:54] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 22 ms returned sat
[2024-05-27 22:11:54] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-27 22:11:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 22:11:54] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 18 ms returned sat
[2024-05-27 22:11:55] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-27 22:11:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:11:55] [INFO ] [Nat]Added 72 Read/Feed constraints in 356 ms returned sat
[2024-05-27 22:11:55] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 74 ms.
[2024-05-27 22:11:57] [INFO ] Added : 77 causal constraints over 16 iterations in 1837 ms. Result :sat
Minimization took 562 ms.
[2024-05-27 22:11:58] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 22:11:58] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-27 22:11:58] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-27 22:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:11:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 22:11:58] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-27 22:11:59] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-05-27 22:12:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:12:00] [INFO ] [Nat]Added 72 Read/Feed constraints in 716 ms returned sat
[2024-05-27 22:12:00] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 108 ms.
[2024-05-27 22:12:01] [INFO ] Added : 80 causal constraints over 16 iterations in 1539 ms. Result :sat
Minimization took 627 ms.
[2024-05-27 22:12:02] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 22:12:02] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 16 ms returned unsat
[2024-05-27 22:12:02] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 22:12:02] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-27 22:12:03] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-05-27 22:12:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:12:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 22:12:03] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-27 22:12:04] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2024-05-27 22:12:04] [INFO ] [Nat]Added 72 Read/Feed constraints in 163 ms returned sat
[2024-05-27 22:12:04] [INFO ] Deduced a trap composed of 154 places in 311 ms of which 7 ms to minimize.
[2024-05-27 22:12:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 350 ms
[2024-05-27 22:12:04] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 22:12:04] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 13 ms returned unsat
[2024-05-27 22:12:04] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 22:12:04] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 11 ms returned unsat
[2024-05-27 22:12:05] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 22:12:05] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2024-05-27 22:12:05] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 22:12:05] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-27 22:12:05] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-05-27 22:12:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:12:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 22:12:05] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 23 ms returned sat
[2024-05-27 22:12:06] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-05-27 22:12:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 302 ms returned sat
[2024-05-27 22:12:06] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 87 ms.
[2024-05-27 22:12:10] [INFO ] Added : 207 causal constraints over 42 iterations in 3367 ms. Result :sat
Minimization took 520 ms.
[2024-05-27 22:12:10] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 22:12:10] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 1, 1, 1, 1, 1, 26, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 98 place count 486 transition count 860
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 218 place count 426 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 302 place count 384 transition count 818
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 384 transition count 812
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 314 place count 378 transition count 812
Applied a total of 314 rules in 197 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-27 22:12:10] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-05-27 22:12:10] [INFO ] Computed 48 invariants in 25 ms
[2024-05-27 22:12:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-27 22:12:16] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:12:16] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:12:16] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:12:17] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:12:17] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:12:17] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-05-27 22:12:17] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 21500ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 21526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21746 ms. Remains : 378/536 places, 812/968 transitions.
[2024-05-27 22:12:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-27 22:12:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (507 resets) in 3179 ms. (314 steps per ms)
BEST_FIRST walk for 3000003 steps (586 resets) in 4696 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-27 22:12:40] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-27 22:12:40] [INFO ] Invariant cache hit.
[2024-05-27 22:12:40] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:12:40] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 16 ms returned sat
[2024-05-27 22:12:40] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-27 22:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:12:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:12:40] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 18 ms returned sat
[2024-05-27 22:12:41] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-05-27 22:12:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:12:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 395 ms returned sat
[2024-05-27 22:12:41] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 77 ms.
[2024-05-27 22:12:43] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-05-27 22:12:43] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:12:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2024-05-27 22:12:43] [INFO ] Added : 85 causal constraints over 18 iterations in 2207 ms. Result :sat
Minimization took 3439 ms.
[2024-05-27 22:12:47] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:12:47] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2024-05-27 22:12:47] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-27 22:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:12:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:12:47] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 13 ms returned sat
[2024-05-27 22:12:47] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-27 22:12:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 200 ms returned sat
[2024-05-27 22:12:48] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 51 ms.
[2024-05-27 22:12:49] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 2 ms to minimize.
[2024-05-27 22:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-05-27 22:12:49] [INFO ] Added : 94 causal constraints over 19 iterations in 1837 ms. Result :sat
Minimization took 2992 ms.
[2024-05-27 22:12:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 22:12:53] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 23 ms returned sat
[2024-05-27 22:12:53] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-27 22:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:12:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 22:12:53] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 21 ms returned sat
[2024-05-27 22:12:53] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-27 22:12:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 341 ms returned sat
[2024-05-27 22:12:54] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 70 ms.
[2024-05-27 22:12:55] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 4 ms to minimize.
[2024-05-27 22:12:56] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-05-27 22:12:56] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:12:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1184 ms
[2024-05-27 22:12:56] [INFO ] Added : 94 causal constraints over 20 iterations in 2727 ms. Result :sat
Minimization took 3773 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 22 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 378/378 places, 812/812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 19 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2024-05-27 22:13:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-27 22:13:02] [INFO ] Invariant cache hit.
[2024-05-27 22:13:03] [INFO ] Implicit Places using invariants in 447 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 451 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 372/378 places, 812/812 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 366 transition count 806
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 806
Applied a total of 12 rules in 30 ms. Remains 366 /372 variables (removed 6) and now considering 806/812 (removed 6) transitions.
[2024-05-27 22:13:03] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-27 22:13:03] [INFO ] Computed 42 invariants in 13 ms
[2024-05-27 22:13:03] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-27 22:13:03] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:03] [INFO ] Invariant cache hit.
[2024-05-27 22:13:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:13:06] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned []
Implicit Place search using SMT with State Equation took 3741 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 366/378 places, 806/812 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4244 ms. Remains : 366/378 places, 806/812 transitions.
[2024-05-27 22:13:06] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (508 resets) in 3337 ms. (299 steps per ms)
BEST_FIRST walk for 3000001 steps (599 resets) in 4658 ms. (643 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-27 22:13:14] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:14] [INFO ] Invariant cache hit.
[2024-05-27 22:13:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 22:13:14] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 26 ms returned sat
[2024-05-27 22:13:15] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-27 22:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 22:13:15] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-27 22:13:15] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-05-27 22:13:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:13:15] [INFO ] [Nat]Added 72 Read/Feed constraints in 228 ms returned sat
[2024-05-27 22:13:15] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 48 ms.
[2024-05-27 22:13:16] [INFO ] Added : 106 causal constraints over 22 iterations in 1152 ms. Result :sat
Minimization took 2071 ms.
[2024-05-27 22:13:19] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 22:13:19] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 26 ms returned sat
[2024-05-27 22:13:19] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-27 22:13:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 22:13:19] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-27 22:13:20] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-05-27 22:13:20] [INFO ] [Nat]Added 72 Read/Feed constraints in 92 ms returned sat
[2024-05-27 22:13:20] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 58 ms.
[2024-05-27 22:13:21] [INFO ] Deduced a trap composed of 134 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2024-05-27 22:13:21] [INFO ] Added : 90 causal constraints over 18 iterations in 1542 ms. Result :sat
Minimization took 2377 ms.
[2024-05-27 22:13:24] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 22:13:24] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 21 ms returned sat
[2024-05-27 22:13:24] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-27 22:13:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:13:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 22:13:24] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-27 22:13:25] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-27 22:13:25] [INFO ] [Nat]Added 72 Read/Feed constraints in 389 ms returned sat
[2024-05-27 22:13:25] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 42 ms.
[2024-05-27 22:13:27] [INFO ] Added : 91 causal constraints over 19 iterations in 1803 ms. Result :sat
Minimization took 2179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 22 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 366/366 places, 806/806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 19 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2024-05-27 22:13:30] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:30] [INFO ] Invariant cache hit.
[2024-05-27 22:13:31] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-27 22:13:31] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:31] [INFO ] Invariant cache hit.
[2024-05-27 22:13:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:13:34] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3542 ms to find 0 implicit places.
[2024-05-27 22:13:34] [INFO ] Redundant transitions in 47 ms returned []
Running 804 sub problems to find dead transitions.
[2024-05-27 22:13:34] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-27 22:13:34] [INFO ] Invariant cache hit.
[2024-05-27 22:13:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:13:41] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 2 ms to minimize.
[2024-05-27 22:13:41] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/48 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-27 22:13:57] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 2 ms to minimize.
[2024-05-27 22:13:57] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 2/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-27 22:14:04] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
(s298 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 2.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 9.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 4.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1160 variables, and 51 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 36 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-27 22:14:07] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1160 variables, and 54 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 13/13 constraints]
After SMT, in 61467ms problems are : Problem set: 36 solved, 768 unsolved
Search for dead transitions found 36 dead transitions in 61477ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/366 places, 770/806 transitions.
Applied a total of 0 rules in 15 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-27 22:14:35] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65146 ms. Remains : 366/366 places, 770/806 transitions.
[2024-05-27 22:14:36] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-27 22:14:36] [INFO ] Computed 42 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (518 resets) in 3120 ms. (320 steps per ms)
BEST_FIRST walk for 3000001 steps (638 resets) in 4736 ms. (633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-27 22:14:43] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:14:43] [INFO ] Invariant cache hit.
[2024-05-27 22:14:43] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:43] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-27 22:14:44] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-27 22:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 22:14:44] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-27 22:14:44] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2024-05-27 22:14:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:14:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 527 ms returned sat
[2024-05-27 22:14:45] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 45 ms.
[2024-05-27 22:14:46] [INFO ] Added : 123 causal constraints over 25 iterations in 1397 ms. Result :sat
Minimization took 2162 ms.
[2024-05-27 22:14:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:49] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-27 22:14:49] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-05-27 22:14:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:49] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-27 22:14:49] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-05-27 22:14:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 242 ms returned sat
[2024-05-27 22:14:50] [INFO ] Deduced a trap composed of 117 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2024-05-27 22:14:50] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 47 ms.
[2024-05-27 22:14:52] [INFO ] Added : 65 causal constraints over 14 iterations in 2308 ms. Result :sat
Minimization took 1939 ms.
[2024-05-27 22:14:54] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:14:54] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-27 22:14:54] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-05-27 22:14:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:14:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:14:55] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-27 22:14:55] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-27 22:14:55] [INFO ] [Nat]Added 72 Read/Feed constraints in 268 ms returned sat
[2024-05-27 22:14:55] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 46 ms.
[2024-05-27 22:14:56] [INFO ] Added : 64 causal constraints over 13 iterations in 806 ms. Result :sat
Minimization took 2017 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 28 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 27 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-27 22:15:00] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:15:00] [INFO ] Invariant cache hit.
[2024-05-27 22:15:00] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-27 22:15:00] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:15:00] [INFO ] Invariant cache hit.
[2024-05-27 22:15:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:15:05] [INFO ] Implicit Places using invariants and state equation in 5060 ms returned []
Implicit Place search using SMT with State Equation took 5722 ms to find 0 implicit places.
[2024-05-27 22:15:05] [INFO ] Redundant transitions in 6 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-27 22:15:05] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:15:05] [INFO ] Invariant cache hit.
[2024-05-27 22:15:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:15:10] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:15:11] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:15:11] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:15:11] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-27 22:15:11] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:15:12] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:15:12] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:15:12] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
[2024-05-27 22:15:13] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-27 22:15:14] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:15:17] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:15:18] [INFO ] Deduced a trap composed of 181 places in 142 ms of which 3 ms to minimize.
[2024-05-27 22:15:18] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8.0)
(s1 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 9.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 (/ 2.0 3.0))
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 (/ 2.0 3.0))
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SMT process timed out in 31029ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 31038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36809 ms. Remains : 366/366 places, 770/770 transitions.
RANDOM walk for 40000 steps (23 resets) in 1817 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 473 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 505 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 485 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 373 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (13 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (9 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 80832 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 6
Probabilistic random walk after 80832 steps, saw 45164 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-27 22:15:41] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:15:41] [INFO ] Invariant cache hit.
[2024-05-27 22:15:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-27 22:15:42] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 8 ms to minimize.
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 47 places in 407 ms of which 1 ms to minimize.
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-27 22:15:44] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 3 solved, 3 unsolved in 4928 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 6160ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 2885 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 24 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running 768 sub problems to find dead transitions.
[2024-05-27 22:15:50] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:15:50] [INFO ] Invariant cache hit.
[2024-05-27 22:15:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:15:55] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 6 ms to minimize.
[2024-05-27 22:15:55] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:15:55] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:15:55] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 0 ms to minimize.
[2024-05-27 22:15:55] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:15:56] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:15:56] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 2 ms to minimize.
[2024-05-27 22:15:56] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:15:56] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 2 ms to minimize.
[2024-05-27 22:15:57] [INFO ] Deduced a trap composed of 119 places in 299 ms of which 2 ms to minimize.
[2024-05-27 22:15:57] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 2 ms to minimize.
[2024-05-27 22:15:57] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:15:58] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:15:59] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:16:02] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:16:03] [INFO ] Deduced a trap composed of 181 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:16:03] [INFO ] Deduced a trap composed of 166 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1124 variables, and 57 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 3 ms to minimize.
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:16:15] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:16:16] [INFO ] Deduced a trap composed of 222 places in 137 ms of which 2 ms to minimize.
[2024-05-27 22:16:17] [INFO ] Deduced a trap composed of 176 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:16:17] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:16:18] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:16:18] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1124 variables, and 67 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 26/26 constraints]
After SMT, in 41173ms problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 41195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41223 ms. Remains : 366/366 places, 770/770 transitions.
RANDOM walk for 40001 steps (22 resets) in 393 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (12 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 176 ms. (225 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 198172 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 198172 steps, saw 101257 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-27 22:16:35] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:16:35] [INFO ] Invariant cache hit.
[2024-05-27 22:16:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6822 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 7682ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1314 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 19 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 11 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-27 22:16:44] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:16:44] [INFO ] Invariant cache hit.
[2024-05-27 22:16:44] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-27 22:16:44] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:16:44] [INFO ] Invariant cache hit.
[2024-05-27 22:16:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:16:49] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 5259 ms to find 0 implicit places.
[2024-05-27 22:16:49] [INFO ] Redundant transitions in 7 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-27 22:16:49] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:16:49] [INFO ] Invariant cache hit.
[2024-05-27 22:16:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:16:56] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:16:56] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:16:57] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-27 22:17:00] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:17:01] [INFO ] Deduced a trap composed of 181 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:17:02] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 10.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 (/ 1.0 3.0))
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 2.0 3.0))
(s158 (/ 2.0 3.0))
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 (/ 1.0 3.0))
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SMT process timed out in 31056ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 31068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36354 ms. Remains : 366/366 places, 770/770 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00
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:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-05-27 22:17:20] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:17:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (6 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-27 22:17:20] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:17:20] [INFO ] Invariant cache hit.
[2024-05-27 22:17:20] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:17:20] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-27 22:17:21] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-27 22:17:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:17:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:17:21] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-27 22:17:21] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-05-27 22:17:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:17:22] [INFO ] [Nat]Added 72 Read/Feed constraints in 662 ms returned sat
[2024-05-27 22:17:22] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 63 ms.
[2024-05-27 22:17:23] [INFO ] Added : 49 causal constraints over 10 iterations in 743 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 360 transition count 758
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 63 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-27 22:17:23] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-05-27 22:17:23] [INFO ] Computed 42 invariants in 14 ms
[2024-05-27 22:17:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-27 22:17:29] [INFO ] Deduced a trap composed of 117 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 3 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 2 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:17:30] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 2 ms to minimize.
[2024-05-27 22:17:31] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:17:31] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:17:31] [INFO ] Deduced a trap composed of 117 places in 598 ms of which 2 ms to minimize.
[2024-05-27 22:17:33] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 2 ms to minimize.
[2024-05-27 22:17:36] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 2 ms to minimize.
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 152 places in 154 ms of which 2 ms to minimize.
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 2 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 66 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:17:53] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-27 22:17:53] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 4 ms to minimize.
[2024-05-27 22:18:01] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 29/29 constraints]
After SMT, in 41086ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41098ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41163 ms. Remains : 354/366 places, 758/770 transitions.
[2024-05-27 22:18:04] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:18:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (549 resets) in 2430 ms. (411 steps per ms)
BEST_FIRST walk for 1000000 steps (203 resets) in 1262 ms. (791 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-27 22:18:08] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:18:08] [INFO ] Invariant cache hit.
[2024-05-27 22:18:08] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-27 22:18:08] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-27 22:18:08] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-05-27 22:18:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:18:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-27 22:18:08] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-27 22:18:09] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-05-27 22:18:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:18:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 529 ms returned sat
[2024-05-27 22:18:09] [INFO ] Computed and/alt/rep : 492/2361/486 causal constraints (skipped 258 transitions) in 46 ms.
[2024-05-27 22:18:12] [INFO ] Added : 89 causal constraints over 19 iterations in 3004 ms. Result :sat
Minimization took 2265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-27 22:18:15] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:18:15] [INFO ] Invariant cache hit.
[2024-05-27 22:18:16] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-27 22:18:16] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:18:16] [INFO ] Invariant cache hit.
[2024-05-27 22:18:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:18:19] [INFO ] Implicit Places using invariants and state equation in 3594 ms returned []
Implicit Place search using SMT with State Equation took 4163 ms to find 0 implicit places.
[2024-05-27 22:18:19] [INFO ] Redundant transitions in 4 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-27 22:18:19] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:18:19] [INFO ] Invariant cache hit.
[2024-05-27 22:18:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 148 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 183 places in 259 ms of which 2 ms to minimize.
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 2 ms to minimize.
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:18:26] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:18:26] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2024-05-27 22:18:26] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 2 ms to minimize.
[2024-05-27 22:18:26] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:18:28] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:18:28] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:18:29] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:18:42] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:18:46] [INFO ] Deduced a trap composed of 154 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:18:46] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:18:49] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 2.0)
(s12 1.0)
(s13 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 64 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:18:56] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:18:56] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:18:56] [INFO ] Deduced a trap composed of 210 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-27 22:19:02] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:19:04] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:11] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 71 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 31/31 constraints]
After SMT, in 61060ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 61068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65256 ms. Remains : 354/354 places, 758/758 transitions.
RANDOM walk for 40000 steps (23 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (19 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 190785 steps, run timeout after 3002 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190785 steps, saw 97058 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-27 22:19:24] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:19:24] [INFO ] Invariant cache hit.
[2024-05-27 22:19:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 1 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 22:19:24] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-27 22:19:24] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1100 variables, and 395 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 352/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1526ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-27 22:19:25] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:19:25] [INFO ] Invariant cache hit.
[2024-05-27 22:19:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:30] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-27 22:19:30] [INFO ] Deduced a trap composed of 148 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:19:30] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:19:30] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 183 places in 185 ms of which 2 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:19:31] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 2 ms to minimize.
[2024-05-27 22:19:32] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:19:32] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:19:32] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:19:32] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:19:34] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:19:34] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:19:35] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:19:37] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:19:37] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:40] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 60 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:50] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-05-27 22:19:52] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:19:52] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:19:52] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:19:53] [INFO ] Deduced a trap composed of 218 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:19:53] [INFO ] Deduced a trap composed of 200 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:19:59] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:19:59] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:20:00] [INFO ] Deduced a trap composed of 186 places in 191 ms of which 2 ms to minimize.
[2024-05-27 22:20:02] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:20:03] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:20:04] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 72 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 32/32 constraints]
After SMT, in 41002ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41024 ms. Remains : 354/354 places, 758/758 transitions.
RANDOM walk for 40000 steps (25 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 394725 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 394725 steps, saw 187923 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-27 22:20:09] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:20:09] [INFO ] Invariant cache hit.
[2024-05-27 22:20:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:20:10] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:20:10] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 746/1098 variables, 352/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 72/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:20:12] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1100 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1100 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 22 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-27 22:20:13] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:20:13] [INFO ] Invariant cache hit.
[2024-05-27 22:20:13] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-27 22:20:13] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:20:13] [INFO ] Invariant cache hit.
[2024-05-27 22:20:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:20:17] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 4235 ms to find 0 implicit places.
[2024-05-27 22:20:17] [INFO ] Redundant transitions in 7 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-27 22:20:17] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:20:17] [INFO ] Invariant cache hit.
[2024-05-27 22:20:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 148 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:20:22] [INFO ] Deduced a trap composed of 183 places in 173 ms of which 2 ms to minimize.
[2024-05-27 22:20:23] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:20:23] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:20:23] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:20:23] [INFO ] Deduced a trap composed of 45 places in 24 ms of which 1 ms to minimize.
[2024-05-27 22:20:23] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:20:24] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
[2024-05-27 22:20:24] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:20:26] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-27 22:20:26] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:20:27] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:20:28] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:20:29] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:31] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:40] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:44] [INFO ] Deduced a trap composed of 154 places in 123 ms of which 2 ms to minimize.
[2024-05-27 22:20:44] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 2 ms to minimize.
[2024-05-27 22:20:47] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 64 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:53] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:20:53] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 210 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:20:57] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:21:00] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-05-27 22:21:01] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:21:08] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 71 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 31/31 constraints]
After SMT, in 61036ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 61048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65322 ms. Remains : 354/354 places, 758/758 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[26]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00 in 237709 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-27 22:21:18] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-27 22:21:18] [INFO ] Computed 42 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (5 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 22:21:18] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:21:18] [INFO ] Invariant cache hit.
[2024-05-27 22:21:18] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 22:21:18] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-27 22:21:18] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-27 22:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:21:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 22:21:18] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-27 22:21:18] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-27 22:21:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:21:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 239 ms returned sat
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 2 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-27 22:21:19] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 47 ms.
[2024-05-27 22:21:21] [INFO ] Added : 65 causal constraints over 14 iterations in 2014 ms. Result :sat
Minimization took 592 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 360 transition count 764
Applied a total of 12 rules in 17 ms. Remains 360 /366 variables (removed 6) and now considering 764/770 (removed 6) transitions.
Running 762 sub problems to find dead transitions.
[2024-05-27 22:21:22] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
// Phase 1: matrix 752 rows 360 cols
[2024-05-27 22:21:22] [INFO ] Computed 42 invariants in 10 ms
[2024-05-27 22:21:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:21:26] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-05-27 22:21:26] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-27 22:21:26] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:21:26] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:21:27] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
[2024-05-27 22:21:27] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:21:27] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-05-27 22:21:27] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 2 ms to minimize.
[2024-05-27 22:21:28] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:21:29] [INFO ] Deduced a trap composed of 219 places in 123 ms of which 2 ms to minimize.
[2024-05-27 22:21:30] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 3 ms to minimize.
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 4 ms to minimize.
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:21:34] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:21:34] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 762 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 358/1112 variables, and 58 constraints, problems are : Problem set: 0 solved, 762 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 762/762 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 762 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:21:44] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:21:44] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:21:56] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:21:56] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1112 variables, and 62 constraints, problems are : Problem set: 0 solved, 762 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/762 constraints, Known Traps: 22/22 constraints]
After SMT, in 41023ms problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 41032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41051 ms. Remains : 360/366 places, 764/770 transitions.
[2024-05-27 22:22:03] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-27 22:22:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (501 resets) in 2778 ms. (359 steps per ms)
BEST_FIRST walk for 1000001 steps (242 resets) in 1244 ms. (803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 22:22:07] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-27 22:22:07] [INFO ] Invariant cache hit.
[2024-05-27 22:22:07] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-27 22:22:07] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 12 ms returned sat
[2024-05-27 22:22:07] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-27 22:22:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:22:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-27 22:22:07] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-27 22:22:08] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-05-27 22:22:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:22:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 257 ms returned sat
[2024-05-27 22:22:08] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 2 ms to minimize.
[2024-05-27 22:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-27 22:22:08] [INFO ] Computed and/alt/rep : 462/2289/456 causal constraints (skipped 294 transitions) in 45 ms.
[2024-05-27 22:22:10] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 3 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1532 ms
[2024-05-27 22:22:11] [INFO ] Added : 95 causal constraints over 19 iterations in 2969 ms. Result :sat
Minimization took 2644 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 360/360 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 33 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-27 22:22:15] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-27 22:22:15] [INFO ] Invariant cache hit.
[2024-05-27 22:22:15] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-27 22:22:15] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-27 22:22:15] [INFO ] Invariant cache hit.
[2024-05-27 22:22:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:22:19] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned []
Implicit Place search using SMT with State Equation took 4022 ms to find 0 implicit places.
[2024-05-27 22:22:19] [INFO ] Redundant transitions in 4 ms returned []
Running 762 sub problems to find dead transitions.
[2024-05-27 22:22:19] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-27 22:22:19] [INFO ] Invariant cache hit.
[2024-05-27 22:22:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:22:23] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:22:23] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:22:23] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:22:24] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:22:24] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-27 22:22:24] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:22:25] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:22:25] [INFO ] Deduced a trap composed of 224 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:22:26] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:22:28] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:22:28] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:22:28] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:22:29] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:22:29] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 2 ms to minimize.
[2024-05-27 22:22:29] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:22:29] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:22:30] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-27 22:22:31] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:22:35] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/360 variables, 2/65 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-27 22:22:46] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1112 variables, and 66 constraints, problems are : Problem set: 30 solved, 732 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 762/762 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 30 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 23/63 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-27 22:22:51] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:22:53] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-27 22:22:53] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/66 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-27 22:22:57] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:23:02] [INFO ] Deduced a trap composed of 175 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:23:02] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:23:03] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:23:03] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 5/71 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-27 22:23:10] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/72 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/72 constraints. Problems are: Problem set: 30 solved, 732 unsolved
SMT process timed out in 60874ms, After SMT, problems are : Problem set: 30 solved, 732 unsolved
Search for dead transitions found 30 dead transitions in 60882ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/360 places, 734/764 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 722
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 346 transition count 710
Applied a total of 14 rules in 23 ms. Remains 346 /360 variables (removed 14) and now considering 710/734 (removed 24) transitions.
[2024-05-27 22:23:20] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
// Phase 1: matrix 698 rows 346 cols
[2024-05-27 22:23:20] [INFO ] Computed 42 invariants in 8 ms
[2024-05-27 22:23:20] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-27 22:23:20] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-27 22:23:20] [INFO ] Invariant cache hit.
[2024-05-27 22:23:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:23:23] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 346/360 places, 710/764 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68043 ms. Remains : 346/360 places, 710/764 transitions.
[2024-05-27 22:23:23] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-27 22:23:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[12]
RANDOM walk for 1000000 steps (494 resets) in 2405 ms. (415 steps per ms)
BEST_FIRST walk for 1000000 steps (193 resets) in 1422 ms. (702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[12]
[2024-05-27 22:23:26] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-27 22:23:26] [INFO ] Invariant cache hit.
[2024-05-27 22:23:26] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 22:23:26] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01 in 128682 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12
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:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-05-27 22:23:27] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-27 22:23:27] [INFO ] Computed 42 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (5 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-27 22:23:27] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-27 22:23:27] [INFO ] Invariant cache hit.
[2024-05-27 22:23:27] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 22:23:27] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-27 22:23:27] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2024-05-27 22:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:23:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 22:23:27] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 22:23:28] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-27 22:23:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:23:28] [INFO ] [Nat]Added 72 Read/Feed constraints in 258 ms returned sat
[2024-05-27 22:23:28] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 56 ms.
[2024-05-27 22:23:29] [INFO ] Added : 64 causal constraints over 13 iterations in 821 ms. Result :sat
Minimization took 598 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 34 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-27 22:23:29] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-05-27 22:23:29] [INFO ] Computed 42 invariants in 18 ms
[2024-05-27 22:23:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:23:34] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:23:35] [INFO ] Deduced a trap composed of 132 places in 246 ms of which 2 ms to minimize.
[2024-05-27 22:23:35] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:23:35] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:23:35] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:23:35] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:23:36] [INFO ] Deduced a trap composed of 156 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:23:37] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:23:37] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:23:37] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:23:38] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2024-05-27 22:23:38] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:23:38] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:23:39] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-05-27 22:23:40] [INFO ] Deduced a trap composed of 210 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:23:42] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 1 ms to minimize.
[2024-05-27 22:23:42] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:23:42] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:23:48] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:23:53] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1100 variables, and 71 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 30/30 constraints]
After SMT, in 41092ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41139 ms. Remains : 354/366 places, 758/770 transitions.
[2024-05-27 22:24:10] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:24:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (587 resets) in 2845 ms. (351 steps per ms)
BEST_FIRST walk for 1000000 steps (237 resets) in 1732 ms. (577 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-27 22:24:15] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:24:15] [INFO ] Invariant cache hit.
[2024-05-27 22:24:15] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-27 22:24:15] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 11 ms returned sat
[2024-05-27 22:24:15] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-27 22:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:24:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 22:24:15] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-27 22:24:16] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2024-05-27 22:24:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:24:17] [INFO ] [Nat]Added 72 Read/Feed constraints in 523 ms returned sat
[2024-05-27 22:24:17] [INFO ] Computed and/alt/rep : 456/2283/450 causal constraints (skipped 294 transitions) in 67 ms.
[2024-05-27 22:24:18] [INFO ] Added : 98 causal constraints over 20 iterations in 1733 ms. Result :sat
Minimization took 1716 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-27 22:24:20] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:24:20] [INFO ] Invariant cache hit.
[2024-05-27 22:24:21] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-27 22:24:21] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:24:21] [INFO ] Invariant cache hit.
[2024-05-27 22:24:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:24:24] [INFO ] Implicit Places using invariants and state equation in 3529 ms returned []
Implicit Place search using SMT with State Equation took 3878 ms to find 0 implicit places.
[2024-05-27 22:24:24] [INFO ] Redundant transitions in 9 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-27 22:24:24] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-27 22:24:24] [INFO ] Invariant cache hit.
[2024-05-27 22:24:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:24:30] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 2 ms to minimize.
[2024-05-27 22:24:31] [INFO ] Deduced a trap composed of 213 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:24:32] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:24:33] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:24:33] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:24:34] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:24:34] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 2 ms to minimize.
[2024-05-27 22:24:35] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:24:36] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:24:39] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:24:40] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:24:40] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:24:48] [INFO ] Deduced a trap composed of 154 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1100 variables, and 60 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-27 22:24:58] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2024-05-27 22:24:58] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:24:58] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:24:59] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 2 ms to minimize.
[2024-05-27 22:24:59] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 2 ms to minimize.
[2024-05-27 22:24:59] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:24:59] [INFO ] Deduced a trap composed of 158 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:24:59] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 1 ms to minimize.
[2024-05-27 22:25:00] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:25:00] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:25:02] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-05-27 22:25:02] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/73 constraints. Problems are: Problem set: 30 solved, 726 unsolved
[2024-05-27 22:25:15] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 2 ms to minimize.
[2024-05-27 22:25:19] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:25:19] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/76 constraints. Problems are: Problem set: 30 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/1100 variables, and 76 constraints, problems are : Problem set: 30 solved, 726 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 34/34 constraints]
After SMT, in 61121ms problems are : Problem set: 30 solved, 726 unsolved
Search for dead transitions found 30 dead transitions in 61143ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/354 places, 728/758 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 716
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 340 transition count 704
Applied a total of 14 rules in 19 ms. Remains 340 /354 variables (removed 14) and now considering 704/728 (removed 24) transitions.
[2024-05-27 22:25:26] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 340 cols
[2024-05-27 22:25:26] [INFO ] Computed 42 invariants in 7 ms
[2024-05-27 22:25:26] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-27 22:25:26] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-27 22:25:26] [INFO ] Invariant cache hit.
[2024-05-27 22:25:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:25:29] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/354 places, 704/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68077 ms. Remains : 340/354 places, 704/758 transitions.
[2024-05-27 22:25:29] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-27 22:25:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (554 resets) in 2728 ms. (366 steps per ms)
BEST_FIRST walk for 1000001 steps (239 resets) in 1430 ms. (698 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-27 22:25:33] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-27 22:25:33] [INFO ] Invariant cache hit.
[2024-05-27 22:25:33] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 22:25:33] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12 in 126289 ms.
[2024-05-27 22:25:33] [INFO ] Flatten gal took : 145 ms
[2024-05-27 22:25:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-27 22:25:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 366 places, 770 transitions and 3712 arcs took 20 ms.
Total runtime 825306 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 366
TRANSITIONS: 770
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 2184
MODEL NAME: /home/mcc/execution/415/model
366 places, 770 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716848781785

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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