Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716927920459

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-S10J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 20:25:21] [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:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:25:21] [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:25:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 20:25:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 680 ms
[2024-05-28 20:25:22] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-28 20:25:22] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 20:25:22] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 20:25:22] [INFO ] Computed 13 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, 10, +inf, 10, 10, +inf, 10, 10, +inf, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 20:25:22] [INFO ] Invariant cache hit.
[2024-05-28 20:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 20:25:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:25:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:25:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 6 ms to minimize.
[2024-05-28 20:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-28 20:25:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:23] [INFO ] Added : 21 causal constraints over 5 iterations in 297 ms. Result :sat
Minimization took 93 ms.
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-28 20:25:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-28 20:25:23] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 98 ms.
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 20:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 20:25:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-28 20:25:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-28 20:25:24] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 20:25:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:25:24] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-28 20:25:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:25:24] [INFO ] Added : 20 causal constraints over 4 iterations in 260 ms. Result :sat
Minimization took 72 ms.
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 20:25:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2024-05-28 20:25:25] [INFO ] Added : 36 causal constraints over 8 iterations in 203 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-28 20:25:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:25] [INFO ] Added : 22 causal constraints over 5 iterations in 231 ms. Result :sat
Minimization took 98 ms.
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-28 20:25:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 20:25:25] [INFO ] Added : 4 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 20:25:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-28 20:25:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 20:25:26] [INFO ] Added : 15 causal constraints over 3 iterations in 543 ms. Result :sat
Minimization took 125 ms.
[2024-05-28 20:25:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 20:25:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-28 20:25:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 20:25:27] [INFO ] Added : 23 causal constraints over 5 iterations in 413 ms. Result :sat
Minimization took 196 ms.
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 20:25:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:27] [INFO ] Added : 36 causal constraints over 8 iterations in 70 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:25:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:28] [INFO ] Added : 21 causal constraints over 5 iterations in 393 ms. Result :sat
Minimization took 109 ms.
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 20:25:28] [INFO ] Added : 36 causal constraints over 8 iterations in 135 ms. Result :sat
Minimization took 157 ms.
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 20:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 20:25:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-05-28 20:25:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 20:25:29] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 20:25:29] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 306 ms.
[2024-05-28 20:25:29] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 39 ms
Reduce places removed 60 places and 60 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:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 10]
[2024-05-28 20:25:29] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 20:25:30] [INFO ] Computed 152 invariants in 256 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:[10, 10, 62, 61, 4, 1, 3, 11, 10, 10, 244, 10, 10, 10]
RANDOM walk for 10000 steps (560 resets) in 471 ms. (21 steps per ms)
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130008 steps (1357 resets) in 769 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 11, 10, 10, 244, 10, 10, 10]
[2024-05-28 20:25:31] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 20:25:31] [INFO ] Invariant cache hit.
[2024-05-28 20:25:31] [INFO ] [Real]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-28 20:25:31] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-28 20:25:32] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-05-28 20:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:32] [INFO ] [Nat]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-28 20:25:32] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 20:25:34] [INFO ] [Nat]Absence check using state equation in 1303 ms returned sat
[2024-05-28 20:25:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:25:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:25:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 670 ms returned sat
[2024-05-28 20:25:35] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 437 ms.
[2024-05-28 20:25:36] [INFO ] Added : 6 causal constraints over 2 iterations in 1055 ms. Result :sat
Minimization took 702 ms.
[2024-05-28 20:25:37] [INFO ] [Real]Absence check using 145 positive place invariants in 59 ms returned sat
[2024-05-28 20:25:37] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 20:25:38] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2024-05-28 20:25:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:38] [INFO ] [Nat]Absence check using 145 positive place invariants in 56 ms returned sat
[2024-05-28 20:25:38] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-28 20:25:39] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
[2024-05-28 20:25:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:25:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1004 ms returned unknown
[2024-05-28 20:25:40] [INFO ] [Real]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 20:25:40] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-28 20:25:41] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2024-05-28 20:25:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:42] [INFO ] [Nat]Absence check using 145 positive place invariants in 63 ms returned sat
[2024-05-28 20:25:42] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 20:25:43] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2024-05-28 20:25:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:25:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 889 ms returned sat
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 629 places in 888 ms of which 9 ms to minimize.
[2024-05-28 20:25:46] [INFO ] Deduced a trap composed of 318 places in 776 ms of which 6 ms to minimize.
[2024-05-28 20:25:47] [INFO ] Deduced a trap composed of 319 places in 917 ms of which 9 ms to minimize.
[2024-05-28 20:25:47] [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 2
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.verifyPossible(DeadlockTester.java:868)
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:25:47] [INFO ] [Real]Absence check using 145 positive place invariants in 41 ms returned sat
[2024-05-28 20:25:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-28 20:25:48] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-28 20:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:48] [INFO ] [Nat]Absence check using 145 positive place invariants in 38 ms returned sat
[2024-05-28 20:25:48] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-28 20:25:49] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2024-05-28 20:25:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 501 ms returned sat
[2024-05-28 20:25:50] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 494 ms.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 19 places in 467 ms of which 2 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 702 ms
[2024-05-28 20:25:52] [INFO ] Added : 27 causal constraints over 6 iterations in 2459 ms. Result :sat
Minimization took 811 ms.
[2024-05-28 20:25:53] [INFO ] [Real]Absence check using 145 positive place invariants in 60 ms returned sat
[2024-05-28 20:25:53] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned sat
[2024-05-28 20:25:54] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2024-05-28 20:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:55] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2024-05-28 20:25:55] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 20:25:56] [INFO ] [Nat]Absence check using state equation in 1664 ms returned unknown
[2024-05-28 20:25:56] [INFO ] [Real]Absence check using 145 positive place invariants in 40 ms returned sat
[2024-05-28 20:25:56] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 20:25:57] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-05-28 20:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:58] [INFO ] [Nat]Absence check using 145 positive place invariants in 50 ms returned sat
[2024-05-28 20:25:58] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 20:25:59] [INFO ] [Nat]Absence check using state equation in 1718 ms returned sat
[2024-05-28 20:26:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:26:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 901 ms returned sat
[2024-05-28 20:26:01] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 334 ms.
[2024-05-28 20:26:02] [INFO ] Deduced a trap composed of 613 places in 966 ms of which 9 ms to minimize.
[2024-05-28 20:26:02] [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 5
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:26:03] [INFO ] [Real]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 20:26:03] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned unsat
[2024-05-28 20:26:03] [INFO ] [Real]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-28 20:26:03] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 54 ms returned sat
[2024-05-28 20:26:04] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2024-05-28 20:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:04] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 20:26:04] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-28 20:26:06] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2024-05-28 20:26:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 349 ms returned sat
[2024-05-28 20:26:07] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 283 ms.
[2024-05-28 20:26:08] [INFO ] Added : 10 causal constraints over 2 iterations in 1594 ms. Result :unknown
[2024-05-28 20:26:08] [INFO ] [Real]Absence check using 145 positive place invariants in 59 ms returned sat
[2024-05-28 20:26:08] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 20:26:09] [INFO ] [Real]Absence check using state equation in 996 ms returned sat
[2024-05-28 20:26:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:10] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 20:26:10] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-28 20:26:12] [INFO ] [Nat]Absence check using state equation in 1862 ms returned unknown
[2024-05-28 20:26:12] [INFO ] [Real]Absence check using 145 positive place invariants in 79 ms returned sat
[2024-05-28 20:26:12] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 50 ms returned sat
[2024-05-28 20:26:13] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2024-05-28 20:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:14] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 20:26:14] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 45 ms returned sat
[2024-05-28 20:26:15] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-05-28 20:26:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:26:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1003 ms returned unknown
[2024-05-28 20:26:16] [INFO ] [Real]Absence check using 145 positive place invariants in 50 ms returned sat
[2024-05-28 20:26:16] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 20:26:17] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2024-05-28 20:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:17] [INFO ] [Nat]Absence check using 145 positive place invariants in 57 ms returned sat
[2024-05-28 20:26:17] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:26:19] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2024-05-28 20:26:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:26:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1005 ms returned unknown
[2024-05-28 20:26:20] [INFO ] [Real]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 20:26:20] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 20:26:21] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2024-05-28 20:26:21] [INFO ] [Real]Added 1 Read/Feed constraints in 115 ms returned sat
[2024-05-28 20:26:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:21] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 20:26:21] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 20:26:23] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2024-05-28 20:26:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:26:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 610 ms returned sat
[2024-05-28 20:26:24] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 309 ms.
[2024-05-28 20:26:24] [INFO ] Added : 7 causal constraints over 2 iterations in 920 ms. Result :sat
Minimization took 754 ms.
[2024-05-28 20:26:25] [INFO ] [Real]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 20:26:25] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 20:26:26] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2024-05-28 20:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:26:27] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 20:26:27] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-28 20:26:28] [INFO ] [Nat]Absence check using state equation in 1791 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 1, 10, 10, 244, 10, 10, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1] Max Struct:[10, 10, 62, 61, 4, 3, 10, 10, 244, 10, 10, 10]
Support contains 810 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 1220 transition count 2805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 20 place count 1219 transition count 2741
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
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 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 436 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
Running 2727 sub problems to find dead transitions.
[2024-05-28 20:26:29] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2024-05-28 20:26:29] [INFO ] Computed 142 invariants in 168 ms
[2024-05-28 20:26:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1142 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 2727 unsolved
SMT process timed out in 41020ms, After SMT, problems are : Problem set: 0 solved, 2727 unsolved
Search for dead transitions found 0 dead transitions in 41081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41551 ms. Remains : 1152/1234 places, 2738/2810 transitions.
[2024-05-28 20:27:10] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-05-28 20:27:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1] Max Struct:[10, 10, 62, 61, 4, 3, 10, 10, 244, 10, 10, 10]
RANDOM walk for 1000000 steps (69246 resets) in 22893 ms. (43 steps per ms)
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9448473 steps (61969 resets) in 37515 ms. (251 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 1, 1, 4, 3, 1, 4, 4, 3] Max Struct:[10, 10, 62, 61, 10, 10, 244, 10, 10, 10]
[2024-05-28 20:28:10] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-05-28 20:28:10] [INFO ] Invariant cache hit.
[2024-05-28 20:28:11] [INFO ] [Real]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:11] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 18 ms returned unsat
[2024-05-28 20:28:11] [INFO ] [Real]Absence check using 136 positive place invariants in 42 ms returned sat
[2024-05-28 20:28:11] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 39 ms returned sat
[2024-05-28 20:28:12] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2024-05-28 20:28:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:28:12] [INFO ] [Nat]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:12] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 27 ms returned sat
[2024-05-28 20:28:15] [INFO ] [Nat]Absence check using state equation in 2672 ms returned unsat
[2024-05-28 20:28:15] [INFO ] [Real]Absence check using 136 positive place invariants in 47 ms returned sat
[2024-05-28 20:28:15] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned unsat
[2024-05-28 20:28:15] [INFO ] [Real]Absence check using 136 positive place invariants in 49 ms returned sat
[2024-05-28 20:28:15] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 36 ms returned unsat
[2024-05-28 20:28:16] [INFO ] [Real]Absence check using 136 positive place invariants in 53 ms returned sat
[2024-05-28 20:28:16] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned unsat
[2024-05-28 20:28:16] [INFO ] [Real]Absence check using 136 positive place invariants in 45 ms returned sat
[2024-05-28 20:28:16] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 52 ms returned sat
[2024-05-28 20:28:17] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2024-05-28 20:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:28:17] [INFO ] [Nat]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:17] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2024-05-28 20:28:18] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2024-05-28 20:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:28:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 584 ms returned sat
[2024-05-28 20:28:19] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 266 ms.
[2024-05-28 20:28:21] [INFO ] Deduced a trap composed of 548 places in 862 ms of which 6 ms to minimize.
[2024-05-28 20:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1154 ms
[2024-05-28 20:28:21] [INFO ] Added : 10 causal constraints over 2 iterations in 2319 ms. Result :sat
Minimization took 3052 ms.
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned unsat
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 29 ms returned unsat
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive place invariants in 51 ms returned sat
[2024-05-28 20:28:25] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 27 ms returned sat
[2024-05-28 20:28:26] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-28 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:28:26] [INFO ] [Nat]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:26] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 18 ms returned sat
[2024-05-28 20:28:34] [INFO ] [Nat]Absence check using state equation in 7738 ms returned unsat
[2024-05-28 20:28:34] [INFO ] [Real]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 20:28:34] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2024-05-28 20:28:35] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2024-05-28 20:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:28:35] [INFO ] [Nat]Absence check using 136 positive place invariants in 35 ms returned sat
[2024-05-28 20:28:35] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned sat
[2024-05-28 20:28:36] [INFO ] [Nat]Absence check using state equation in 1122 ms returned sat
[2024-05-28 20:28:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 953 ms returned sat
[2024-05-28 20:28:38] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 271 ms.
[2024-05-28 20:28:39] [INFO ] Added : 6 causal constraints over 2 iterations in 1035 ms. Result :sat
Minimization took 3018 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 1, 1, 4, 3, 1, 4, 4, 3] Max Struct:[4, 4, 1, 1, 4, 10, 1, 4, 4, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2738/2738 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2677
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2677
Applied a total of 122 rules in 199 ms. Remains 1091 /1152 variables (removed 61) and now considering 2677/2738 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 1091/1152 places, 2677/2738 transitions.
[2024-05-28 20:28:42] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-28 20:28:42] [INFO ] Computed 142 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (70341 resets) in 15468 ms. (64 steps per ms)
BEST_FIRST walk for 2000002 steps (14289 resets) in 4807 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[10, 10]
[2024-05-28 20:29:02] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:29:02] [INFO ] Invariant cache hit.
[2024-05-28 20:29:03] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-28 20:29:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 20:29:03] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2024-05-28 20:29:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:29:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-28 20:29:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 20:29:05] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2024-05-28 20:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:29:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 488 ms returned sat
[2024-05-28 20:29:05] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 297 ms.
[2024-05-28 20:29:07] [INFO ] Added : 11 causal constraints over 3 iterations in 1683 ms. Result :sat
Minimization took 4502 ms.
[2024-05-28 20:29:12] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-28 20:29:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-28 20:29:13] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2024-05-28 20:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:29:13] [INFO ] [Nat]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 20:29:13] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-28 20:29:14] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2024-05-28 20:29:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 717 ms returned sat
[2024-05-28 20:29:15] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 264 ms.
[2024-05-28 20:29:16] [INFO ] Added : 14 causal constraints over 4 iterations in 1598 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 164 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 127 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:29:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:29:21] [INFO ] Invariant cache hit.
[2024-05-28 20:29:22] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2024-05-28 20:29:22] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:29:22] [INFO ] Invariant cache hit.
[2024-05-28 20:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:29:32] [INFO ] Implicit Places using invariants and state equation in 9767 ms returned []
Implicit Place search using SMT with State Equation took 10910 ms to find 0 implicit places.
[2024-05-28 20:29:32] [INFO ] Redundant transitions in 126 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:29:32] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:29:32] [INFO ] Invariant cache hit.
[2024-05-28 20:29:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50683ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61888 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2775 resets) in 1862 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (314 resets) in 411 ms. (97 steps per ms) remains 4/4 properties
[2024-05-28 20:30:23] [INFO ] Flatten gal took : 617 ms
BEST_FIRST walk for 40004 steps (305 resets) in 417 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (320 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (286 resets) in 382 ms. (104 steps per ms) remains 4/4 properties
[2024-05-28 20:30:24] [INFO ] Flatten gal took : 338 ms
[2024-05-28 20:30:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality385544194915922603.gal : 73 ms
[2024-05-28 20:30:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8760789809317243789.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/ReachabilityCardinality385544194915922603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8760789809317243789.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 ...327
Loading property file /tmp/ReachabilityCardinality8760789809317243789.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 32
Interrupted probabilistic random walk after 168095 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 168095 steps, saw 28815 distinct states, run finished after 3021 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 20:30:27] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:30:27] [INFO ] Invariant cache hit.
[2024-05-28 20:30:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3699 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5675ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 115 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:30:33] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:30:33] [INFO ] Invariant cache hit.
[2024-05-28 20:30:33] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :32 after 512
Detected timeout of ITS tools.
[2024-05-28 20:31:14] [INFO ] Flatten gal took : 161 ms
[2024-05-28 20:31:14] [INFO ] Applying decomposition
[2024-05-28 20:31:14] [INFO ] Flatten gal took : 162 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/graph8777301014447459552.txt' '-o' '/tmp/graph8777301014447459552.bin' '-w' '/tmp/graph8777301014447459552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8777301014447459552.bin' '-l' '-1' '-v' '-w' '/tmp/graph8777301014447459552.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:31:15] [INFO ] Decomposing Gal with order
[2024-05-28 20:31:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:31:15] [INFO ] Removed a total of 1976 redundant transitions.
[2024-05-28 20:31:16] [INFO ] Flatten gal took : 598 ms
[2024-05-28 20:31:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 636 labels/synchronizations in 90 ms.
[2024-05-28 20:31:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5253809436731803317.gal : 39 ms
[2024-05-28 20:31:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15125642476486232295.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/ReachabilityCardinality5253809436731803317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15125642476486232295.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 ...308
Loading property file /tmp/ReachabilityCardinality15125642476486232295.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 45599ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 45639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45767 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2818 resets) in 1590 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (318 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (283 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 237180 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 237180 steps, saw 39465 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-28 20:31:22] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:31:22] [INFO ] Invariant cache hit.
[2024-05-28 20:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:31:31] [INFO ] Deduced a trap composed of 138 places in 675 ms of which 16 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3758 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/3759 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 1/1237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3759 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3759 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18850 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 20391ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 76 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 74 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:31:43] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:31:43] [INFO ] Invariant cache hit.
[2024-05-28 20:31:44] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2024-05-28 20:31:44] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:31:44] [INFO ] Invariant cache hit.
[2024-05-28 20:31:45] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2094
[2024-05-28 20:31:53] [INFO ] Implicit Places using invariants and state equation in 9543 ms returned []
Implicit Place search using SMT with State Equation took 10788 ms to find 0 implicit places.
[2024-05-28 20:31:53] [INFO ] Redundant transitions in 43 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:31:54] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:31:54] [INFO ] Invariant cache hit.
[2024-05-28 20:31:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 timeout
0.0)
(s526 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 54088ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 54123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65051 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[10, 10]
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 20:32:48] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:32:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (669 resets) in 130 ms. (76 steps per ms)
BEST_FIRST walk for 10001 steps (73 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:32:48] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:32:48] [INFO ] Invariant cache hit.
[2024-05-28 20:32:48] [INFO ] [Real]Absence check using 135 positive place invariants in 28 ms returned sat
[2024-05-28 20:32:48] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-28 20:32:49] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-28 20:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:32:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-28 20:32:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 20:32:50] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2024-05-28 20:32:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:32:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 491 ms returned sat
[2024-05-28 20:32:51] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 262 ms.
[2024-05-28 20:32:52] [INFO ] Added : 11 causal constraints over 3 iterations in 1683 ms. Result :sat
Minimization took 705 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 116 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:32:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:32:53] [INFO ] Invariant cache hit.
[2024-05-28 20:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 46782ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 46814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46937 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 20:33:40] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:33:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70256 resets) in 15248 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (7292 resets) in 2667 ms. (374 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:33:58] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:33:58] [INFO ] Invariant cache hit.
[2024-05-28 20:33:58] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-28 20:33:58] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 20:33:59] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-28 20:33:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:33:59] [INFO ] [Nat]Absence check using 135 positive place invariants in 43 ms returned sat
[2024-05-28 20:33:59] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-28 20:34:00] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2024-05-28 20:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:34:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 654 ms returned sat
[2024-05-28 20:34:01] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 210 ms.
[2024-05-28 20:34:02] [INFO ] Added : 11 causal constraints over 3 iterations in 1578 ms. Result :sat
Minimization took 4998 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 107 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 84 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:34:07] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:34:07] [INFO ] Invariant cache hit.
[2024-05-28 20:34:08] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-28 20:34:08] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:34:08] [INFO ] Invariant cache hit.
[2024-05-28 20:34:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:34:17] [INFO ] Implicit Places using invariants and state equation in 8611 ms returned []
Implicit Place search using SMT with State Equation took 9684 ms to find 0 implicit places.
[2024-05-28 20:34:17] [INFO ] Redundant transitions in 213 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:34:17] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:34:17] [INFO ] Invariant cache hit.
[2024-05-28 20:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 53334ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 53370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63369 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 20:35:11] [INFO ] Flatten gal took : 295 ms
[2024-05-28 20:35:11] [INFO ] Flatten gal took : 181 ms
[2024-05-28 20:35:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17180083517902566579.gal : 78 ms
[2024-05-28 20:35:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3600472259796327145.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/ReachabilityCardinality17180083517902566579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3600472259796327145.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
RANDOM walk for 40000 steps (2820 resets) in 2191 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (284 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (345 resets) in 291 ms. (136 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3600472259796327145.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
Interrupted probabilistic random walk after 217534 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 217534 steps, saw 36427 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-28 20:35:15] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:35:15] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8
[2024-05-28 20:35:15] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD size :4 after 32
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) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3758/3759 variables, and 1233 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1090/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3436ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 62 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:35:18] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:35:18] [INFO ] Invariant cache hit.
[2024-05-28 20:35:18] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 512
Detected timeout of ITS tools.
[2024-05-28 20:36:02] [INFO ] Flatten gal took : 137 ms
[2024-05-28 20:36:02] [INFO ] Applying decomposition
[2024-05-28 20:36:02] [INFO ] Flatten gal took : 122 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/graph5513061124856203612.txt' '-o' '/tmp/graph5513061124856203612.bin' '-w' '/tmp/graph5513061124856203612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5513061124856203612.bin' '-l' '-1' '-v' '-w' '/tmp/graph5513061124856203612.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:36:02] [INFO ] Decomposing Gal with order
[2024-05-28 20:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 44084ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 44120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44192 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 20:36:03] [INFO ] Removed a total of 1976 redundant transitions.
[2024-05-28 20:36:03] [INFO ] Flatten gal took : 519 ms
[2024-05-28 20:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 636 labels/synchronizations in 60 ms.
RANDOM walk for 40002 steps (2861 resets) in 1636 ms. (24 steps per ms) remains 1/1 properties
[2024-05-28 20:36:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10993720855124357244.gal : 60 ms
[2024-05-28 20:36:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6391224382797423425.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/ReachabilityCardinality10993720855124357244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6391224382797423425.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 ...308
BEST_FIRST walk for 40004 steps (316 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality6391224382797423425.prop.
Interrupted probabilistic random walk after 278864 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278864 steps, saw 45880 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-28 20:36:06] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:36:06] [INFO ] Invariant cache hit.
[2024-05-28 20:36:06] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4306
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4306 after 4336
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9627 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10883ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4336 after 4342
Applied a total of 0 rules in 101 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 68 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:36:17] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:36:17] [INFO ] Invariant cache hit.
[2024-05-28 20:36:18] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2024-05-28 20:36:18] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:36:18] [INFO ] Invariant cache hit.
[2024-05-28 20:36:19] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4342 after 4405
[2024-05-28 20:36:27] [INFO ] Implicit Places using invariants and state equation in 8293 ms returned []
Implicit Place search using SMT with State Equation took 9572 ms to find 0 implicit places.
[2024-05-28 20:36:27] [INFO ] Redundant transitions in 95 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:36:27] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:36:27] [INFO ] Invariant cache hit.
[2024-05-28 20:36:27] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4405 after 8173
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8173 after 9463
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 64665ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 64715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74483 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10 in 283839 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 20:37:31] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:37:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10001 steps (729 resets) in 237 ms. (42 steps per ms)
BEST_FIRST walk for 10001 steps (63 resets) in 35 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:37:32] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:37:32] [INFO ] Invariant cache hit.
[2024-05-28 20:37:32] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 20:37:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 20:37:33] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-28 20:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:37:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 48 ms returned sat
[2024-05-28 20:37:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 20:37:34] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2024-05-28 20:37:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:37:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 20:37:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 759 ms returned sat
[2024-05-28 20:37:35] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 325 ms.
[2024-05-28 20:37:36] [INFO ] Added : 12 causal constraints over 3 iterations in 1378 ms. Result :sat
Minimization took 781 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 106 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:37:37] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:37:37] [INFO ] Invariant cache hit.
[2024-05-28 20:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 44257ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 44300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44415 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 20:38:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:38:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70515 resets) in 14112 ms. (70 steps per ms)
BEST_FIRST walk for 1000000 steps (7270 resets) in 2404 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:38:38] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:38:38] [INFO ] Invariant cache hit.
[2024-05-28 20:38:38] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-28 20:38:38] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-28 20:38:39] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-28 20:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:38:39] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-28 20:38:39] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 20:38:40] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2024-05-28 20:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:38:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 741 ms returned sat
[2024-05-28 20:38:41] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 277 ms.
[2024-05-28 20:38:43] [INFO ] Added : 14 causal constraints over 4 iterations in 1657 ms. Result :sat
Minimization took 4660 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 114 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 73 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:38:47] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:38:47] [INFO ] Invariant cache hit.
[2024-05-28 20:38:48] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2024-05-28 20:38:48] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:38:48] [INFO ] Invariant cache hit.
[2024-05-28 20:38:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:38:58] [INFO ] Implicit Places using invariants and state equation in 9471 ms returned []
Implicit Place search using SMT with State Equation took 10546 ms to find 0 implicit places.
[2024-05-28 20:38:58] [INFO ] Redundant transitions in 98 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:38:58] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:38:58] [INFO ] Invariant cache hit.
[2024-05-28 20:38:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 55649ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 55692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66427 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 20:39:54] [INFO ] Flatten gal took : 340 ms
RANDOM walk for 40000 steps (2801 resets) in 1618 ms. (24 steps per ms) remains 2/2 properties
[2024-05-28 20:39:54] [INFO ] Flatten gal took : 178 ms
BEST_FIRST walk for 40003 steps (255 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
[2024-05-28 20:39:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3672625078492037639.gal : 114 ms
[2024-05-28 20:39:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7974587077177759202.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/ReachabilityCardinality3672625078492037639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7974587077177759202.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 ...328
BEST_FIRST walk for 40004 steps (320 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7974587077177759202.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
Interrupted probabilistic random walk after 232475 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 232475 steps, saw 38694 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-28 20:39:58] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:39:58] [INFO ] Invariant cache hit.
[2024-05-28 20:39:58] [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) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 32
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 1/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2385 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3696ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 57 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:40:01] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:40:01] [INFO ] Invariant cache hit.
[2024-05-28 20:40:01] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 512
Detected timeout of ITS tools.
[2024-05-28 20:40:45] [INFO ] Flatten gal took : 183 ms
[2024-05-28 20:40:45] [INFO ] Applying decomposition
[2024-05-28 20:40:45] [INFO ] Flatten gal took : 169 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/graph17918674486314816103.txt' '-o' '/tmp/graph17918674486314816103.bin' '-w' '/tmp/graph17918674486314816103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17918674486314816103.bin' '-l' '-1' '-v' '-w' '/tmp/graph17918674486314816103.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:40:45] [INFO ] Decomposing Gal with order
[2024-05-28 20:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:40:46] [INFO ] Removed a total of 1979 redundant transitions.
[2024-05-28 20:40:46] [INFO ] Flatten gal took : 356 ms
[2024-05-28 20:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 53 ms.
[2024-05-28 20:40:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2011686960993118739.gal : 36 ms
[2024-05-28 20:40:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7296903125983649275.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/ReachabilityCardinality2011686960993118739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7296903125983649275.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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 44950ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 44978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45041 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Loading property file /tmp/ReachabilityCardinality7296903125983649275.prop.
RANDOM walk for 40000 steps (2865 resets) in 1267 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 289307 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 289307 steps, saw 47489 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-28 20:40:50] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:40:50] [INFO ] Invariant cache hit.
[2024-05-28 20:40:50] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 79 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 111 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 20:40:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:40:53] [INFO ] Invariant cache hit.
[2024-05-28 20:40:55] [INFO ] Implicit Places using invariants in 1566 ms returned []
[2024-05-28 20:40:55] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:40:55] [INFO ] Invariant cache hit.
[2024-05-28 20:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:41:05] [INFO ] Implicit Places using invariants and state equation in 10074 ms returned []
Implicit Place search using SMT with State Equation took 11658 ms to find 0 implicit places.
[2024-05-28 20:41:05] [INFO ] Redundant transitions in 115 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 20:41:05] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 20:41:05] [INFO ] Invariant cache hit.
[2024-05-28 20:41:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 54731ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 54775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66692 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15 in 268598 ms.
[2024-05-28 20:42:00] [INFO ] Flatten gal took : 196 ms
[2024-05-28 20:42:00] [INFO ] Applying decomposition
[2024-05-28 20:42:00] [INFO ] Flatten gal took : 147 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/graph14949906060804678374.txt' '-o' '/tmp/graph14949906060804678374.bin' '-w' '/tmp/graph14949906060804678374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14949906060804678374.bin' '-l' '-1' '-v' '-w' '/tmp/graph14949906060804678374.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:42:01] [INFO ] Decomposing Gal with order
[2024-05-28 20:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:42:01] [INFO ] Removed a total of 2156 redundant transitions.
[2024-05-28 20:42:01] [INFO ] Flatten gal took : 299 ms
[2024-05-28 20:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 18 ms.
[2024-05-28 20:42:01] [INFO ] Time to serialize gal into /tmp/UpperBounds13622639356821256554.gal : 27 ms
[2024-05-28 20:42:01] [INFO ] Time to serialize properties into /tmp/UpperBounds1393591649145546702.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/UpperBounds13622639356821256554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1393591649145546702.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 ...284
Loading property file /tmp/UpperBounds1393591649145546702.prop.

BK_STOP 1716929015874

--------------------
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-S10J60"
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-S10J60, 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-171654447100429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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