Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000413.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 itstools
Input is PolyORBNT-COL-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716927008217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 20:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 20:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:10:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 20:10:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 20:10:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2024-05-28 20:10:10] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-28 20:10:10] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 20:10:10] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 20:10:10] [INFO ] Computed 13 invariants in 30 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 10] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 20:10:10] [INFO ] Invariant cache hit.
[2024-05-28 20:10:10] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 20:10:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 20:10:10] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 20:10:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:10:10] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 23 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:10:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:10] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 20:10:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2024-05-28 20:10:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 20:10:11] [INFO ] Added : 36 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 20:10:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2024-05-28 20:10:11] [INFO ] Added : 20 causal constraints over 4 iterations in 394 ms. Result :sat
Minimization took 113 ms.
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 20:10:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 20:10:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-28 20:10:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:12] [INFO ] Added : 22 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 115 ms.
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 195 ms
[2024-05-28 20:10:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-28 20:10:12] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:10:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:10:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 20:10:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-28 20:10:13] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 34 ms.
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-28 20:10:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-28 20:10:13] [INFO ] Added : 36 causal constraints over 8 iterations in 173 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:10:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-05-28 20:10:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-28 20:10:13] [INFO ] Added : 36 causal constraints over 8 iterations in 214 ms. Result :sat
Minimization took 45 ms.
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:10:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-05-28 20:10:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:10:14] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 28 ms.
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 20:10:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:14] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 20:10:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 20:10:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:15] [INFO ] Added : 15 causal constraints over 3 iterations in 534 ms. Result :sat
Minimization took 125 ms.
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:10:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 3 ms to minimize.
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:10:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-05-28 20:10:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:15] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:10:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:10:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:10:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-28 20:10:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 20:10:15] [INFO ] Added : 21 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 117 ms.
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:10:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:10:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:10:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2024-05-28 20:10:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:10:16] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 10 ms to minimize.
[2024-05-28 20:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-28 20:10:16] [INFO ] Added : 36 causal constraints over 8 iterations in 110 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 20:10:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:10:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:10:16] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, 10, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 20:10:16] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 358 ms.
[2024-05-28 20:10:16] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 31 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
[2024-05-28 20:10:16] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-28 20:10:17] [INFO ] Computed 92 invariants in 119 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 11, 10, 1, 3, 32, 31]
RANDOM walk for 10000 steps (559 resets) in 262 ms. (38 steps per ms)
BEST_FIRST walk for 140013 steps (1460 resets) in 489 ms. (285 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 3, 0, 1, 0, 0, 1, 4, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 31, 32, 1, 11, 10, 1, 3, 32, 31]
[2024-05-28 20:10:17] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 20:10:17] [INFO ] Invariant cache hit.
[2024-05-28 20:10:18] [INFO ] [Real]Absence check using 85 positive place invariants in 19 ms returned sat
[2024-05-28 20:10:18] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 20:10:18] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-28 20:10:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:18] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 20:10:18] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 20:10:19] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2024-05-28 20:10:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:10:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 129 ms returned sat
[2024-05-28 20:10:19] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 333 ms.
[2024-05-28 20:10:20] [INFO ] Deduced a trap composed of 19 places in 599 ms of which 17 ms to minimize.
[2024-05-28 20:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 909 ms
[2024-05-28 20:10:21] [INFO ] Added : 27 causal constraints over 6 iterations in 2165 ms. Result :sat
Minimization took 654 ms.
[2024-05-28 20:10:22] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 20:10:22] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 20:10:22] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-28 20:10:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:23] [INFO ] [Nat]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 20:10:23] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 20:10:23] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2024-05-28 20:10:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 175 ms returned sat
[2024-05-28 20:10:24] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 410 ms.
[2024-05-28 20:10:25] [INFO ] Added : 10 causal constraints over 2 iterations in 1603 ms. Result :unknown
[2024-05-28 20:10:25] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:25] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:10:26] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-28 20:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:26] [INFO ] [Nat]Absence check using 85 positive place invariants in 42 ms returned sat
[2024-05-28 20:10:26] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:10:27] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2024-05-28 20:10:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 153 ms returned sat
[2024-05-28 20:10:27] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 218 ms.
[2024-05-28 20:10:28] [INFO ] Deduced a trap composed of 282 places in 645 ms of which 6 ms to minimize.
[2024-05-28 20:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 924 ms
[2024-05-28 20:10:29] [INFO ] Added : 19 causal constraints over 4 iterations in 1934 ms. Result :sat
Minimization took 780 ms.
[2024-05-28 20:10:30] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-28 20:10:30] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:10:30] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-05-28 20:10:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:30] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-28 20:10:30] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 20:10:31] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2024-05-28 20:10:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 225 ms returned sat
[2024-05-28 20:10:31] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 192 ms.
[2024-05-28 20:10:33] [INFO ] Deduced a trap composed of 89 places in 536 ms of which 4 ms to minimize.
[2024-05-28 20:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 973 ms
[2024-05-28 20:10:34] [INFO ] Deduced a trap composed of 311 places in 488 ms of which 5 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Deduced a trap composed of 82 places in 598 ms of which 5 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1452 ms
[2024-05-28 20:10:36] [INFO ] Deduced a trap composed of 3 places in 777 ms of which 5 ms to minimize.
[2024-05-28 20:10:36] [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 3
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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-05-28 20:10:36] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-05-28 20:10:36] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-28 20:10:36] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:36] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:10:37] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2024-05-28 20:10:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:37] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:37] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:10:38] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2024-05-28 20:10:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-28 20:10:39] [INFO ] Deduced a trap composed of 154 places in 491 ms of which 5 ms to minimize.
[2024-05-28 20:10:39] [INFO ] Deduced a trap composed of 323 places in 457 ms of which 5 ms to minimize.
[2024-05-28 20:10:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1194 ms
[2024-05-28 20:10:39] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 188 ms.
[2024-05-28 20:10:40] [INFO ] Added : 15 causal constraints over 3 iterations in 1076 ms. Result :sat
Minimization took 693 ms.
[2024-05-28 20:10:41] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2024-05-28 20:10:41] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 20:10:42] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-05-28 20:10:42] [INFO ] [Real]Added 1 Read/Feed constraints in 59 ms returned sat
[2024-05-28 20:10:42] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 229 ms.
[2024-05-28 20:10:43] [INFO ] Added : 7 causal constraints over 2 iterations in 709 ms. Result :sat
Minimization took 937 ms.
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned unsat
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned unsat
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-05-28 20:10:44] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:10:45] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-28 20:10:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:45] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-05-28 20:10:45] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:10:46] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-05-28 20:10:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-28 20:10:46] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 180 ms.
[2024-05-28 20:10:46] [INFO ] Added : 6 causal constraints over 2 iterations in 514 ms. Result :sat
Minimization took 738 ms.
[2024-05-28 20:10:47] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:47] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 20:10:48] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-28 20:10:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:48] [INFO ] [Nat]Absence check using 85 positive place invariants in 32 ms returned sat
[2024-05-28 20:10:48] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:10:49] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-05-28 20:10:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2024-05-28 20:10:50] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 231 ms.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 292 places in 587 ms of which 5 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 933 ms
[2024-05-28 20:10:51] [INFO ] Added : 11 causal constraints over 3 iterations in 1867 ms. Result :sat
Minimization took 833 ms.
[2024-05-28 20:10:52] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:52] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:10:53] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-05-28 20:10:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:53] [INFO ] [Nat]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-05-28 20:10:53] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:10:54] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2024-05-28 20:10:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 232 ms returned sat
[2024-05-28 20:10:54] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 133 ms.
[2024-05-28 20:10:55] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 1 ms to minimize.
[2024-05-28 20:10:56] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 944 ms
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-28 20:10:58] [INFO ] [Real]Absence check using 85 positive place invariants in 31 ms returned sat
[2024-05-28 20:10:58] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 20:10:59] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2024-05-28 20:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:10:59] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-28 20:10:59] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:11:00] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-28 20:11:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 209 ms returned sat
[2024-05-28 20:11:00] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 192 ms.
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 2 ms to minimize.
[2024-05-28 20:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 761 ms
[2024-05-28 20:11:02] [INFO ] Added : 32 causal constraints over 7 iterations in 2150 ms. Result :sat
Minimization took 709 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 3, 0, 1, 0, 0, 1, 4, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 32, 1, 1, 4, 1, 3, 32, 31]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 3, 0, 0, 1, 1, 0, 0, 0] Max Struct:[11, 2, 4, 1, 32, 1, 1, 3, 32, 31]
Support contains 40 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 654 transition count 1938
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 652 transition count 1937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 651 transition count 1937
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 16 place count 651 transition count 1902
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 86 place count 616 transition count 1902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 615 transition count 1901
Applied a total of 88 rules in 388 ms. Remains 615 /664 variables (removed 49) and now considering 1901/1940 (removed 39) transitions.
Running 1890 sub problems to find dead transitions.
[2024-05-28 20:11:03] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
// Phase 1: matrix 1892 rows 615 cols
[2024-05-28 20:11:04] [INFO ] Computed 82 invariants in 92 ms
[2024-05-28 20:11:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/2507 variables, and 72 constraints, problems are : Problem set: 0 solved, 1890 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1890/890 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
[2024-05-28 20:11:45] [INFO ] Deduced a trap composed of 19 places in 419 ms of which 3 ms to minimize.
[2024-05-28 20:11:47] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 3 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 5 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 4 ms to minimize.
SMT process timed out in 58764ms, After SMT, problems are : Problem set: 0 solved, 1890 unsolved
Search for dead transitions found 0 dead transitions in 58829ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59248 ms. Remains : 615/664 places, 1901/1940 transitions.
[2024-05-28 20:12:02] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
[2024-05-28 20:12:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 3, 0, 0, 1, 1, 0, 0, 0] Max Struct:[11, 2, 4, 1, 32, 1, 1, 3, 32, 31]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (70241 resets) in 14610 ms. (68 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (44221 resets) in 13284 ms. (376 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 1, 1, 1] Max Struct:[11, 4, 32, 32, 31]
[2024-05-28 20:12:30] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
[2024-05-28 20:12:30] [INFO ] Invariant cache hit.
[2024-05-28 20:12:30] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2024-05-28 20:12:30] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 5 ms returned unsat
[2024-05-28 20:12:30] [INFO ] [Real]Absence check using 76 positive place invariants in 23 ms returned sat
[2024-05-28 20:12:30] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-28 20:12:31] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-05-28 20:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:12:31] [INFO ] [Nat]Absence check using 76 positive place invariants in 21 ms returned sat
[2024-05-28 20:12:31] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-28 20:12:32] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-28 20:12:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:12:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2024-05-28 20:12:32] [INFO ] Computed and/alt/rep : 1410/4676/1410 causal constraints (skipped 471 transitions) in 175 ms.
[2024-05-28 20:12:32] [INFO ] Added : 6 causal constraints over 2 iterations in 558 ms. Result :sat
Minimization took 1973 ms.
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive place invariants in 24 ms returned sat
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned unsat
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive place invariants in 27 ms returned sat
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned unsat
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2024-05-28 20:12:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 1, 1, 1] Max Struct:[1, 4, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1901/1901 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 615 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 613 transition count 1899
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 4 place count 613 transition count 1868
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 66 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 580 transition count 1866
Applied a total of 70 rules in 116 ms. Remains 580 /615 variables (removed 35) and now considering 1866/1901 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 580/615 places, 1866/1901 transitions.
[2024-05-28 20:12:35] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 20:12:35] [INFO ] Computed 82 invariants in 113 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72710 resets) in 14943 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (9001 resets) in 2206 ms. (453 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 20:12:52] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 20:12:52] [INFO ] Invariant cache hit.
[2024-05-28 20:12:52] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-28 20:12:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:12:53] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-05-28 20:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:12:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2024-05-28 20:12:53] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 20:12:54] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2024-05-28 20:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:12:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 235 ms returned sat
[2024-05-28 20:12:54] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 182 ms.
[2024-05-28 20:12:55] [INFO ] Added : 9 causal constraints over 3 iterations in 740 ms. Result :sat
Minimization took 2758 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 77 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 20:12:58] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 20:12:58] [INFO ] Invariant cache hit.
[2024-05-28 20:12:59] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-05-28 20:12:59] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 20:12:59] [INFO ] Invariant cache hit.
[2024-05-28 20:12:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:13:02] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2024-05-28 20:13:02] [INFO ] Redundant transitions in 78 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 20:13:02] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 20:13:02] [INFO ] Invariant cache hit.
[2024-05-28 20:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.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 (/ 2.0 3.0))
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 (/ 1.0 3.0))
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 3.0))
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 (/ 2.0 3.0))
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 4.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 (/ 1.0 3.0))
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 9.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 9/579 variables, 9/81 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/2437 variables, and 81 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 18 places in 339 ms of which 2 ms to minimize.
[2024-05-28 20:14:03] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 78601ms problems are : Problem set: 558 solved, 1297 unsolved
Search for dead transitions found 558 dead transitions in 78620ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1308/1866 transitions.
Applied a total of 0 rules in 21 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 20:14:20] [INFO ] Redundant transitions in 99 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82482 ms. Remains : 580/580 places, 1308/1866 transitions.
[2024-05-28 20:14:20] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-05-28 20:14:20] [INFO ] Computed 82 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72692 resets) in 9709 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (8793 resets) in 1862 ms. (536 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 20:14:32] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:14:32] [INFO ] Invariant cache hit.
[2024-05-28 20:14:32] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2024-05-28 20:14:32] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 20:14:32] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-28 20:14:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:14:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-28 20:14:33] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 20:14:33] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-28 20:14:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:14:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2024-05-28 20:14:33] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 140 ms.
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 106 places in 462 ms of which 4 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2024-05-28 20:14:34] [INFO ] Added : 7 causal constraints over 2 iterations in 1036 ms. Result :sat
Minimization took 1298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 49 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 20:14:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:14:36] [INFO ] Invariant cache hit.
[2024-05-28 20:14:36] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 20:14:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:14:36] [INFO ] Invariant cache hit.
[2024-05-28 20:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:14:39] [INFO ] Implicit Places using invariants and state equation in 3296 ms returned []
Implicit Place search using SMT with State Equation took 3871 ms to find 0 implicit places.
[2024-05-28 20:14:40] [INFO ] Redundant transitions in 45 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:14:40] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:14:40] [INFO ] Invariant cache hit.
[2024-05-28 20:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:14:56] [INFO ] Deduced a trap composed of 151 places in 217 ms of which 4 ms to minimize.
[2024-05-28 20:14:57] [INFO ] Deduced a trap composed of 146 places in 230 ms of which 17 ms to minimize.
[2024-05-28 20:14:57] [INFO ] Deduced a trap composed of 146 places in 184 ms of which 3 ms to minimize.
[2024-05-28 20:14:57] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:14:57] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 2 ms to minimize.
[2024-05-28 20:14:57] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 2 ms to minimize.
[2024-05-28 20:14:58] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:14:58] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:14:58] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
[2024-05-28 20:14:58] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 151 places in 216 ms of which 3 ms to minimize.
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 151 places in 216 ms of which 3 ms to minimize.
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 3 ms to minimize.
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 3 ms to minimize.
[2024-05-28 20:15:00] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:15:00] [INFO ] Deduced a trap composed of 151 places in 224 ms of which 3 ms to minimize.
[2024-05-28 20:15:00] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 4 ms to minimize.
[2024-05-28 20:15:00] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 3 ms to minimize.
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:15:09] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 5 ms to minimize.
[2024-05-28 20:15:11] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:15:19] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 4 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 176 places in 238 ms of which 6 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 236 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 171 places in 225 ms of which 4 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 3 ms to minimize.
[2024-05-28 20:15:21] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 3 ms to minimize.
[2024-05-28 20:15:21] [INFO ] Deduced a trap composed of 151 places in 190 ms of which 3 ms to minimize.
[2024-05-28 20:15:21] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 3 ms to minimize.
[2024-05-28 20:15:21] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:15:21] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 3 ms to minimize.
[2024-05-28 20:15:22] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 3 ms to minimize.
[2024-05-28 20:15:22] [INFO ] Deduced a trap composed of 176 places in 181 ms of which 3 ms to minimize.
[2024-05-28 20:15:22] [INFO ] Deduced a trap composed of 171 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:15:22] [INFO ] Deduced a trap composed of 240 places in 198 ms of which 3 ms to minimize.
[2024-05-28 20:15:22] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 2 ms to minimize.
[2024-05-28 20:15:23] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 3 ms to minimize.
[2024-05-28 20:15:23] [INFO ] Deduced a trap composed of 238 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:15:23] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:15:23] [INFO ] Deduced a trap composed of 161 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:15:25] [INFO ] Deduced a trap composed of 238 places in 379 ms of which 4 ms to minimize.
[2024-05-28 20:15:26] [INFO ] Deduced a trap composed of 170 places in 317 ms of which 3 ms to minimize.
[2024-05-28 20:15:26] [INFO ] Deduced a trap composed of 161 places in 304 ms of which 3 ms to minimize.
[2024-05-28 20:15:26] [INFO ] Deduced a trap composed of 228 places in 378 ms of which 3 ms to minimize.
[2024-05-28 20:15:27] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2024-05-28 20:15:29] [INFO ] Deduced a trap composed of 175 places in 392 ms of which 5 ms to minimize.
[2024-05-28 20:15:30] [INFO ] Deduced a trap composed of 156 places in 319 ms of which 3 ms to minimize.
[2024-05-28 20:15:30] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 3 ms to minimize.
[2024-05-28 20:15:30] [INFO ] Deduced a trap composed of 180 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:15:31] [INFO ] Deduced a trap composed of 190 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:15:31] [INFO ] Deduced a trap composed of 186 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:15:31] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:15:31] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:15:32] [INFO ] Deduced a trap composed of 170 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:15:32] [INFO ] Deduced a trap composed of 161 places in 259 ms of which 2 ms to minimize.
[2024-05-28 20:15:32] [INFO ] Deduced a trap composed of 185 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:15:33] [INFO ] Deduced a trap composed of 171 places in 268 ms of which 3 ms to minimize.
[2024-05-28 20:15:33] [INFO ] Deduced a trap composed of 180 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:15:33] [INFO ] Deduced a trap composed of 170 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:15:33] [INFO ] Deduced a trap composed of 185 places in 278 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:15:36] [INFO ] Deduced a trap composed of 233 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:15:36] [INFO ] Deduced a trap composed of 176 places in 347 ms of which 3 ms to minimize.
[2024-05-28 20:15:37] [INFO ] Deduced a trap composed of 251 places in 354 ms of which 3 ms to minimize.
[2024-05-28 20:15:37] [INFO ] Deduced a trap composed of 247 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:15:37] [INFO ] Deduced a trap composed of 251 places in 275 ms of which 2 ms to minimize.
[2024-05-28 20:15:38] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 3 ms to minimize.
[2024-05-28 20:15:38] [INFO ] Deduced a trap composed of 170 places in 277 ms of which 17 ms to minimize.
[2024-05-28 20:15:38] [INFO ] Deduced a trap composed of 180 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:15:39] [INFO ] Deduced a trap composed of 195 places in 290 ms of which 3 ms to minimize.
[2024-05-28 20:15:39] [INFO ] Deduced a trap composed of 243 places in 266 ms of which 3 ms to minimize.
[2024-05-28 20:15:39] [INFO ] Deduced a trap composed of 170 places in 266 ms of which 3 ms to minimize.
[2024-05-28 20:15:40] [INFO ] Deduced a trap composed of 175 places in 255 ms of which 3 ms to minimize.
[2024-05-28 20:15:40] [INFO ] Deduced a trap composed of 245 places in 323 ms of which 4 ms to minimize.
[2024-05-28 20:15:40] [INFO ] Deduced a trap composed of 180 places in 266 ms of which 3 ms to minimize.
[2024-05-28 20:15:41] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 2 ms to minimize.
[2024-05-28 20:15:41] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 3 ms to minimize.
[2024-05-28 20:15:41] [INFO ] Deduced a trap composed of 175 places in 322 ms of which 3 ms to minimize.
[2024-05-28 20:15:42] [INFO ] Deduced a trap composed of 161 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:15:42] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 2 ms to minimize.
[2024-05-28 20:15:42] [INFO ] Deduced a trap composed of 171 places in 270 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:15:46] [INFO ] Deduced a trap composed of 185 places in 413 ms of which 4 ms to minimize.
[2024-05-28 20:15:47] [INFO ] Deduced a trap composed of 180 places in 378 ms of which 4 ms to minimize.
[2024-05-28 20:15:47] [INFO ] Deduced a trap composed of 170 places in 338 ms of which 3 ms to minimize.
[2024-05-28 20:15:48] [INFO ] Deduced a trap composed of 155 places in 386 ms of which 4 ms to minimize.
SMT process timed out in 68016ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 68041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72016 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40001 steps (2888 resets) in 2951 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (346 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
[2024-05-28 20:15:49] [INFO ] Flatten gal took : 725 ms
BEST_FIRST walk for 40004 steps (354 resets) in 331 ms. (120 steps per ms) remains 2/2 properties
[2024-05-28 20:15:49] [INFO ] Flatten gal took : 399 ms
[2024-05-28 20:15:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16881706564946893758.gal : 126 ms
[2024-05-28 20:15:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1890518030010469514.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16881706564946893758.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1890518030010469514.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1890518030010469514.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 64
Interrupted probabilistic random walk after 335646 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 335646 steps, saw 54380 distinct states, run finished after 3016 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-28 20:15:52] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:15:52] [INFO ] Invariant cache hit.
[2024-05-28 20:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:15:56] [INFO ] Deduced a trap composed of 226 places in 2189 ms of which 3 ms to minimize.
[2024-05-28 20:15:56] [INFO ] Deduced a trap composed of 228 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:15:56] [INFO ] Deduced a trap composed of 230 places in 195 ms of which 3 ms to minimize.
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 226 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 230 places in 198 ms of which 3 ms to minimize.
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6234ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 33 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:15:58] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:15:58] [INFO ] Invariant cache hit.
[2024-05-28 20:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 1024
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
SMT process timed out in 27794ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 27822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27875 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2903 resets) in 1629 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (363 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (359 resets) in 531 ms. (75 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 253573 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 253573 steps, saw 41723 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 20:16:30] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:16:30] [INFO ] Invariant cache hit.
[2024-05-28 20:16:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 226 places in 446 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 228 places in 572 ms of which 4 ms to minimize.
SDD size :1024 after 7685
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 230 places in 636 ms of which 28 ms to minimize.
[2024-05-28 20:16:34] [INFO ] Deduced a trap composed of 226 places in 411 ms of which 3 ms to minimize.
[2024-05-28 20:16:34] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:16:34] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7685 after 41631
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3934 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 5564ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 32 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 20:16:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:16:36] [INFO ] Invariant cache hit.
[2024-05-28 20:16:36] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-28 20:16:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:16:36] [INFO ] Invariant cache hit.
[2024-05-28 20:16:37] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41631 after 140068
Detected timeout of ITS tools.
[2024-05-28 20:16:40] [INFO ] Flatten gal took : 168 ms
[2024-05-28 20:16:40] [INFO ] Applying decomposition
[2024-05-28 20:16:40] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph634063722698514839.txt' '-o' '/tmp/graph634063722698514839.bin' '-w' '/tmp/graph634063722698514839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph634063722698514839.bin' '-l' '-1' '-v' '-w' '/tmp/graph634063722698514839.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:16:41] [INFO ] Decomposing Gal with order
[2024-05-28 20:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:16:41] [INFO ] Removed a total of 989 redundant transitions.
[2024-05-28 20:16:41] [INFO ] Flatten gal took : 517 ms
[2024-05-28 20:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 90 ms.
[2024-05-28 20:16:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10187313583464953496.gal : 56 ms
[2024-05-28 20:16:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15749435576381305687.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10187313583464953496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15749435576381305687.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15749435576381305687.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
[2024-05-28 20:16:42] [INFO ] Implicit Places using invariants and state equation in 6290 ms returned []
Implicit Place search using SMT with State Equation took 6963 ms to find 0 implicit places.
[2024-05-28 20:16:43] [INFO ] Redundant transitions in 13 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:16:43] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:16:43] [INFO ] Invariant cache hit.
[2024-05-28 20:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:17:00] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 4 ms to minimize.
[2024-05-28 20:17:00] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:17:00] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:17:00] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:17:00] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 151 places in 178 ms of which 5 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 3 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 7 ms to minimize.
[2024-05-28 20:17:01] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 3 ms to minimize.
[2024-05-28 20:17:02] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-05-28 20:17:02] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:17:02] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 3 ms to minimize.
[2024-05-28 20:17:02] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:17:02] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 15948
[2024-05-28 20:17:03] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 3 ms to minimize.
[2024-05-28 20:17:03] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 4 ms to minimize.
[2024-05-28 20:17:03] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:17:03] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :15948 after 15956
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :15956 after 15956
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15956 after 15962
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15962 after 15984
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :15984 after 15996
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :15996 after 30398
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :30398 after 33777
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33777 after 34420
[2024-05-28 20:17:11] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:17:13] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :34420 after 54452
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:17:21] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 4 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 236 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 176 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 151 places in 198 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 240 places in 180 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 238 places in 195 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 2 ms to minimize.
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 161 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 3 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 161 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 180 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 190 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 186 places in 259 ms of which 3 ms to minimize.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 156 places in 295 ms of which 4 ms to minimize.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 170 places in 297 ms of which 3 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 161 places in 288 ms of which 3 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 185 places in 343 ms of which 4 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 171 places in 314 ms of which 4 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 180 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 170 places in 318 ms of which 3 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 185 places in 321 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 233 places in 407 ms of which 5 ms to minimize.
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 176 places in 313 ms of which 4 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 251 places in 306 ms of which 3 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 247 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 251 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 170 places in 368 ms of which 4 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 180 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 195 places in 361 ms of which 4 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 243 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 170 places in 371 ms of which 4 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 175 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 3 ms to minimize.
[2024-05-28 20:17:42] [INFO ] Deduced a trap composed of 180 places in 376 ms of which 4 ms to minimize.
[2024-05-28 20:17:42] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 3 ms to minimize.
[2024-05-28 20:17:42] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 4 ms to minimize.
[2024-05-28 20:17:42] [INFO ] Deduced a trap composed of 175 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:17:43] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:17:43] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:17:43] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:17:47] [INFO ] Deduced a trap composed of 185 places in 431 ms of which 4 ms to minimize.
[2024-05-28 20:17:48] [INFO ] Deduced a trap composed of 180 places in 394 ms of which 4 ms to minimize.
[2024-05-28 20:17:48] [INFO ] Deduced a trap composed of 170 places in 364 ms of which 4 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 155 places in 378 ms of which 3 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 165 places in 408 ms of which 3 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 160 places in 354 ms of which 3 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 160 places in 400 ms of which 3 ms to minimize.
SMT process timed out in 67304ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74392 ms. Remains : 580/580 places, 1308/1308 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 20:17:50] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:17:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (736 resets) in 138 ms. (71 steps per ms)
BEST_FIRST walk for 10001 steps (83 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 20:17:50] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:17:50] [INFO ] Invariant cache hit.
[2024-05-28 20:17:50] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-28 20:17:50] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 20:17:50] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-05-28 20:17:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:17:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2024-05-28 20:17:51] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 20:17:51] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-28 20:17:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:17:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 65 ms returned sat
[2024-05-28 20:17:51] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 109 ms.
[2024-05-28 20:17:52] [INFO ] Deduced a trap composed of 106 places in 464 ms of which 5 ms to minimize.
[2024-05-28 20:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2024-05-28 20:17:52] [INFO ] Added : 7 causal constraints over 2 iterations in 1142 ms. Result :sat
Minimization took 629 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 46 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:17:53] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:17:53] [INFO ] Invariant cache hit.
[2024-05-28 20:17:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:18:09] [INFO ] Deduced a trap composed of 151 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 4 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 151 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 151 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 4 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 151 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 4 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 5 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:18:14] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:18:14] [INFO ] Deduced a trap composed of 161 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:18:14] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 92 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 224 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 3 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 224 places in 180 ms of which 3 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 2 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 226 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 228 places in 191 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 141 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 150 places in 277 ms of which 3 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 240 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 190 places in 274 ms of which 2 ms to minimize.
[2024-05-28 20:18:25] [INFO ] Deduced a trap composed of 156 places in 356 ms of which 4 ms to minimize.
[2024-05-28 20:18:25] [INFO ] Deduced a trap composed of 185 places in 356 ms of which 5 ms to minimize.
[2024-05-28 20:18:25] [INFO ] Deduced a trap composed of 151 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 170 places in 375 ms of which 3 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 166 places in 330 ms of which 3 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 165 places in 341 ms of which 3 ms to minimize.
[2024-05-28 20:18:27] [INFO ] Deduced a trap composed of 161 places in 304 ms of which 3 ms to minimize.
[2024-05-28 20:18:27] [INFO ] Deduced a trap composed of 146 places in 343 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 238 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 236 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 244 places in 257 ms of which 3 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:18:32] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 3 ms to minimize.
[2024-05-28 20:18:32] [INFO ] Deduced a trap composed of 236 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:18:32] [INFO ] Deduced a trap composed of 176 places in 237 ms of which 4 ms to minimize.
[2024-05-28 20:18:32] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 4 ms to minimize.
[2024-05-28 20:18:33] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 4 ms to minimize.
[2024-05-28 20:18:35] [INFO ] Deduced a trap composed of 253 places in 409 ms of which 6 ms to minimize.
[2024-05-28 20:18:35] [INFO ] Deduced a trap composed of 170 places in 368 ms of which 4 ms to minimize.
[2024-05-28 20:18:35] [INFO ] Deduced a trap composed of 175 places in 397 ms of which 4 ms to minimize.
[2024-05-28 20:18:36] [INFO ] Deduced a trap composed of 156 places in 421 ms of which 4 ms to minimize.
[2024-05-28 20:18:36] [INFO ] Deduced a trap composed of 161 places in 384 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:18:39] [INFO ] Deduced a trap composed of 156 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:18:39] [INFO ] Deduced a trap composed of 151 places in 283 ms of which 4 ms to minimize.
[2024-05-28 20:18:39] [INFO ] Deduced a trap composed of 151 places in 384 ms of which 4 ms to minimize.
[2024-05-28 20:18:40] [INFO ] Deduced a trap composed of 146 places in 356 ms of which 4 ms to minimize.
SMT process timed out in 47007ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 47030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47082 ms. Remains : 580/580 places, 1308/1308 transitions.
[2024-05-28 20:18:40] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:18:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72625 resets) in 9992 ms. (100 steps per ms)
BEST_FIRST walk for 1000001 steps (8871 resets) in 1808 ms. (552 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 20:18:52] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:18:52] [INFO ] Invariant cache hit.
[2024-05-28 20:18:52] [INFO ] [Real]Absence check using 75 positive place invariants in 23 ms returned sat
[2024-05-28 20:18:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 20:18:52] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-28 20:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:18:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-28 20:18:52] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 20:18:53] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2024-05-28 20:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:18:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2024-05-28 20:18:53] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 85 ms.
[2024-05-28 20:18:53] [INFO ] Deduced a trap composed of 106 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2024-05-28 20:18:53] [INFO ] Added : 7 causal constraints over 2 iterations in 657 ms. Result :sat
Minimization took 1125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 20:18:55] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:18:55] [INFO ] Invariant cache hit.
[2024-05-28 20:18:55] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-28 20:18:55] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:18:55] [INFO ] Invariant cache hit.
[2024-05-28 20:18:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:18:58] [INFO ] Implicit Places using invariants and state equation in 3302 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
[2024-05-28 20:18:58] [INFO ] Redundant transitions in 33 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:18:58] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:18:58] [INFO ] Invariant cache hit.
[2024-05-28 20:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:19:15] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:19:15] [INFO ] Deduced a trap composed of 146 places in 223 ms of which 4 ms to minimize.
[2024-05-28 20:19:16] [INFO ] Deduced a trap composed of 146 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:19:16] [INFO ] Deduced a trap composed of 151 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:19:16] [INFO ] Deduced a trap composed of 151 places in 299 ms of which 4 ms to minimize.
[2024-05-28 20:19:16] [INFO ] Deduced a trap composed of 151 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:19:17] [INFO ] Deduced a trap composed of 156 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:19:17] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:19:17] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:19:17] [INFO ] Deduced a trap composed of 161 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 161 places in 180 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:19:28] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:19:30] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:19:38] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:19:38] [INFO ] Deduced a trap composed of 176 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:19:39] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:19:39] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:19:39] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:19:39] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 3 ms to minimize.
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:19:41] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:19:41] [INFO ] Deduced a trap composed of 176 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:19:41] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:19:41] [INFO ] Deduced a trap composed of 240 places in 205 ms of which 3 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 3 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 151 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:19:43] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 238 places in 350 ms of which 4 ms to minimize.
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 170 places in 322 ms of which 4 ms to minimize.
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 161 places in 283 ms of which 3 ms to minimize.
[2024-05-28 20:19:46] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 3 ms to minimize.
[2024-05-28 20:19:46] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2024-05-28 20:19:48] [INFO ] Deduced a trap composed of 175 places in 344 ms of which 3 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 156 places in 310 ms of which 3 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 161 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 180 places in 420 ms of which 4 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 190 places in 348 ms of which 4 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 186 places in 386 ms of which 3 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 3 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 170 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 161 places in 253 ms of which 14 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 185 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 171 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 180 places in 274 ms of which 3 ms to minimize.
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 170 places in 258 ms of which 3 ms to minimize.
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 185 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:19:56] [INFO ] Deduced a trap composed of 233 places in 399 ms of which 4 ms to minimize.
[2024-05-28 20:19:56] [INFO ] Deduced a trap composed of 176 places in 372 ms of which 4 ms to minimize.
[2024-05-28 20:19:57] [INFO ] Deduced a trap composed of 251 places in 404 ms of which 4 ms to minimize.
[2024-05-28 20:19:57] [INFO ] Deduced a trap composed of 247 places in 405 ms of which 3 ms to minimize.
[2024-05-28 20:19:58] [INFO ] Deduced a trap composed of 251 places in 407 ms of which 4 ms to minimize.
[2024-05-28 20:19:58] [INFO ] Deduced a trap composed of 240 places in 417 ms of which 4 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 170 places in 378 ms of which 4 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 180 places in 414 ms of which 4 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 195 places in 348 ms of which 3 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 243 places in 325 ms of which 4 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 170 places in 328 ms of which 4 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 175 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 180 places in 296 ms of which 3 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 175 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 161 places in 319 ms of which 3 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 232 places in 335 ms of which 3 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 154 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 82/82 constraints]
After SMT, in 67739ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67764ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71629 ms. Remains : 580/580 places, 1308/1308 transitions.
[2024-05-28 20:20:06] [INFO ] Flatten gal took : 96 ms
[2024-05-28 20:20:06] [INFO ] Flatten gal took : 64 ms
[2024-05-28 20:20:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14985697302473206804.gal : 12 ms
[2024-05-28 20:20:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13691199386312934572.prop : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14985697302473206804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13691199386312934572.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2884 resets) in 1199 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (366 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (341 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13691199386312934572.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 64
Interrupted probabilistic random walk after 429402 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 429402 steps, saw 69174 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-28 20:20:10] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:20:11] [INFO ] Deduced a trap composed of 226 places in 351 ms of which 4 ms to minimize.
[2024-05-28 20:20:11] [INFO ] Deduced a trap composed of 228 places in 327 ms of which 4 ms to minimize.
[2024-05-28 20:20:12] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 3 ms to minimize.
[2024-05-28 20:20:12] [INFO ] Deduced a trap composed of 226 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:20:12] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 3 ms to minimize.
[2024-05-28 20:20:13] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2799 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3694ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:20:13] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:20:13] [INFO ] Invariant cache hit.
[2024-05-28 20:20:13] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 1024
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 151 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 146 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 146 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 151 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 151 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 151 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 3 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 3 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 151 places in 243 ms of which 3 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 3 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 156 places in 278 ms of which 3 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 4 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 151 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 3 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 92 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:20:43] [INFO ] Deduced a trap composed of 224 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:20:43] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:20:43] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:20:44] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:20:44] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:20:44] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:20:44] [INFO ] Deduced a trap composed of 146 places in 236 ms of which 3 ms to minimize.
[2024-05-28 20:20:45] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 3 ms to minimize.
[2024-05-28 20:20:45] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:20:45] [INFO ] Deduced a trap composed of 150 places in 313 ms of which 3 ms to minimize.
[2024-05-28 20:20:45] [INFO ] Deduced a trap composed of 240 places in 304 ms of which 3 ms to minimize.
[2024-05-28 20:20:46] [INFO ] Deduced a trap composed of 190 places in 323 ms of which 3 ms to minimize.
[2024-05-28 20:20:46] [INFO ] Deduced a trap composed of 156 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:20:47] [INFO ] Deduced a trap composed of 185 places in 312 ms of which 3 ms to minimize.
[2024-05-28 20:20:47] [INFO ] Deduced a trap composed of 151 places in 297 ms of which 3 ms to minimize.
[2024-05-28 20:20:47] [INFO ] Deduced a trap composed of 170 places in 330 ms of which 3 ms to minimize.
[2024-05-28 20:20:47] [INFO ] Deduced a trap composed of 166 places in 316 ms of which 4 ms to minimize.
[2024-05-28 20:20:48] [INFO ] Deduced a trap composed of 165 places in 329 ms of which 3 ms to minimize.
[2024-05-28 20:20:48] [INFO ] Deduced a trap composed of 161 places in 383 ms of which 4 ms to minimize.
[2024-05-28 20:20:49] [INFO ] Deduced a trap composed of 146 places in 374 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 20:20:50] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 11 ms to minimize.
[2024-05-28 20:20:51] [INFO ] Deduced a trap composed of 238 places in 351 ms of which 31 ms to minimize.
[2024-05-28 20:20:51] [INFO ] Deduced a trap composed of 236 places in 449 ms of which 21 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 238 places in 1752 ms of which 13 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 236 places in 644 ms of which 15 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 236 places in 1026 ms of which 226 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 20:21:00] [INFO ] Flatten gal took : 70 ms
[2024-05-28 20:21:00] [INFO ] Applying decomposition
[2024-05-28 20:21:00] [INFO ] Flatten gal took : 67 ms
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 244 places in 5082 ms of which 11 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18049094916215957088.txt' '-o' '/tmp/graph18049094916215957088.bin' '-w' '/tmp/graph18049094916215957088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18049094916215957088.bin' '-l' '-1' '-v' '-w' '/tmp/graph18049094916215957088.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:21:00] [INFO ] Decomposing Gal with order
[2024-05-28 20:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 238 places in 213 ms of which 3 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Removed a total of 3328 redundant transitions.
[2024-05-28 20:21:01] [INFO ] Flatten gal took : 261 ms
[2024-05-28 20:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 50 ms.
[2024-05-28 20:21:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6729565443244000335.gal : 15 ms
[2024-05-28 20:21:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1254366389902429451.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6729565443244000335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1254366389902429451.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 238 places in 312 ms of which 3 ms to minimize.
SMT process timed out in 47558ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 47572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47601 ms. Remains : 580/580 places, 1308/1308 transitions.
Loading property file /tmp/ReachabilityCardinality1254366389902429451.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
RANDOM walk for 40000 steps (2915 resets) in 995 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (368 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (368 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 395820 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 2
Probabilistic random walk after 395820 steps, saw 63647 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-28 20:21:05] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:21:05] [INFO ] Invariant cache hit.
[2024-05-28 20:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:21:06] [INFO ] Deduced a trap composed of 226 places in 281 ms of which 3 ms to minimize.
[2024-05-28 20:21:06] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 2 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2421 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-28 20:21:08] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:21:08] [INFO ] Invariant cache hit.
[2024-05-28 20:21:09] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-28 20:21:09] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:21:09] [INFO ] Invariant cache hit.
[2024-05-28 20:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:21:12] [INFO ] Implicit Places using invariants and state equation in 3071 ms returned []
Implicit Place search using SMT with State Equation took 3552 ms to find 0 implicit places.
[2024-05-28 20:21:12] [INFO ] Redundant transitions in 30 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 20:21:12] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 20:21:12] [INFO ] Invariant cache hit.
[2024-05-28 20:21:12] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716927679324

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-S10J30, 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 r290-tajo-171654447000413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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