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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717249206589

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:40:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:40:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:40:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:40:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 723 ms
[2024-06-01 13:40:09] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-06-01 13:40:09] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:40:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:40:09] [INFO ] Computed 26 invariants in 22 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 1, 1, 8, 1, 8, 11, 2, 28, 20, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 13:40:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:40:09] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 13:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 13:40:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 13:40:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:40:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 13:40:09] [INFO ] Added : 44 causal constraints over 10 iterations in 107 ms. Result :sat
Minimization took 49 ms.
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-06-01 13:40:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 13:40:10] [INFO ] Added : 54 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:40:10] [INFO ] Added : 10 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:40:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:40:10] [INFO ] Added : 54 causal constraints over 11 iterations in 73 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:40:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 10 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-06-01 13:40:10] [INFO ] Added : 58 causal constraints over 12 iterations in 235 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-01 13:40:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2024-06-01 13:40:11] [INFO ] Added : 54 causal constraints over 11 iterations in 224 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-01 13:40:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:40:11] [INFO ] Added : 29 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:40:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:40:11] [INFO ] Added : 25 causal constraints over 6 iterations in 42 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:40:12] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:40:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:40:12] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:40:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-06-01 13:40:12] [INFO ] Added : 49 causal constraints over 12 iterations in 158 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:40:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 13:40:12] [INFO ] Added : 45 causal constraints over 9 iterations in 54 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 13:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:40:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-01 13:40:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-01 13:40:13] [INFO ] Added : 58 causal constraints over 12 iterations in 179 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 10, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:40:13] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 42 ms.
[2024-06-01 13:40:13] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
[2024-06-01 13:40:13] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 13:40:13] [INFO ] Computed 54 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
RANDOM walk for 10000 steps (4 resets) in 103 ms. (96 steps per ms)
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (19 resets) in 312 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 8, 11, 2, 28, 4, 2]
[2024-06-01 13:40:13] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:40:13] [INFO ] Invariant cache hit.
[2024-06-01 13:40:13] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 13:40:13] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned sat
[2024-06-01 13:40:14] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-06-01 13:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 13:40:14] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned sat
[2024-06-01 13:40:15] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2024-06-01 13:40:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:40:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:40:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 666 ms returned sat
[2024-06-01 13:40:16] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 6 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 387 places in 448 ms of which 8 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1490 ms
[2024-06-01 13:40:17] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 149 ms.
[2024-06-01 13:40:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 13:40:19] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 13:40:19] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 25 ms returned sat
[2024-06-01 13:40:20] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 13:40:20] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned sat
[2024-06-01 13:40:20] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-06-01 13:40:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:40:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 1018 ms returned unknown
[2024-06-01 13:40:21] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 25 ms returned unsat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 11 ms returned unsat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive place invariants in 29 ms returned sat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 39 ms returned unsat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 13:40:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 32 ms returned sat
[2024-06-01 13:40:23] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-06-01 13:40:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 13:40:23] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned sat
[2024-06-01 13:40:24] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2024-06-01 13:40:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:40:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 690 ms returned sat
[2024-06-01 13:40:25] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 143 ms.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 385 places in 624 ms of which 6 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 766 ms
[2024-06-01 13:40:27] [INFO ] Added : 79 causal constraints over 16 iterations in 2920 ms. Result :sat
Minimization took 496 ms.
[2024-06-01 13:40:28] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-06-01 13:40:28] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2024-06-01 13:40:29] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2024-06-01 13:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:40:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 13:40:29] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned sat
[2024-06-01 13:40:30] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2024-06-01 13:40:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:40:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 626 ms returned sat
[2024-06-01 13:40:31] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 130 ms.
[2024-06-01 13:40:32] [INFO ] Added : 68 causal constraints over 14 iterations in 1784 ms. Result :sat
Minimization took 641 ms.
[2024-06-01 13:40:33] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 13:40:33] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 1, 10, 1, 28, 4, 1]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 688 transition count 1242
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 138 place count 624 transition count 1234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 442 place count 472 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 257 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:40:34] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2024-06-01 13:40:34] [INFO ] Computed 52 invariants in 26 ms
[2024-06-01 13:40:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:40:47] [INFO ] Deduced a trap composed of 165 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 172 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 195 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 185 places in 436 ms of which 3 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 2 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 179 places in 354 ms of which 7 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 165 places in 443 ms of which 4 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1530 variables, and 66 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:41:05] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:41:05] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 4 ms to minimize.
[2024-06-01 13:41:14] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 169 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:41:15] [INFO ] Deduced a trap composed of 190 places in 235 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1530 variables, and 71 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 21/21 constraints]
After SMT, in 42860ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43206 ms. Remains : 464/690 places, 1082/1306 transitions.
[2024-06-01 13:41:16] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:41:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (414 resets) in 4229 ms. (236 steps per ms)
BEST_FIRST walk for 4000003 steps (672 resets) in 8228 ms. (486 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-06-01 13:41:29] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:41:29] [INFO ] Invariant cache hit.
[2024-06-01 13:41:29] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2024-06-01 13:41:29] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 32 ms returned sat
[2024-06-01 13:41:30] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2024-06-01 13:41:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:41:30] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 18 ms returned sat
[2024-06-01 13:41:30] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-06-01 13:41:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:41:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 693 ms returned sat
[2024-06-01 13:41:31] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 78 ms.
[2024-06-01 13:41:32] [INFO ] Added : 63 causal constraints over 13 iterations in 1489 ms. Result :sat
Minimization took 4186 ms.
[2024-06-01 13:41:37] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:41:37] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 20 ms returned sat
[2024-06-01 13:41:37] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-06-01 13:41:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:41:38] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 23 ms returned sat
[2024-06-01 13:41:38] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-06-01 13:41:39] [INFO ] [Nat]Added 96 Read/Feed constraints in 635 ms returned sat
[2024-06-01 13:41:39] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2024-06-01 13:41:40] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 93 ms.
[2024-06-01 13:41:41] [INFO ] Added : 36 causal constraints over 8 iterations in 1650 ms. Result :sat
Minimization took 3775 ms.
[2024-06-01 13:41:45] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 13:41:45] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 30 ms returned sat
[2024-06-01 13:41:46] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 13:41:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 13:41:46] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 13 ms returned sat
[2024-06-01 13:41:46] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-06-01 13:41:46] [INFO ] [Nat]Added 96 Read/Feed constraints in 412 ms returned sat
[2024-06-01 13:41:46] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 115 ms.
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 185 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 930 ms
[2024-06-01 13:41:48] [INFO ] Added : 42 causal constraints over 10 iterations in 1805 ms. Result :sat
Minimization took 4513 ms.
[2024-06-01 13:41:53] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:41:53] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 41 ms returned sat
[2024-06-01 13:41:53] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-06-01 13:41:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 13:41:53] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 34 ms returned sat
[2024-06-01 13:41:54] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-06-01 13:41:55] [INFO ] [Nat]Added 96 Read/Feed constraints in 972 ms returned sat
[2024-06-01 13:41:55] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 108 ms.
[2024-06-01 13:41:56] [INFO ] Added : 29 causal constraints over 6 iterations in 1076 ms. Result :sat
Minimization took 4532 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 39 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 464/464 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 62 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2024-06-01 13:42:02] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:42:02] [INFO ] Invariant cache hit.
[2024-06-01 13:42:02] [INFO ] Implicit Places using invariants in 543 ms returned [418, 419, 420, 421, 422, 423, 424, 425]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 560 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/464 places, 1082/1082 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 1074
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 1074
Applied a total of 16 rules in 49 ms. Remains 448 /456 variables (removed 8) and now considering 1074/1082 (removed 8) transitions.
[2024-06-01 13:42:02] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-06-01 13:42:02] [INFO ] Computed 44 invariants in 40 ms
[2024-06-01 13:42:03] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-06-01 13:42:03] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:42:03] [INFO ] Invariant cache hit.
[2024-06-01 13:42:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:42:11] [INFO ] Implicit Places using invariants and state equation in 7867 ms returned []
Implicit Place search using SMT with State Equation took 8421 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/464 places, 1074/1082 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9094 ms. Remains : 448/464 places, 1074/1082 transitions.
[2024-06-01 13:42:11] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:42:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (407 resets) in 3855 ms. (259 steps per ms)
BEST_FIRST walk for 4000004 steps (670 resets) in 7578 ms. (527 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-06-01 13:42:22] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:42:22] [INFO ] Invariant cache hit.
[2024-06-01 13:42:22] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:42:22] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 13:42:23] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-06-01 13:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 13:42:23] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 13:42:23] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 13:42:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:42:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:42:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 5375 ms returned sat
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 167 places in 395 ms of which 4 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1199 ms
[2024-06-01 13:42:30] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 95 ms.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-06-01 13:42:31] [INFO ] Added : 30 causal constraints over 6 iterations in 985 ms. Result :sat
Minimization took 4513 ms.
[2024-06-01 13:42:35] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-06-01 13:42:35] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 45 ms returned sat
[2024-06-01 13:42:36] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-06-01 13:42:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:42:36] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 36 ms returned sat
[2024-06-01 13:42:37] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2024-06-01 13:42:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 505 ms returned sat
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 52 places in 385 ms of which 4 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 184 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 172 places in 353 ms of which 3 ms to minimize.
[2024-06-01 13:42:40] [INFO ] Deduced a trap composed of 189 places in 326 ms of which 3 ms to minimize.
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 180 places in 476 ms of which 4 ms to minimize.
[2024-06-01 13:42:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3588 ms
[2024-06-01 13:42:41] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 92 ms.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-01 13:42:42] [INFO ] Added : 42 causal constraints over 9 iterations in 862 ms. Result :sat
Minimization took 4504 ms.
[2024-06-01 13:42:47] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 13:42:47] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 13:42:47] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-06-01 13:42:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-01 13:42:47] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:42:48] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2024-06-01 13:42:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 301 ms returned sat
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 189 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2024-06-01 13:42:49] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 93 ms.
[2024-06-01 13:42:50] [INFO ] Added : 41 causal constraints over 9 iterations in 1187 ms. Result :sat
Minimization took 3784 ms.
[2024-06-01 13:42:54] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:42:54] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 13:42:54] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-06-01 13:42:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:42:54] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 18 ms returned sat
[2024-06-01 13:42:55] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-06-01 13:42:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 609 ms returned sat
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 194 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2024-06-01 13:42:57] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 66 ms.
[2024-06-01 13:42:58] [INFO ] Added : 30 causal constraints over 6 iterations in 812 ms. Result :sat
Minimization took 3684 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 23 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 13:43:02] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:43:02] [INFO ] Invariant cache hit.
[2024-06-01 13:43:03] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-01 13:43:03] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:43:03] [INFO ] Invariant cache hit.
[2024-06-01 13:43:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:43:10] [INFO ] Implicit Places using invariants and state equation in 7088 ms returned []
Implicit Place search using SMT with State Equation took 7619 ms to find 0 implicit places.
[2024-06-01 13:43:10] [INFO ] Redundant transitions in 103 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:43:10] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:43:10] [INFO ] Invariant cache hit.
[2024-06-01 13:43:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 4 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 20 ms to minimize.
[2024-06-01 13:43:20] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:43:20] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:43:20] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 167 places in 305 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 172 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 159 places in 256 ms of which 3 ms to minimize.
SMT process timed out in 32080ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 32105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39870 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (20 resets) in 1893 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (14 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 305 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (14 resets) in 412 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 385 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (13 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 122757 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 8
Probabilistic random walk after 122757 steps, saw 70737 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX2 is UNSAT
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3600 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 13:43:51] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 27 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX1 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1506 variables, and 598 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 8638ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:43:55] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:43:55] [INFO ] Invariant cache hit.
[2024-06-01 13:43:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:44:09] [INFO ] Deduced a trap composed of 191 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:44:09] [INFO ] Deduced a trap composed of 167 places in 352 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:44:22] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 276 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:44:30] [INFO ] Deduced a trap composed of 150 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:44:31] [INFO ] Deduced a trap composed of 159 places in 301 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 16/16 constraints]
After SMT, in 42636ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42675 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (24 resets) in 457 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 95987 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 95987 steps, saw 56049 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 13:44:41] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:44:41] [INFO ] Invariant cache hit.
[2024-06-01 13:44:41] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 592 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 212 places in 235 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/443 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/446 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1058/1504 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MIN1 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 4/597 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 171 places in 350 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1504 variables, 1/598 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1504 variables, 0/598 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1506 variables, 2/600 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1506 variables, 1/601 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 13:45:28] [INFO ] Deduced a trap composed of 189 places in 492 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1506 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 602 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 47297ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 36 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 448/448 places, 1074/1074 transitions.
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-01 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-00 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[2, 0] Max Struct:[28, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09
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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
[2024-06-01 13:45:29] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:45:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (4 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-06-01 13:45:29] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:45:29] [INFO ] Invariant cache hit.
[2024-06-01 13:45:29] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:45:29] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 26 ms returned sat
[2024-06-01 13:45:30] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-06-01 13:45:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:45:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:45:30] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 13:45:31] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2024-06-01 13:45:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:45:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 363 ms returned sat
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 189 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2024-06-01 13:45:32] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 113 ms.
[2024-06-01 13:45:33] [INFO ] Added : 41 causal constraints over 9 iterations in 1292 ms. Result :sat
Minimization took 612 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:45:33] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:45:33] [INFO ] Invariant cache hit.
[2024-06-01 13:45:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:45:44] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:45:45] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:45:45] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:45:46] [INFO ] Deduced a trap composed of 173 places in 366 ms of which 3 ms to minimize.
[2024-06-01 13:45:47] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:45:47] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 276 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:46:10] [INFO ] Deduced a trap composed of 150 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:46:10] [INFO ] Deduced a trap composed of 159 places in 281 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 16/16 constraints]
After SMT, in 42796ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42841 ms. Remains : 448/448 places, 1074/1074 transitions.
[2024-06-01 13:46:16] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:46:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[28]
RANDOM walk for 1000000 steps (439 resets) in 4222 ms. (236 steps per ms)
BEST_FIRST walk for 1000000 steps (165 resets) in 2058 ms. (485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-06-01 13:46:23] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:46:23] [INFO ] Invariant cache hit.
[2024-06-01 13:46:23] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:46:23] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 22 ms returned sat
[2024-06-01 13:46:23] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2024-06-01 13:46:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:46:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 13:46:23] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 13:46:24] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-06-01 13:46:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:46:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 242 ms returned sat
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 189 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2024-06-01 13:46:25] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 78 ms.
[2024-06-01 13:46:26] [INFO ] Added : 41 causal constraints over 9 iterations in 1166 ms. Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 38 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 28 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 13:46:30] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:46:30] [INFO ] Invariant cache hit.
[2024-06-01 13:46:31] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 13:46:31] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:46:31] [INFO ] Invariant cache hit.
[2024-06-01 13:46:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:46:40] [INFO ] Implicit Places using invariants and state equation in 8778 ms returned []
Implicit Place search using SMT with State Equation took 9525 ms to find 0 implicit places.
[2024-06-01 13:46:40] [INFO ] Redundant transitions in 36 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:46:40] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:46:40] [INFO ] Invariant cache hit.
[2024-06-01 13:46:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 173 places in 329 ms of which 18 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 191 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 167 places in 318 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 172 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:47:10] [INFO ] Deduced a trap composed of 159 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:47:10] [INFO ] Deduced a trap composed of 153 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:47:12] [INFO ] Deduced a trap composed of 145 places in 329 ms of which 3 ms to minimize.
[2024-06-01 13:47:12] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 2 ms to minimize.
[2024-06-01 13:47:12] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 32527ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 32543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42155 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (13 resets) in 664 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (16 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174168 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 174168 steps, saw 98826 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 13:47:16] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:47:16] [INFO ] Invariant cache hit.
[2024-06-01 13:47:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 271 places in 186 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 7 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 6 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1506 variables, and 592 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2962 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3655ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:47:20] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:47:20] [INFO ] Invariant cache hit.
[2024-06-01 13:47:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 28 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:47:30] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:47:30] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:47:31] [INFO ] Deduced a trap composed of 173 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:47:32] [INFO ] Deduced a trap composed of 191 places in 318 ms of which 2 ms to minimize.
[2024-06-01 13:47:32] [INFO ] Deduced a trap composed of 167 places in 279 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:47:45] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 276 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 150 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 159 places in 284 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 16/16 constraints]
After SMT, in 42242ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42271 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (24 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345183 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345183 steps, saw 187949 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 13:48:05] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:48:05] [INFO ] Invariant cache hit.
[2024-06-01 13:48:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 271 places in 428 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 224 places in 406 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 6 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:48:08] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:48:08] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 19 places in 515 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 597 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5212 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 47 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 32 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 13:48:11] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:48:11] [INFO ] Invariant cache hit.
[2024-06-01 13:48:12] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 13:48:12] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:48:12] [INFO ] Invariant cache hit.
[2024-06-01 13:48:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:48:19] [INFO ] Implicit Places using invariants and state equation in 7147 ms returned []
Implicit Place search using SMT with State Equation took 7722 ms to find 0 implicit places.
[2024-06-01 13:48:19] [INFO ] Redundant transitions in 25 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:48:19] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:48:19] [INFO ] Invariant cache hit.
[2024-06-01 13:48:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 173 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 191 places in 272 ms of which 2 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 167 places in 260 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:48:42] [INFO ] Deduced a trap composed of 172 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:48:43] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:48:49] [INFO ] Deduced a trap composed of 159 places in 346 ms of which 6 ms to minimize.
[2024-06-01 13:48:50] [INFO ] Deduced a trap composed of 153 places in 442 ms of which 6 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 145 places in 330 ms of which 2 ms to minimize.
SMT process timed out in 32491ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 32512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40304 ms. Remains : 448/448 places, 1074/1074 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 448 transition count 1058
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 440 transition count 1090
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 440 transition count 1058
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 440 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 432 transition count 1050
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 432 transition count 1042
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 424 transition count 1042
Applied a total of 96 rules in 115 ms. Remains 424 /448 variables (removed 24) and now considering 1042/1074 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1042 rows 424 cols
[2024-06-01 13:48:52] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 25 ms returned sat
[2024-06-01 13:48:52] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:48:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 24 ms returned sat
[2024-06-01 13:48:53] [INFO ] After 1480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
TRAPS : Iteration 1
[2024-06-01 13:48:54] [INFO ] After 2079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:48:54] [INFO ] After 2298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2654 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[28]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09 in 205490 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-06-01 13:48:54] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-06-01 13:48:54] [INFO ] Computed 44 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (11 resets) in 58 ms. (169 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-06-01 13:48:54] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:48:54] [INFO ] Invariant cache hit.
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:48:55] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-06-01 13:48:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:48:55] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 19 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2024-06-01 13:48:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:48:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 652 ms returned sat
[2024-06-01 13:48:57] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 109 ms.
[2024-06-01 13:48:57] [INFO ] Added : 17 causal constraints over 4 iterations in 548 ms. Result :sat
Minimization took 812 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 1066
Applied a total of 16 rules in 35 ms. Remains 440 /448 variables (removed 8) and now considering 1066/1074 (removed 8) transitions.
Running 1064 sub problems to find dead transitions.
[2024-06-01 13:48:58] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2024-06-01 13:48:58] [INFO ] Computed 44 invariants in 11 ms
[2024-06-01 13:48:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:49:09] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 2 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:49:11] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:49:11] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:49:11] [INFO ] Deduced a trap composed of 172 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:49:12] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 2 ms to minimize.
[2024-06-01 13:49:12] [INFO ] Deduced a trap composed of 183 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:49:13] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 150 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:49:28] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 5 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 137 places in 297 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 61 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 19/19 constraints]
After SMT, in 42237ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 42248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42285 ms. Remains : 440/448 places, 1066/1074 transitions.
[2024-06-01 13:49:40] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:49:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (425 resets) in 3699 ms. (270 steps per ms)
BEST_FIRST walk for 1000001 steps (164 resets) in 1857 ms. (538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-06-01 13:49:46] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:49:46] [INFO ] Invariant cache hit.
[2024-06-01 13:49:46] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2024-06-01 13:49:46] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 50 ms returned sat
[2024-06-01 13:49:47] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2024-06-01 13:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:49:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 13:49:47] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 28 ms returned sat
[2024-06-01 13:49:48] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2024-06-01 13:49:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:49:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 2081 ms returned sat
[2024-06-01 13:49:50] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 111 ms.
[2024-06-01 13:49:51] [INFO ] Added : 17 causal constraints over 4 iterations in 516 ms. Result :sat
Minimization took 5082 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-06-01 13:49:56] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:49:56] [INFO ] Invariant cache hit.
[2024-06-01 13:49:56] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-01 13:49:56] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:49:56] [INFO ] Invariant cache hit.
[2024-06-01 13:49:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:50:02] [INFO ] Implicit Places using invariants and state equation in 6340 ms returned []
Implicit Place search using SMT with State Equation took 6753 ms to find 0 implicit places.
[2024-06-01 13:50:02] [INFO ] Redundant transitions in 15 ms returned []
Running 1064 sub problems to find dead transitions.
[2024-06-01 13:50:03] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:50:03] [INFO ] Invariant cache hit.
[2024-06-01 13:50:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 3 ms to minimize.
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:50:13] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:50:13] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:50:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:50:13] [INFO ] Deduced a trap composed of 153 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:50:14] [INFO ] Deduced a trap composed of 171 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:50:14] [INFO ] Deduced a trap composed of 152 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:50:14] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 146 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 172 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:50:23] [INFO ] Deduced a trap composed of 81 places in 335 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:50:46] [INFO ] Deduced a trap composed of 268 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 150 places in 332 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 63 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 21/21 constraints]
After SMT, in 62329ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 62347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69147 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (16 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 135899 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 135899 steps, saw 78231 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
[2024-06-01 13:51:08] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:51:08] [INFO ] Invariant cache hit.
[2024-06-01 13:51:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:51:09] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1724 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 44 places in 2169 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 174 places in 396 ms of which 3 ms to minimize.
SMT process timed out in 6891ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 19 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2024-06-01 13:51:15] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:51:15] [INFO ] Invariant cache hit.
[2024-06-01 13:51:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 153 places in 321 ms of which 3 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 171 places in 315 ms of which 2 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 152 places in 304 ms of which 2 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 160 places in 309 ms of which 3 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:51:35] [INFO ] Deduced a trap composed of 146 places in 329 ms of which 5 ms to minimize.
[2024-06-01 13:51:36] [INFO ] Deduced a trap composed of 172 places in 324 ms of which 2 ms to minimize.
[2024-06-01 13:51:36] [INFO ] Deduced a trap composed of 81 places in 281 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 150 places in 367 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 60 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 18/18 constraints]
After SMT, in 42360ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 42425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42447 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (17 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 146201 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146201 steps, saw 83874 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 13:52:01] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:52:01] [INFO ] Invariant cache hit.
[2024-06-01 13:52:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:52:01] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 194 places in 294 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 181 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 190 places in 332 ms of which 3 ms to minimize.
[2024-06-01 13:52:09] [INFO ] Deduced a trap composed of 177 places in 349 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1490 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1490 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 594 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9275 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 11150ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 8058 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-06-01 13:52:20] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:52:20] [INFO ] Invariant cache hit.
[2024-06-01 13:52:21] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-06-01 13:52:21] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:52:21] [INFO ] Invariant cache hit.
[2024-06-01 13:52:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:52:27] [INFO ] Implicit Places using invariants and state equation in 6542 ms returned []
Implicit Place search using SMT with State Equation took 6915 ms to find 0 implicit places.
[2024-06-01 13:52:27] [INFO ] Redundant transitions in 8 ms returned []
Running 1064 sub problems to find dead transitions.
[2024-06-01 13:52:27] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2024-06-01 13:52:27] [INFO ] Invariant cache hit.
[2024-06-01 13:52:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 153 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 152 places in 257 ms of which 2 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 160 places in 322 ms of which 2 ms to minimize.
[2024-06-01 13:52:40] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:52:46] [INFO ] Deduced a trap composed of 146 places in 304 ms of which 6 ms to minimize.
[2024-06-01 13:52:47] [INFO ] Deduced a trap composed of 172 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:52:48] [INFO ] Deduced a trap composed of 81 places in 311 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:52:59] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 13:53:11] [INFO ] Deduced a trap composed of 268 places in 344 ms of which 4 ms to minimize.
[2024-06-01 13:53:14] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:53:14] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:53:19] [INFO ] Deduced a trap composed of 150 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 63 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 21/21 constraints]
After SMT, in 62512ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 62526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69478 ms. Remains : 440/440 places, 1066/1066 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14 in 275469 ms.
[2024-06-01 13:53:30] [INFO ] Flatten gal took : 199 ms
[2024-06-01 13:53:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 13:53:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 1074 transitions and 5490 arcs took 11 ms.
Total runtime 802233 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-UpperBounds-09
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-UpperBounds-14

BK_STOP 1717250010952

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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