Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716906915540

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 14:35:16] [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 14:35:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:35:16] [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 14:35:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:35:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-05-28 14:35:17] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-28 14:35:17] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:35:17] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:35:17] [INFO ] Computed 26 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 10, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 1, 1, 22, 4, 2, 10, 2, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 14:35:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:35:17] [INFO ] Computed 26 invariants in 4 ms
[2024-05-28 14:35:17] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 14:35:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-28 14:35:17] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-28 14:35:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-28 14:35:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 14:35:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2024-05-28 14:35:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 14:35:18] [INFO ] Added : 8 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 14:35:18] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 19 ms to minimize.
[2024-05-28 14:35:18] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-05-28 14:35:18] [INFO ] Added : 58 causal constraints over 12 iterations in 259 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-28 14:35:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:35:18] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 14:35:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:35:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-28 14:35:18] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2024-05-28 14:35:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 14:35:19] [INFO ] Added : 59 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:35:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2024-05-28 14:35:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 14:35:19] [INFO ] Added : 54 causal constraints over 11 iterations in 103 ms. Result :sat
Minimization took 39 ms.
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 14:35:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 14:35:19] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:35:19] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-28 14:35:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:35:19] [INFO ] Added : 56 causal constraints over 12 iterations in 96 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:35:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 14:35:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 14:35:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 14:35:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:35:20] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:35:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:35:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2024-05-28 14:35:20] [INFO ] Added : 56 causal constraints over 12 iterations in 208 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:35:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 58 ms returned sat
[2024-05-28 14:35:20] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-28 14:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-05-28 14:35:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 14:35:20] [INFO ] Added : 47 causal constraints over 10 iterations in 94 ms. Result :sat
Minimization took 48 ms.
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:35:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:35:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 14:35:20] [INFO ] Added : 58 causal constraints over 12 iterations in 98 ms. Result :sat
Minimization took 55 ms.
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-28 14:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 14:35:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-28 14:35:21] [INFO ] Added : 58 causal constraints over 12 iterations in 143 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 14:35:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 14:35:21] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 14:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:35:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:35:21] [INFO ] Added : 52 causal constraints over 11 iterations in 113 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 14:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 14:35:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 14:35:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2024-05-28 14:35:22] [INFO ] Added : 45 causal constraints over 9 iterations in 273 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 10, 4, 2, 10, 2, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:35:22] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 55 ms.
[2024-05-28 14:35:22] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 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] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 10, 10]
[2024-05-28 14:35:22] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-28 14:35:22] [INFO ] Computed 58 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 2, 2, 3, 1, 1, 4, 2, 10, 2, 10, 10]
RANDOM walk for 10000 steps (3 resets) in 121 ms. (81 steps per ms)
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80004 steps (22 resets) in 394 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[10, 2, 3, 4, 2, 10, 10, 10]
[2024-05-28 14:35:22] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 14:35:22] [INFO ] Invariant cache hit.
[2024-05-28 14:35:23] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2024-05-28 14:35:23] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
[2024-05-28 14:35:23] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 14:35:23] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 41 ms returned sat
[2024-05-28 14:35:24] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2024-05-28 14:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 14:35:24] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned sat
[2024-05-28 14:35:24] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2024-05-28 14:35:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:35:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:35:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 1027 ms returned unknown
[2024-05-28 14:35:26] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2024-05-28 14:35:26] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 63 ms returned sat
[2024-05-28 14:35:27] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2024-05-28 14:35:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 14:35:27] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 41 ms returned sat
[2024-05-28 14:35:29] [INFO ] [Nat]Absence check using state equation in 1642 ms returned sat
[2024-05-28 14:35:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:35:30] [INFO ] [Nat]Added 120 Read/Feed constraints in 1017 ms returned unknown
[2024-05-28 14:35:30] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 14:35:30] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 44 ms returned sat
[2024-05-28 14:35:31] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2024-05-28 14:35:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:35:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 14:35:31] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned sat
[2024-05-28 14:35:32] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2024-05-28 14:35:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:35:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 691 ms returned sat
[2024-05-28 14:35:33] [INFO ] Deduced a trap composed of 387 places in 494 ms of which 5 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:35:35] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:35:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1774 ms
[2024-05-28 14:35:35] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 179 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 40 ms returned unsat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned unsat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-28 14:35:36] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[1, 2, 3, 4, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
Support contains 40 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 337 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-28 14:35:37] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-28 14:35:37] [INFO ] Computed 56 invariants in 41 ms
[2024-05-28 14:35:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-28 14:35:51] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:35:51] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:35:51] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:35:51] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:35:52] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:35:53] [INFO ] Deduced a trap composed of 214 places in 327 ms of which 4 ms to minimize.
[2024-05-28 14:35:53] [INFO ] Deduced a trap composed of 218 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:35:57] [INFO ] Deduced a trap composed of 348 places in 217 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 67 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-28 14:36:11] [INFO ] Deduced a trap composed of 186 places in 382 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 14/14 constraints]
After SMT, in 43345ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43408ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43783 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-05-28 14:36:20] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:36:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
RANDOM walk for 1000000 steps (353 resets) in 4839 ms. (206 steps per ms)
BEST_FIRST walk for 3000003 steps (1170 resets) in 6576 ms. (456 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[2, 3, 4]
[2024-05-28 14:36:32] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:36:32] [INFO ] Invariant cache hit.
[2024-05-28 14:36:32] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 14:36:32] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-28 14:36:32] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-05-28 14:36:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:36:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 14:36:32] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 23 ms returned sat
[2024-05-28 14:36:33] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-28 14:36:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:36:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 882 ms returned sat
[2024-05-28 14:36:34] [INFO ] Deduced a trap composed of 68 places in 402 ms of which 4 ms to minimize.
[2024-05-28 14:36:35] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:36:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 718 ms
[2024-05-28 14:36:35] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 14:36:35] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-28 14:36:35] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-28 14:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:36:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 14:36:35] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-28 14:36:38] [INFO ] [Nat]Absence check using state equation in 2939 ms returned sat
[2024-05-28 14:36:39] [INFO ] [Nat]Added 120 Read/Feed constraints in 534 ms returned sat
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 209 places in 333 ms of which 4 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 4 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2024-05-28 14:36:40] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 96 ms.
[2024-05-28 14:36:41] [INFO ] Added : 38 causal constraints over 8 iterations in 1482 ms. Result :sat
Minimization took 4748 ms.
[2024-05-28 14:36:46] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-28 14:36:46] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 30 ms returned sat
[2024-05-28 14:36:47] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2024-05-28 14:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:36:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 14:36:47] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-28 14:36:48] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2024-05-28 14:36:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 2278 ms returned sat
[2024-05-28 14:36:50] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1746 ms
[2024-05-28 14:36:52] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 131 ms.
[2024-05-28 14:36:53] [INFO ] Added : 18 causal constraints over 4 iterations in 933 ms. Result :sat
Minimization took 4728 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 3, 4]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 73 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 552/552 places, 1362/1362 transitions.
[2024-05-28 14:36:58] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:36:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3, 4]
RANDOM walk for 1000000 steps (349 resets) in 4946 ms. (202 steps per ms)
BEST_FIRST walk for 2000002 steps (254 resets) in 3881 ms. (515 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-05-28 14:37:06] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:37:06] [INFO ] Invariant cache hit.
[2024-05-28 14:37:07] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 14:37:07] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-28 14:37:07] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-28 14:37:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:37:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 14:37:07] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 17 ms returned sat
[2024-05-28 14:37:10] [INFO ] [Nat]Absence check using state equation in 2573 ms returned sat
[2024-05-28 14:37:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:37:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 555 ms returned sat
[2024-05-28 14:37:11] [INFO ] Deduced a trap composed of 209 places in 393 ms of which 5 ms to minimize.
[2024-05-28 14:37:11] [INFO ] Deduced a trap composed of 230 places in 351 ms of which 4 ms to minimize.
[2024-05-28 14:37:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 893 ms
[2024-05-28 14:37:11] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 144 ms.
[2024-05-28 14:37:13] [INFO ] Added : 38 causal constraints over 8 iterations in 1356 ms. Result :sat
Minimization took 5152 ms.
[2024-05-28 14:37:18] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 14:37:18] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-28 14:37:19] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2024-05-28 14:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:37:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 14:37:19] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-28 14:37:20] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2024-05-28 14:37:22] [INFO ] [Nat]Added 120 Read/Feed constraints in 1940 ms returned sat
[2024-05-28 14:37:22] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1744 ms
[2024-05-28 14:37:23] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 107 ms.
[2024-05-28 14:37:24] [INFO ] Added : 18 causal constraints over 4 iterations in 927 ms. Result :sat
Minimization took 5156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[3, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 58 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 38 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-28 14:37:30] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:37:30] [INFO ] Invariant cache hit.
[2024-05-28 14:37:30] [INFO ] Implicit Places using invariants in 834 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 839 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 532 transition count 1352
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 532 transition count 1352
Applied a total of 20 rules in 50 ms. Remains 532 /542 variables (removed 10) and now considering 1352/1362 (removed 10) transitions.
[2024-05-28 14:37:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
// Phase 1: matrix 1332 rows 532 cols
[2024-05-28 14:37:30] [INFO ] Computed 46 invariants in 26 ms
[2024-05-28 14:37:31] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-28 14:37:31] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:31] [INFO ] Invariant cache hit.
[2024-05-28 14:37:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:37:41] [INFO ] Implicit Places using invariants and state equation in 9698 ms returned []
Implicit Place search using SMT with State Equation took 10212 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 532/552 places, 1352/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11141 ms. Remains : 532/552 places, 1352/1362 transitions.
[2024-05-28 14:37:41] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3, 4]
RANDOM walk for 1000000 steps (366 resets) in 4317 ms. (231 steps per ms)
BEST_FIRST walk for 2000000 steps (252 resets) in 3476 ms. (575 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[3, 4]
[2024-05-28 14:37:48] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:48] [INFO ] Invariant cache hit.
[2024-05-28 14:37:49] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 14:37:49] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-28 14:37:49] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-28 14:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:37:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 14:37:49] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-28 14:37:50] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2024-05-28 14:37:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:37:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:37:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 9019 ms returned unknown
[2024-05-28 14:38:00] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 14:38:00] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-28 14:38:00] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-05-28 14:38:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:38:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 14:38:00] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 26 ms returned sat
[2024-05-28 14:38:01] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2024-05-28 14:38:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 1715 ms returned sat
[2024-05-28 14:38:03] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 119 ms.
[2024-05-28 14:38:04] [INFO ] Added : 47 causal constraints over 10 iterations in 1844 ms. Result :sat
Minimization took 6626 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[3, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[3, 4]
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 23 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 22 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:38:11] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:38:11] [INFO ] Invariant cache hit.
[2024-05-28 14:38:12] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-28 14:38:12] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:38:12] [INFO ] Invariant cache hit.
[2024-05-28 14:38:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:38:21] [INFO ] Implicit Places using invariants and state equation in 9613 ms returned []
Implicit Place search using SMT with State Equation took 10168 ms to find 0 implicit places.
[2024-05-28 14:38:21] [INFO ] Redundant transitions in 119 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:38:21] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:38:21] [INFO ] Invariant cache hit.
[2024-05-28 14:38:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:38:35] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 4 ms to minimize.
[2024-05-28 14:38:35] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:38:37] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:38:45] [INFO ] Deduced a trap composed of 203 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:38:47] [INFO ] Deduced a trap composed of 224 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 223 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 186 places in 350 ms of which 4 ms to minimize.
[2024-05-28 14:39:07] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63100ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73451 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:39:25] [INFO ] Flatten gal took : 372 ms
RANDOM walk for 40001 steps (14 resets) in 1570 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
[2024-05-28 14:39:25] [INFO ] Flatten gal took : 265 ms
BEST_FIRST walk for 40003 steps (11 resets) in 486 ms. (82 steps per ms) remains 4/4 properties
[2024-05-28 14:39:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2830651242924112592.gal : 84 ms
[2024-05-28 14:39:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1696044164216902772.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/ReachabilityCardinality2830651242924112592.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1696044164216902772.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 (9 resets) in 488 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 354 ms. (112 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality1696044164216902772.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 29
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :29 after 33
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :33 after 43
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :43 after 69
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :69 after 76
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :76 after 80
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :80 after 474
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :474 after 798
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :798 after 1444
Interrupted probabilistic random walk after 177015 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 177015 steps, saw 103704 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-28 14:39:29] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:39:29] [INFO ] Invariant cache hit.
[2024-05-28 14:39:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1444 after 3624
[2024-05-28 14:39:29] [INFO ] Deduced a trap composed of 218 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:39:30] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:39:30] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:39:30] [INFO ] Deduced a trap composed of 212 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:39:30] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:39:31] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:39:31] [INFO ] Deduced a trap composed of 209 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:39:31] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:39:31] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 2 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:39:33] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1862/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 530/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:39:34] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1862 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1864 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3922 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 8980ms problems are : Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3624 after 7984
Parikh walk visited 0 properties in 3141 ms.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 24 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:39:41] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:39:41] [INFO ] Invariant cache hit.
[2024-05-28 14:39:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:39:54] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 3 ms to minimize.
[2024-05-28 14:39:54] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:40:03] [INFO ] Deduced a trap composed of 203 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 223 places in 286 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 186 places in 329 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :7984 after 17311
Detected timeout of ITS tools.
[2024-05-28 14:40:16] [INFO ] Flatten gal took : 130 ms
[2024-05-28 14:40:16] [INFO ] Applying decomposition
[2024-05-28 14:40:16] [INFO ] Flatten gal took : 94 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/graph17865235727586353356.txt' '-o' '/tmp/graph17865235727586353356.bin' '-w' '/tmp/graph17865235727586353356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17865235727586353356.bin' '-l' '-1' '-v' '-w' '/tmp/graph17865235727586353356.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:40:16] [INFO ] Decomposing Gal with order
[2024-05-28 14:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:40:17] [INFO ] Removed a total of 1139 redundant transitions.
[2024-05-28 14:40:17] [INFO ] Flatten gal took : 410 ms
[2024-05-28 14:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 452 labels/synchronizations in 39 ms.
[2024-05-28 14:40:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7576230998930248751.gal : 18 ms
[2024-05-28 14:40:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18087719418595961165.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/ReachabilityCardinality7576230998930248751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18087719418595961165.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18087719418595961165.prop.
[2024-05-28 14:40:18] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :20 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 66
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :66 after 80
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :80 after 234
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :234 after 1126
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1126 after 1874
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1874 after 3992
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3992 after 9392
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 43497ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43517ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43548 ms. Remains : 532/532 places, 1352/1352 transitions.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :9392 after 22924
RANDOM walk for 40000 steps (14 resets) in 484 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 165263 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 165263 steps, saw 97001 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 14:40:28] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:40:28] [INFO ] Invariant cache hit.
[2024-05-28 14:40:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:40:28] [INFO ] Deduced a trap composed of 218 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:40:29] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:40:29] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 2 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 212 places in 816 ms of which 3 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 209 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:40:31] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:40:31] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:40:31] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 3 ms to minimize.
[2024-05-28 14:40:32] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 4 ms to minimize.
[2024-05-28 14:40:32] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:40:32] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 3 ms to minimize.
[2024-05-28 14:40:33] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/1864 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1864 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 712 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7502 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 388/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:40:36] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1862 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1864 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :22924 after 64752
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Detected timeout of ITS tools.
After SMT solving in domain Int declared 1864/1864 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36822 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 44337ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2813 ms.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 20 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 17 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:41:15] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:41:15] [INFO ] Invariant cache hit.
[2024-05-28 14:41:16] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-28 14:41:16] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:41:16] [INFO ] Invariant cache hit.
[2024-05-28 14:41:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:41:26] [INFO ] Implicit Places using invariants and state equation in 10279 ms returned []
Implicit Place search using SMT with State Equation took 10715 ms to find 0 implicit places.
[2024-05-28 14:41:26] [INFO ] Redundant transitions in 60 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:41:26] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:41:26] [INFO ] Invariant cache hit.
[2024-05-28 14:41:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:41:40] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:41:40] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:41:40] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:41:40] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 196 places in 373 ms of which 3 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:41:52] [INFO ] Deduced a trap composed of 203 places in 288 ms of which 4 ms to minimize.
[2024-05-28 14:41:53] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:41:54] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:42:02] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:42:02] [INFO ] Deduced a trap composed of 186 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 79 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63597ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74416 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[3, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-04
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:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2024-05-28 14:42:29] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:42:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (6 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-28 14:42:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:42:30] [INFO ] Invariant cache hit.
[2024-05-28 14:42:30] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-28 14:42:30] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-28 14:42:30] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-28 14:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:42:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 14:42:30] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-28 14:42:31] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2024-05-28 14:42:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:42:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:42:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 1013 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 48 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:42:32] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:42:32] [INFO ] Invariant cache hit.
[2024-05-28 14:42:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:42:44] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:42:44] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:42:46] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 4 ms to minimize.
[2024-05-28 14:42:46] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:42:48] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:42:56] [INFO ] Deduced a trap composed of 203 places in 313 ms of which 4 ms to minimize.
SMT process timed out in 23438ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 23461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23515 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:42:56] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:42:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (342 resets) in 4339 ms. (230 steps per ms)
BEST_FIRST walk for 1000001 steps (106 resets) in 1753 ms. (570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-28 14:43:02] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:43:02] [INFO ] Invariant cache hit.
[2024-05-28 14:43:02] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-28 14:43:02] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 50 ms returned sat
[2024-05-28 14:43:02] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-05-28 14:43:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:43:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 14:43:03] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 27 ms returned sat
[2024-05-28 14:43:04] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2024-05-28 14:43:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:43:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:43:13] [INFO ] [Nat]Added 120 Read/Feed constraints in 8814 ms returned sat
[2024-05-28 14:43:13] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2024-05-28 14:43:13] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 112 ms.
[2024-05-28 14:43:14] [INFO ] Added : 47 causal constraints over 10 iterations in 1279 ms. Result :sat
Minimization took 5327 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 22 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 21 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:43:20] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:43:20] [INFO ] Invariant cache hit.
[2024-05-28 14:43:20] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 14:43:20] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:43:20] [INFO ] Invariant cache hit.
[2024-05-28 14:43:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:43:30] [INFO ] Implicit Places using invariants and state equation in 10078 ms returned []
Implicit Place search using SMT with State Equation took 10678 ms to find 0 implicit places.
[2024-05-28 14:43:30] [INFO ] Redundant transitions in 38 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:43:30] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:43:30] [INFO ] Invariant cache hit.
[2024-05-28 14:43:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:43:45] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-05-28 14:43:46] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:43:53] [INFO ] Deduced a trap composed of 203 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:43:54] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 2 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 223 places in 216 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 186 places in 321 ms of which 4 ms to minimize.
[2024-05-28 14:44:16] [INFO ] Deduced a trap composed of 79 places in 306 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63762ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74538 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:44:34] [INFO ] Flatten gal took : 100 ms
RANDOM walk for 40000 steps (19 resets) in 409 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
[2024-05-28 14:44:35] [INFO ] Flatten gal took : 272 ms
[2024-05-28 14:44:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2480033077928648384.gal : 27 ms
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
[2024-05-28 14:44:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17215288221810615465.prop : 8 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/ReachabilityCardinality2480033077928648384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17215288221810615465.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17215288221810615465.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 76
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :76 after 80
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :80 after 474
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :474 after 798
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :798 after 1444
Interrupted probabilistic random walk after 201963 steps, run timeout after 3003 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201963 steps, saw 117795 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-28 14:44:38] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:44:38] [INFO ] Invariant cache hit.
[2024-05-28 14:44:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1444 after 3624
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1862/1864 variables, and 703 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3192 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 530/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4205ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 27 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:44:42] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:44:42] [INFO ] Invariant cache hit.
[2024-05-28 14:44:42] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3624 after 7984
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:44:58] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 3 ms to minimize.
[2024-05-28 14:44:58] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:45:00] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 46 places in 335 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7984 after 17311
Detected timeout of ITS tools.
[2024-05-28 14:45:25] [INFO ] Flatten gal took : 114 ms
[2024-05-28 14:45:25] [INFO ] Applying decomposition
[2024-05-28 14:45:25] [INFO ] Flatten gal took : 80 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/graph3432247426851303181.txt' '-o' '/tmp/graph3432247426851303181.bin' '-w' '/tmp/graph3432247426851303181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3432247426851303181.bin' '-l' '-1' '-v' '-w' '/tmp/graph3432247426851303181.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:45:25] [INFO ] Decomposing Gal with order
[2024-05-28 14:45:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:45:25] [INFO ] Removed a total of 1285 redundant transitions.
[2024-05-28 14:45:25] [INFO ] Flatten gal took : 179 ms
[2024-05-28 14:45:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 44 ms.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 57 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 13/13 constraints]
After SMT, in 43482ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43534 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:45:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7881683250122306835.gal : 14 ms
[2024-05-28 14:45:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16097441258021839571.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/ReachabilityCardinality7881683250122306835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16097441258021839571.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 (20 resets) in 685 ms. (58 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16097441258021839571.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 64
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :64 after 178
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :178 after 271
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :271 after 298
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :298 after 748
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :748 after 1313
Interrupted probabilistic random walk after 172067 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172067 steps, saw 100846 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-28 14:45:29] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:45:29] [INFO ] Invariant cache hit.
[2024-05-28 14:45:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1313 after 2608
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:45:31] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 4 ms to minimize.
[2024-05-28 14:45:31] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:45:31] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:45:31] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-28 14:45:31] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:45:32] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:45:32] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:45:32] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2608 after 10123
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:45:34] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3522 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 5099ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 40 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 27 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:45:34] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:45:34] [INFO ] Invariant cache hit.
[2024-05-28 14:45:35] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-28 14:45:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:45:35] [INFO ] Invariant cache hit.
[2024-05-28 14:45:36] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10123 after 27859
[2024-05-28 14:45:45] [INFO ] Implicit Places using invariants and state equation in 9756 ms returned []
Implicit Place search using SMT with State Equation took 10585 ms to find 0 implicit places.
[2024-05-28 14:45:45] [INFO ] Redundant transitions in 26 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:45:45] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:45:45] [INFO ] Invariant cache hit.
[2024-05-28 14:45:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:45:57] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:45:58] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 4 ms to minimize.
[2024-05-28 14:45:58] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:46:00] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:46:09] [INFO ] Deduced a trap composed of 203 places in 233 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :27859 after 68521
[2024-05-28 14:46:10] [INFO ] Deduced a trap composed of 224 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:46:11] [INFO ] Deduced a trap composed of 223 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:46:21] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:46:22] [INFO ] Deduced a trap composed of 186 places in 295 ms of which 4 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 9)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63897ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74577 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-04 in 259361 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T10-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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:46:49] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:46:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (6 resets) in 40 ms. (243 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:46:49] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:46:49] [INFO ] Invariant cache hit.
[2024-05-28 14:46:49] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 14:46:49] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2024-05-28 14:46:49] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-05-28 14:46:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:46:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-28 14:46:50] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-28 14:46:51] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2024-05-28 14:46:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:46:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:46:52] [INFO ] [Nat]Added 120 Read/Feed constraints in 1021 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 39 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:46:52] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:46:52] [INFO ] Invariant cache hit.
[2024-05-28 14:46:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:47:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:47:06] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:47:06] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:47:06] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2024-05-28 14:47:06] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 3 ms to minimize.
[2024-05-28 14:47:07] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:47:21] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:47:30] [INFO ] Deduced a trap composed of 186 places in 232 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 58 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 14/14 constraints]
After SMT, in 43139ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 43160ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43204 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:47:35] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:47:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (362 resets) in 3859 ms. (259 steps per ms)
BEST_FIRST walk for 1000001 steps (129 resets) in 1651 ms. (605 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:47:40] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:47:40] [INFO ] Invariant cache hit.
[2024-05-28 14:47:40] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-28 14:47:41] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 33 ms returned sat
[2024-05-28 14:47:41] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2024-05-28 14:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:47:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 14:47:41] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 35 ms returned sat
[2024-05-28 14:47:42] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-28 14:47:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:47:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 1649 ms returned sat
[2024-05-28 14:47:44] [INFO ] Computed and/alt/rep : 400/908/390 causal constraints (skipped 940 transitions) in 107 ms.
[2024-05-28 14:47:46] [INFO ] Added : 47 causal constraints over 10 iterations in 1914 ms. Result :sat
Minimization took 5413 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 30 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:47:51] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:47:51] [INFO ] Invariant cache hit.
[2024-05-28 14:47:52] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-28 14:47:52] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:47:52] [INFO ] Invariant cache hit.
[2024-05-28 14:47:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:48:01] [INFO ] Implicit Places using invariants and state equation in 9621 ms returned []
Implicit Place search using SMT with State Equation took 10222 ms to find 0 implicit places.
[2024-05-28 14:48:01] [INFO ] Redundant transitions in 24 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:48:01] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:48:01] [INFO ] Invariant cache hit.
[2024-05-28 14:48:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
[2024-05-28 14:48:14] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 4 ms to minimize.
[2024-05-28 14:48:14] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-28 14:48:15] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 203 places in 218 ms of which 2 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 224 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:48:24] [INFO ] Deduced a trap composed of 223 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:48:36] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:48:37] [INFO ] Deduced a trap composed of 186 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:48:45] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 62984ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73296 ms. Remains : 532/532 places, 1352/1352 transitions.
[2024-05-28 14:49:04] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:49:04] [INFO ] Flatten gal took : 82 ms
[2024-05-28 14:49:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15908368502986012392.gal : 25 ms
RANDOM walk for 40000 steps (11 resets) in 610 ms. (65 steps per ms) remains 2/2 properties
[2024-05-28 14:49:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4539904185320589318.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/ReachabilityCardinality15908368502986012392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4539904185320589318.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
BEST_FIRST walk for 40001 steps (8 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 340 ms. (117 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4539904185320589318.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 76
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :76 after 80
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :80 after 474
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :474 after 798
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :798 after 1444
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1444 after 3624
Interrupted probabilistic random walk after 121535 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121535 steps, saw 72119 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-28 14:49:08] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:49:08] [INFO ] Invariant cache hit.
[2024-05-28 14:49:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2894 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:49:11] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 4 ms to minimize.
[2024-05-28 14:49:11] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2024-05-28 14:49:11] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3624 after 7984
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 44 places in 6982 ms of which 28 ms to minimize.
SMT process timed out in 10656ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 38 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:49:18] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:49:19] [INFO ] Invariant cache hit.
[2024-05-28 14:49:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:49:37] [INFO ] Deduced a trap composed of 44 places in 4828 ms of which 27 ms to minimize.
[2024-05-28 14:49:37] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-05-28 14:49:37] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:49:37] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2024-05-28 14:49:39] [INFO ] Deduced a trap composed of 44 places in 1234 ms of which 26 ms to minimize.
[2024-05-28 14:49:39] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7984 after 17311
[2024-05-28 14:49:40] [INFO ] Deduced a trap composed of 44 places in 1243 ms of which 27 ms to minimize.
[2024-05-28 14:49:41] [INFO ] Deduced a trap composed of 44 places in 642 ms of which 0 ms to minimize.
[2024-05-28 14:49:42] [INFO ] Deduced a trap composed of 44 places in 1247 ms of which 26 ms to minimize.
SMT process timed out in 23525ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 23537ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23590 ms. Remains : 532/532 places, 1352/1352 transitions.
RANDOM walk for 40000 steps (16 resets) in 488 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 111212 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 111212 steps, saw 66207 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-28 14:49:45] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:49:45] [INFO ] Invariant cache hit.
[2024-05-28 14:49:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/530 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1862 variables, 530/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1862 variables, 120/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1864 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1864 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:49:47] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 5 ms to minimize.
[2024-05-28 14:49:47] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 5 ms to minimize.
[2024-05-28 14:49:48] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 5 ms to minimize.
[2024-05-28 14:49:48] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 8 ms to minimize.
[2024-05-28 14:49:54] [INFO ] Deduced a trap composed of 44 places in 5987 ms of which 27 ms to minimize.
[2024-05-28 14:49:54] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 1 ms to minimize.
[2024-05-28 14:49:54] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:49:55] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:49:55] [INFO ] Applying decomposition
[2024-05-28 14:49:55] [INFO ] Flatten gal took : 87 ms
[2024-05-28 14:49:55] [INFO ] Deduced a trap composed of 44 places in 752 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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/graph2595613729751806597.txt' '-o' '/tmp/graph2595613729751806597.bin' '-w' '/tmp/graph2595613729751806597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2595613729751806597.bin' '-l' '-1' '-v' '-w' '/tmp/graph2595613729751806597.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:49:55] [INFO ] Decomposing Gal with order
[2024-05-28 14:49:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:49:55] [INFO ] Removed a total of 1396 redundant transitions.
[2024-05-28 14:49:55] [INFO ] Flatten gal took : 205 ms
[2024-05-28 14:49:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 711 labels/synchronizations in 55 ms.
[2024-05-28 14:49:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2772452722313126806.gal : 34 ms
[2024-05-28 14:49:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1180740405358326625.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/ReachabilityCardinality2772452722313126806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1180740405358326625.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
At refinement iteration 10 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality1180740405358326625.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 28
At refinement iteration 11 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 85
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :85 after 151
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 388
[2024-05-28 14:49:58] [INFO ] Deduced a trap composed of 246 places in 453 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12076 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 13492ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2291 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 15 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:50:01] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:50:01] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :388 after 4778
[2024-05-28 14:50:02] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-05-28 14:50:02] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:50:02] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4778 after 9252
[2024-05-28 14:50:07] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9252 after 20661
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :20661 after 49918
[2024-05-28 14:50:38] [INFO ] Performed 508/532 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 14:50:39] [INFO ] Implicit Places using invariants and state equation in 37090 ms returned []
Implicit Place search using SMT with State Equation took 37874 ms to find 0 implicit places.
[2024-05-28 14:50:39] [INFO ] Redundant transitions in 10 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:50:39] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:50:39] [INFO ] Invariant cache hit.
[2024-05-28 14:50:39] [INFO ] State equation strengthened by 120 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:50:53] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:50:54] [INFO ] Deduced a trap composed of 196 places in 414 ms of which 2 ms to minimize.
[2024-05-28 14:50:54] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-05-28 14:50:56] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:51:03] [INFO ] Deduced a trap composed of 203 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:51:04] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:51:05] [INFO ] Deduced a trap composed of 223 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 186 places in 291 ms of which 3 ms to minimize.
[2024-05-28 14:51:26] [INFO ] Deduced a trap composed of 79 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 64585ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 64623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102559 ms. Remains : 532/532 places, 1352/1352 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-10 in 294977 ms.
[2024-05-28 14:51:44] [INFO ] Flatten gal took : 74 ms
[2024-05-28 14:51:44] [INFO ] Applying decomposition
[2024-05-28 14:51:44] [INFO ] Flatten gal took : 44 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/graph10486538172978464171.txt' '-o' '/tmp/graph10486538172978464171.bin' '-w' '/tmp/graph10486538172978464171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10486538172978464171.bin' '-l' '-1' '-v' '-w' '/tmp/graph10486538172978464171.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:51:44] [INFO ] Decomposing Gal with order
[2024-05-28 14:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:51:44] [INFO ] Removed a total of 1392 redundant transitions.
[2024-05-28 14:51:44] [INFO ] Flatten gal took : 200 ms
[2024-05-28 14:51:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 767 labels/synchronizations in 46 ms.
[2024-05-28 14:51:45] [INFO ] Time to serialize gal into /tmp/UpperBounds1828348978679127044.gal : 35 ms
[2024-05-28 14:51:45] [INFO ] Time to serialize properties into /tmp/UpperBounds15736321262932116388.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/UpperBounds1828348978679127044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15736321262932116388.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 ...305
Loading property file /tmp/UpperBounds15736321262932116388.prop.
ITS-tools command line returned an error code 137
[2024-05-28 15:00:56] [INFO ] Applying decomposition
[2024-05-28 15:00:56] [INFO ] Flatten gal took : 58 ms
[2024-05-28 15:00:56] [INFO ] Decomposing Gal with order
[2024-05-28 15:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:00:56] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, Check_Sources_B_0, Check_Sources_E_0, P_1617_0],[AwakeTasks_1, IdleTasks_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, Check_Sources_B_1, Check_Sources_E_1, P_1617_1],[AwakeTasks_2, IdleTasks_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, Check_Sources_B_2, Check_Sources_E_2, P_1617_2],[AwakeTasks_3, IdleTasks_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, Check_Sources_B_3, Check_Sources_E_3, P_1617_3],[AwakeTasks_4, IdleTasks_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, Check_Sources_B_4, Check_Sources_E_4, P_1617_4],[AwakeTasks_5, IdleTasks_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, Check_Sources_B_5, Check_Sources_E_5, P_1617_5],[AwakeTasks_6, IdleTasks_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, Check_Sources_B_6, Check_Sources_E_6, P_1617_6],[AwakeTasks_7, IdleTasks_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, Check_Sources_B_7, Check_Sources_E_7, P_1617_7],[AwakeTasks_8, IdleTasks_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, Check_Sources_B_8, Check_Sources_E_8, P_1617_8],[AwakeTasks_9, IdleTasks_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, Check_Sources_B_9, Check_Sources_E_9, P_1617_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55],[NotifyEventJobQueuedB_56, QueueJobB_56, FetchJobE_56],[NotifyEventJobQueuedB_57, QueueJobB_57, FetchJobE_57],[NotifyEventJobQueuedB_58, QueueJobB_58, FetchJobE_58],[NotifyEventJobQueuedB_59, QueueJobB_59, FetchJobE_59],[NotifyEventJobQueuedB_60, QueueJobB_60, FetchJobE_60],[NotifyEventJobQueuedB_61, QueueJobB_61, FetchJobE_61],[NotifyEventJobQueuedB_62, QueueJobB_62, FetchJobE_62],[NotifyEventJobQueuedB_63, QueueJobB_63, FetchJobE_63],[NotifyEventJobQueuedB_64, QueueJobB_64, FetchJobE_64],[NotifyEventJobQueuedB_65, QueueJobB_65, FetchJobE_65],[NotifyEventJobQueuedB_66, QueueJobB_66, FetchJobE_66],[NotifyEventJobQueuedB_67, QueueJobB_67, FetchJobE_67],[NotifyEventJobQueuedB_68, QueueJobB_68, FetchJobE_68],[NotifyEventJobQueuedB_69, QueueJobB_69, FetchJobE_69],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[Insert_Source_B_0, P_1119_0, P_2579_0],[Insert_Source_B_1, P_1119_1, P_2579_1],[Insert_Source_B_2, P_1119_2, P_2579_2],[Insert_Source_B_3, P_1119_3, P_2579_3],[Insert_Source_B_4, P_1119_4, P_2579_4],[Insert_Source_B_5, P_1119_5, P_2579_5],[Insert_Source_B_6, P_1119_6, P_2579_6],[Insert_Source_B_7, P_1119_7, P_2579_7],[Insert_Source_B_8, P_1119_8, P_2579_8],[Insert_Source_B_9, P_1119_9, P_2579_9],[Insert_Source_B_10, P_1119_10, P_2579_10],[Insert_Source_B_11, P_1119_11, P_2579_11],[Insert_Source_B_12, P_1119_12, P_2579_12],[Insert_Source_B_13, P_1119_13, P_2579_13],[Insert_Source_B_14, P_1119_14, P_2579_14],[Insert_Source_B_15, P_1119_15, P_2579_15],[Insert_Source_B_16, P_1119_16, P_2579_16],[Insert_Source_B_17, P_1119_17, P_2579_17],[Insert_Source_B_18, P_1119_18, P_2579_18],[Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
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 15:00:56] [INFO ] Flatten gal took : 55 ms
[2024-05-28 15:00:56] [INFO ] Time to serialize gal into /tmp/UpperBounds10607160522411552825.gal : 9 ms
[2024-05-28 15:00:56] [INFO ] Time to serialize properties into /tmp/UpperBounds5090648331747319440.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/UpperBounds10607160522411552825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5090648331747319440.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 ...305
Loading property file /tmp/UpperBounds5090648331747319440.prop.
ITS-tools command line returned an error code 137
[2024-05-28 15:10:33] [INFO ] Flatten gal took : 65 ms
[2024-05-28 15:10:33] [INFO ] Input system was already deterministic with 1352 transitions.
[2024-05-28 15:10:33] [INFO ] Transformed 532 places.
[2024-05-28 15:10:33] [INFO ] Transformed 1352 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 15:11:03] [INFO ] Time to serialize gal into /tmp/UpperBounds5331184894030392559.gal : 16 ms
[2024-05-28 15:11:03] [INFO ] Time to serialize properties into /tmp/UpperBounds14507806194411920052.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/UpperBounds5331184894030392559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14507806194411920052.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14507806194411920052.prop.
ITS-tools command line returned an error code 137
Total runtime 2787381 ms.

BK_STOP 1716909704363

--------------------
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="PolyORBLF-COL-S02J06T10"
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 PolyORBLF-COL-S02J06T10, 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-171654446400117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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