Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K 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 PolyORBNT-COL-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717257952089

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:05:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:05:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:05:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:05:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:05:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2024-06-01 16:05:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-06-01 16:05:54] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 3 ms.
[2024-06-01 16:05:54] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:05:54] [INFO ] Computed 13 invariants in 17 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 10, 5, 0, 0, 1] Max Struct:[+inf, +inf, 1, 61, 4, +inf, 4, 5, +inf, 10, +inf, +inf, 5, +inf, 1, +inf]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 16:05:54] [INFO ] Invariant cache hit.
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:05:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:05:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:05:54] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 9 ms to minimize.
[2024-06-01 16:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-06-01 16:05:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 16:05:54] [INFO ] Added : 20 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:05:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 16:05:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:05:55] [INFO ] Added : 20 causal constraints over 4 iterations in 180 ms. Result :sat
Minimization took 67 ms.
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned unsat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 16:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-01 16:05:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:05:55] [INFO ] Added : 22 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 72 ms.
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:05:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:05:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-06-01 16:05:55] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 101 ms.
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 16:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 16:05:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 16:05:56] [INFO ] Added : 36 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:05:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-06-01 16:05:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:05:57] [INFO ] Added : 15 causal constraints over 3 iterations in 558 ms. Result :sat
Minimization took 105 ms.
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:05:57] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:05:57] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 162 ms
[2024-06-01 16:05:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:05:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-06-01 16:05:57] [INFO ] Added : 36 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 16:05:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:05:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, 4, 1, 4, 5, +inf, 10, +inf, 10, +inf, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:05:58] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 171 ms.
[2024-06-01 16:05:58] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 32 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
[2024-06-01 16:05:58] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-06-01 16:05:58] [INFO ] Computed 142 invariants in 116 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 61, 4, 4, 5, 244, 10, 11, 61, 1]
RANDOM walk for 10000 steps (703 resets) in 330 ms. (30 steps per ms)
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (1256 resets) in 485 ms. (164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[11, 61, 4, 5, 244, 10, 11, 61]
[2024-06-01 16:05:59] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:05:59] [INFO ] Invariant cache hit.
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive place invariants in 28 ms returned sat
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 11 ms returned unsat
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned unsat
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2024-06-01 16:05:59] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2024-06-01 16:06:00] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2024-06-01 16:06:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:06:00] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2024-06-01 16:06:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2024-06-01 16:06:00] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-06-01 16:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:06:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2024-06-01 16:06:01] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 149 ms.
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 507 places in 482 ms of which 14 ms to minimize.
[2024-06-01 16:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 778 ms
[2024-06-01 16:06:02] [INFO ] Added : 19 causal constraints over 4 iterations in 1520 ms. Result :sat
Minimization took 670 ms.
[2024-06-01 16:06:03] [INFO ] [Real]Absence check using 135 positive place invariants in 72 ms returned sat
[2024-06-01 16:06:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2024-06-01 16:06:03] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-06-01 16:06:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:06:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-06-01 16:06:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:06:05] [INFO ] [Nat]Absence check using state equation in 1101 ms returned sat
[2024-06-01 16:06:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2024-06-01 16:06:05] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 197 ms.
[2024-06-01 16:06:06] [INFO ] Added : 5 causal constraints over 1 iterations in 1008 ms. Result :sat
Minimization took 552 ms.
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 38 ms returned unsat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned unsat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-06-01 16:06:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[1, 1, 4, 5, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[4, 5]
Support contains 306 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 365 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-06-01 16:06:08] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-06-01 16:06:08] [INFO ] Computed 137 invariants in 70 ms
[2024-06-01 16:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 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 1.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 (/ 2.0 3.0))
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 (/ 1.0 3.0))
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 (/ 1.0 3.0))
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 (/ 2.0 3.0))
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.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 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.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.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:06:46] [INFO ] Deduced a trap composed of 285 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:06:46] [INFO ] Deduced a trap composed of 188 places in 305 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 43548ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43981 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-06-01 16:06:51] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:06:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[4, 5]
RANDOM walk for 1000000 steps (52027 resets) in 10136 ms. (98 steps per ms)
BEST_FIRST walk for 1848051 steps (6334 resets) in 6615 ms. (279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[4, 5]
[2024-06-01 16:07:08] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:08] [INFO ] Invariant cache hit.
[2024-06-01 16:07:08] [INFO ] [Real]Absence check using 130 positive place invariants in 42 ms returned sat
[2024-06-01 16:07:08] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2024-06-01 16:07:09] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-06-01 16:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:07:09] [INFO ] [Nat]Absence check using 130 positive place invariants in 32 ms returned sat
[2024-06-01 16:07:09] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-06-01 16:07:09] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-06-01 16:07:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:07:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 76 ms returned sat
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 168 places in 394 ms of which 6 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 537 ms
[2024-06-01 16:07:10] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 113 ms.
[2024-06-01 16:07:11] [INFO ] Added : 11 causal constraints over 3 iterations in 662 ms. Result :sat
Minimization took 2025 ms.
[2024-06-01 16:07:13] [INFO ] [Real]Absence check using 130 positive place invariants in 29 ms returned sat
[2024-06-01 16:07:13] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:07:13] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-06-01 16:07:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:07:13] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2024-06-01 16:07:13] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 11 ms returned sat
[2024-06-01 16:07:16] [INFO ] [Nat]Absence check using state equation in 2977 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[4, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 59 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 770/770 places, 1181/1181 transitions.
[2024-06-01 16:07:17] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51939 resets) in 6160 ms. (162 steps per ms)
BEST_FIRST walk for 1000001 steps (3374 resets) in 1409 ms. (709 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:07:24] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:24] [INFO ] Invariant cache hit.
[2024-06-01 16:07:24] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-06-01 16:07:24] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2024-06-01 16:07:25] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2024-06-01 16:07:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:07:25] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-06-01 16:07:25] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-06-01 16:07:25] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 16:07:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:07:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 79 ms returned sat
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 168 places in 386 ms of which 6 ms to minimize.
[2024-06-01 16:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2024-06-01 16:07:26] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 140 ms.
[2024-06-01 16:07:27] [INFO ] Added : 11 causal constraints over 3 iterations in 745 ms. Result :sat
Minimization took 1960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 72 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 53 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-06-01 16:07:29] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:29] [INFO ] Invariant cache hit.
[2024-06-01 16:07:30] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2024-06-01 16:07:30] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:30] [INFO ] Invariant cache hit.
[2024-06-01 16:07:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:07:36] [INFO ] Implicit Places using invariants and state equation in 6395 ms returned []
Implicit Place search using SMT with State Equation took 7507 ms to find 0 implicit places.
[2024-06-01 16:07:36] [INFO ] Redundant transitions in 103 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-06-01 16:07:37] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:07:37] [INFO ] Invariant cache hit.
[2024-06-01 16:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 4 (OVERLAPS) 4/769 variables, 4/137 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 4)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 9)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 1)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 1)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 4)
(s695 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1947 variables, and 137 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 63265ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 63281ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-06-01 16:08:40] [INFO ] Redundant transitions in 33 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71055 ms. Remains : 770/770 places, 1103/1181 transitions.
[2024-06-01 16:08:40] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-06-01 16:08:40] [INFO ] Computed 137 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52035 resets) in 5234 ms. (191 steps per ms)
BEST_FIRST walk for 1000001 steps (3426 resets) in 1212 ms. (824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:08:46] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:46] [INFO ] Invariant cache hit.
[2024-06-01 16:08:46] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-06-01 16:08:46] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-06-01 16:08:47] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-06-01 16:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:08:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 22 ms returned sat
[2024-06-01 16:08:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:08:47] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-06-01 16:08:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:08:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 74 ms returned sat
[2024-06-01 16:08:48] [INFO ] Deduced a trap composed of 156 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:08:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2024-06-01 16:08:48] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 89 ms.
[2024-06-01 16:08:48] [INFO ] Added : 5 causal constraints over 1 iterations in 406 ms. Result :sat
Minimization took 1188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 60 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 42 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-06-01 16:08:50] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:50] [INFO ] Invariant cache hit.
[2024-06-01 16:08:51] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-06-01 16:08:51] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:51] [INFO ] Invariant cache hit.
[2024-06-01 16:08:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:08:57] [INFO ] Implicit Places using invariants and state equation in 6287 ms returned []
Implicit Place search using SMT with State Equation took 7188 ms to find 0 implicit places.
[2024-06-01 16:08:57] [INFO ] Redundant transitions in 33 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:08:57] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:57] [INFO ] Invariant cache hit.
[2024-06-01 16:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 196 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 196 places in 428 ms of which 7 ms to minimize.
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 16 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 196 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 196 places in 388 ms of which 4 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 242 places in 407 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 245 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 251 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:09:19] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:09:19] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:09:19] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:09:20] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:09:20] [INFO ] Deduced a trap composed of 260 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:09:20] [INFO ] Deduced a trap composed of 236 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 6 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 10 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:34] [INFO ] Deduced a trap composed of 200 places in 340 ms of which 6 ms to minimize.
[2024-06-01 16:09:35] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:09:35] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:09:35] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:09:36] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:09:36] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 3 ms to minimize.
[2024-06-01 16:09:36] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:09:36] [INFO ] Deduced a trap composed of 200 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:09:37] [INFO ] Deduced a trap composed of 196 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:09:37] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:09:37] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:09:37] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:09:38] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 6 ms to minimize.
[2024-06-01 16:09:38] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:09:38] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:09:39] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:09:39] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:09:39] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:09:39] [INFO ] Deduced a trap composed of 200 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:09:40] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 345 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 335 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 239 places in 285 ms of which 6 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 245 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 248 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 258 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 239 places in 318 ms of which 6 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 248 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 306 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 251 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:09:49] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:09:49] [INFO ] Deduced a trap composed of 251 places in 328 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:54] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:09:55] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:09:55] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:09:55] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:09:55] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:09:56] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:09:56] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:09:56] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:09:56] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:09:57] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 6 ms to minimize.
[2024-06-01 16:09:57] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:09:57] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:09:58] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62971ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70265 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2077 resets) in 1076 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 282612 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 282612 steps, saw 85923 distinct states, run finished after 3004 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 16:10:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:04] [INFO ] Invariant cache hit.
[2024-06-01 16:10:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2317ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 36 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:10:06] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:06] [INFO ] Invariant cache hit.
[2024-06-01 16:10:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 245 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 233 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:10:21] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:10:21] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:10:22] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:10:22] [INFO ] Deduced a trap composed of 245 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:10:22] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 254 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 242 places in 361 ms of which 10 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 6 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 242 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 254 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 245 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 248 places in 323 ms of which 6 ms to minimize.
[2024-06-01 16:10:28] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:10:28] [INFO ] Deduced a trap composed of 251 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:10:29] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:10:29] [INFO ] Deduced a trap composed of 233 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 23046ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23111 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2033 resets) in 597 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (125 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (149 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 256393 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 256393 steps, saw 77943 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 16:10:32] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:32] [INFO ] Invariant cache hit.
[2024-06-01 16:10:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 56 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 41 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-06-01 16:10:34] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:34] [INFO ] Invariant cache hit.
[2024-06-01 16:10:35] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-06-01 16:10:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:35] [INFO ] Invariant cache hit.
[2024-06-01 16:10:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:10:42] [INFO ] Implicit Places using invariants and state equation in 6841 ms returned []
Implicit Place search using SMT with State Equation took 7825 ms to find 0 implicit places.
[2024-06-01 16:10:42] [INFO ] Redundant transitions in 8 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:10:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:10:42] [INFO ] Invariant cache hit.
[2024-06-01 16:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 245 places in 321 ms of which 7 ms to minimize.
[2024-06-01 16:10:56] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:10:56] [INFO ] Deduced a trap composed of 233 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:10:56] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 5 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:10:59] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:10:59] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:10:59] [INFO ] Deduced a trap composed of 254 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:11:00] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:11:00] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:11:00] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 5 ms to minimize.
[2024-06-01 16:11:01] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:11:01] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:11:01] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:11:02] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:11:02] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:11:02] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:11:03] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:11:03] [INFO ] Deduced a trap composed of 251 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:11:03] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:11:04] [INFO ] Deduced a trap composed of 233 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:11:04] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 5 ms to minimize.
[2024-06-01 16:11:04] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:11:05] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:11:05] [INFO ] Deduced a trap composed of 260 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:11:05] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:11:05] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:11:06] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:11:06] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:11:06] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:11:06] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 5 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 200 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 200 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:11:24] [INFO ] Deduced a trap composed of 200 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:11:24] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:11:27] [INFO ] Deduced a trap composed of 345 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:11:27] [INFO ] Deduced a trap composed of 335 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:11:28] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:11:28] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:11:28] [INFO ] Deduced a trap composed of 246 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:11:29] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 5 ms to minimize.
[2024-06-01 16:11:29] [INFO ] Deduced a trap composed of 248 places in 277 ms of which 6 ms to minimize.
[2024-06-01 16:11:29] [INFO ] Deduced a trap composed of 258 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 239 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 242 places in 308 ms of which 6 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 248 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 306 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 251 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 5 ms to minimize.
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 234 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 251 places in 330 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:11:38] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:11:38] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 6 ms to minimize.
[2024-06-01 16:11:39] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:11:39] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:11:39] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:11:39] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:11:40] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:11:40] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:11:40] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:11:41] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:11:41] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 5 ms to minimize.
[2024-06-01 16:11:41] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:11:41] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62841ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70738 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-06-01 16:11:45] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:11:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (529 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:11:45] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:11:45] [INFO ] Invariant cache hit.
[2024-06-01 16:11:45] [INFO ] [Real]Absence check using 130 positive place invariants in 20 ms returned sat
[2024-06-01 16:11:45] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:11:45] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-01 16:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:11:46] [INFO ] [Nat]Absence check using 130 positive place invariants in 20 ms returned sat
[2024-06-01 16:11:46] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:11:46] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 16:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:11:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 88 ms returned sat
[2024-06-01 16:11:46] [INFO ] Deduced a trap composed of 156 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2024-06-01 16:11:47] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 73 ms.
[2024-06-01 16:11:47] [INFO ] Added : 5 causal constraints over 1 iterations in 520 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:11:48] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:11:48] [INFO ] Invariant cache hit.
[2024-06-01 16:11:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 245 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 254 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:12:05] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:12:05] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:12:05] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:12:06] [INFO ] Deduced a trap composed of 254 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:12:06] [INFO ] Deduced a trap composed of 245 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:12:06] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:12:07] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:12:07] [INFO ] Deduced a trap composed of 251 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:12:07] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:12:07] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:12:08] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:12:08] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:12:08] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:12:09] [INFO ] Deduced a trap composed of 260 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:12:09] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:12:09] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:12:09] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:12:10] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:12:10] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:12:10] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:12:10] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:12:11] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:12:11] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
SMT process timed out in 23016ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23076 ms. Remains : 770/770 places, 1103/1103 transitions.
[2024-06-01 16:12:11] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:12:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52080 resets) in 4849 ms. (206 steps per ms)
BEST_FIRST walk for 1000001 steps (3325 resets) in 1488 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:12:17] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:12:17] [INFO ] Invariant cache hit.
[2024-06-01 16:12:17] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-06-01 16:12:17] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-06-01 16:12:18] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2024-06-01 16:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:18] [INFO ] [Nat]Absence check using 130 positive place invariants in 32 ms returned sat
[2024-06-01 16:12:18] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2024-06-01 16:12:19] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-06-01 16:12:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:12:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 85 ms returned sat
[2024-06-01 16:12:19] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:12:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2024-06-01 16:12:19] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 100 ms.
[2024-06-01 16:12:20] [INFO ] Added : 5 causal constraints over 1 iterations in 561 ms. Result :sat
Minimization took 1268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 50 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-06-01 16:12:21] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:12:21] [INFO ] Invariant cache hit.
[2024-06-01 16:12:22] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-06-01 16:12:22] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:12:22] [INFO ] Invariant cache hit.
[2024-06-01 16:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:12:29] [INFO ] Implicit Places using invariants and state equation in 7029 ms returned []
Implicit Place search using SMT with State Equation took 7913 ms to find 0 implicit places.
[2024-06-01 16:12:29] [INFO ] Redundant transitions in 20 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:12:29] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:12:29] [INFO ] Invariant cache hit.
[2024-06-01 16:12:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:12:42] [INFO ] Deduced a trap composed of 245 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:12:42] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:12:42] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:12:45] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:12:45] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:12:45] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:12:46] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:12:46] [INFO ] Deduced a trap composed of 254 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:12:46] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:12:46] [INFO ] Deduced a trap composed of 196 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:12:47] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:12:47] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:12:47] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 254 places in 186 ms of which 4 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 248 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 251 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 230 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 260 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:12:54] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:13:06] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:13:06] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:13:06] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:13:07] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:13:07] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:13:07] [INFO ] Deduced a trap composed of 200 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:13:07] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:13:08] [INFO ] Deduced a trap composed of 200 places in 329 ms of which 6 ms to minimize.
[2024-06-01 16:13:08] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:13:08] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 200 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:13:14] [INFO ] Deduced a trap composed of 345 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:13:14] [INFO ] Deduced a trap composed of 335 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:13:14] [INFO ] Deduced a trap composed of 246 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 246 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 5 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 258 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 239 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:13:17] [INFO ] Deduced a trap composed of 306 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:13:17] [INFO ] Deduced a trap composed of 236 places in 347 ms of which 6 ms to minimize.
[2024-06-01 16:13:17] [INFO ] Deduced a trap composed of 242 places in 301 ms of which 6 ms to minimize.
[2024-06-01 16:13:18] [INFO ] Deduced a trap composed of 251 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:13:18] [INFO ] Deduced a trap composed of 248 places in 347 ms of which 6 ms to minimize.
[2024-06-01 16:13:18] [INFO ] Deduced a trap composed of 236 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:13:19] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:13:19] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:13:19] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:13:24] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:13:25] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:13:25] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2024-06-01 16:13:25] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:13:25] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:13:26] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:13:26] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:13:26] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:13:28] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62533ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70531 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2114 resets) in 366 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (144 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (136 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 258207 steps, run timeout after 3012 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 258207 steps, saw 78486 distinct states, run finished after 3012 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 16:13:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:13:35] [INFO ] Invariant cache hit.
[2024-06-01 16:13:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1887ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:13:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:13:37] [INFO ] Invariant cache hit.
[2024-06-01 16:13:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:13:49] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:13:49] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:13:49] [INFO ] Deduced a trap composed of 233 places in 423 ms of which 4 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 3 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:13:51] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 6 ms to minimize.
[2024-06-01 16:13:51] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:13:51] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 254 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 245 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 251 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 236 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 5 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 260 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
SMT process timed out in 22777ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22823 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2049 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (146 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 265424 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 265424 steps, saw 80702 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 16:14:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:14:03] [INFO ] Invariant cache hit.
[2024-06-01 16:14:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1321 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2020ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-06-01 16:14:05] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:14:05] [INFO ] Invariant cache hit.
[2024-06-01 16:14:06] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-06-01 16:14:06] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:14:06] [INFO ] Invariant cache hit.
[2024-06-01 16:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:14:13] [INFO ] Implicit Places using invariants and state equation in 6841 ms returned []
Implicit Place search using SMT with State Equation took 7881 ms to find 0 implicit places.
[2024-06-01 16:14:13] [INFO ] Redundant transitions in 8 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:14:13] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:14:13] [INFO ] Invariant cache hit.
[2024-06-01 16:14:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:14:27] [INFO ] Deduced a trap composed of 245 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:14:27] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 233 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 254 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:14:34] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 5 ms to minimize.
[2024-06-01 16:14:34] [INFO ] Deduced a trap composed of 245 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 248 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 251 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 230 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 260 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:14:40] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:14:51] [INFO ] Deduced a trap composed of 200 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:14:51] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:14:52] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:14:52] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:14:52] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 200 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 200 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:14:57] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 345 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 335 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 246 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 239 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 246 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 5 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 258 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 248 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 306 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:15:05] [INFO ] Deduced a trap composed of 251 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 6 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:15:12] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:15:12] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:15:12] [INFO ] Deduced a trap composed of 196 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:15:13] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:15:13] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 63355ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71302 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06 in 211214 ms.
[2024-06-01 16:15:17] [INFO ] Flatten gal took : 188 ms
[2024-06-01 16:15:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 16:15:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1103 transitions and 5634 arcs took 12 ms.
Total runtime 563687 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S05J60-UpperBounds-06

BK_STOP 1717258517296

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-COL-S05J60-UpperBounds-06
ub formula formula --maxsum=/tmp/2317/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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