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-171654446300093.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-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716904181946

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-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 13:49:43] [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 13:49:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:49:43] [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 13:49:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:49:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-05-28 13:49:44] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-28 13:49:44] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 13:49:44] [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 13:49:44] [INFO ] Computed 26 invariants in 19 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 1, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 13:49:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:49:44] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-28 13:49:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-28 13:49:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 13:49:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 13:49:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:44] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 9 ms to minimize.
[2024-05-28 13:49:44] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 2 ms to minimize.
[2024-05-28 13:49:44] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:49:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-28 13:49:44] [INFO ] Added : 58 causal constraints over 12 iterations in 253 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 13:49:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 13:49:45] [INFO ] Added : 58 causal constraints over 12 iterations in 69 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:45] [INFO ] Added : 9 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 13:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-28 13:49:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 13:49:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 13:49:45] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-28 13:49:45] [INFO ] Added : 61 causal constraints over 13 iterations in 131 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 13:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:49:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 13:49:45] [INFO ] Added : 27 causal constraints over 6 iterations in 36 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 42 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 13:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 13:49:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:46] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 13:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 13:49:46] [INFO ] Added : 54 causal constraints over 11 iterations in 99 ms. Result :sat
Minimization took 41 ms.
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-28 13:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 13:49:46] [INFO ] Added : 3 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 40 ms.
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 13:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-28 13:49:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-28 13:49:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 13:49:46] [INFO ] Added : 44 causal constraints over 10 iterations in 101 ms. Result :sat
Minimization took 38 ms.
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 13:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 13:49:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:47] [INFO ] Added : 54 causal constraints over 11 iterations in 86 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 13:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2024-05-28 13:49:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:47] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 13:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-28 13:49:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-28 13:49:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 13:49:48] [INFO ] Added : 6 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 13:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2024-05-28 13:49:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:48] [INFO ] Added : 60 causal constraints over 12 iterations in 93 ms. Result :sat
Minimization took 71 ms.
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-28 13:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2024-05-28 13:49:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 13:49:48] [INFO ] Added : 27 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 13:49:48] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 13:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 13:49:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 13:49:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 13:49:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2024-05-28 13:49:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-28 13:49:49] [INFO ] Added : 27 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
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 13:49:49] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 94 ms.
[2024-05-28 13:49:49] [INFO ] Unfolded 15 HLPN properties in 0 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, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
[2024-05-28 13:49:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 13:49:49] [INFO ] Computed 54 invariants in 130 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 9, 10, 10, 20]
RANDOM walk for 10000 steps (2 resets) in 179 ms. (55 steps per ms)
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100002 steps (21 resets) in 439 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[10, 2, 2, 2, 20, 20, 4, 9, 10, 20]
[2024-05-28 13:49:50] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:49:50] [INFO ] Invariant cache hit.
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 64 ms returned unsat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned unsat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned unsat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 13:49:50] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned sat
[2024-05-28 13:49:51] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2024-05-28 13:49:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-28 13:49:52] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned sat
[2024-05-28 13:49:53] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2024-05-28 13:49:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:49:53] [INFO ] [Nat]Added 120 Read/Feed constraints in 378 ms returned sat
[2024-05-28 13:49:53] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 175 ms.
[2024-05-28 13:49:55] [INFO ] Added : 65 causal constraints over 14 iterations in 1643 ms. Result :sat
Minimization took 611 ms.
[2024-05-28 13:49:56] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:49:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-05-28 13:49:56] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-05-28 13:49:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:49:57] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2024-05-28 13:49:58] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2024-05-28 13:49:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 298 ms returned sat
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2024-05-28 13:49:59] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 126 ms.
[2024-05-28 13:50:00] [INFO ] Added : 57 causal constraints over 13 iterations in 1200 ms. Result :sat
Minimization took 625 ms.
[2024-05-28 13:50:01] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:50:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned sat
[2024-05-28 13:50:02] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2024-05-28 13:50:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:50:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:50:02] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2024-05-28 13:50:04] [INFO ] [Nat]Absence check using state equation in 1598 ms returned sat
[2024-05-28 13:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 13:50:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 1063 ms returned unknown
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 38 ms returned unsat
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 13:50:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-05-28 13:50:06] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-28 13:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:50:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2024-05-28 13:50:06] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 73 ms returned sat
[2024-05-28 13:50:07] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2024-05-28 13:50:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 458 ms returned sat
[2024-05-28 13:50:08] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 119 ms.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 428 places in 3032 ms of which 25 ms to minimize.
[2024-05-28 13:50:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[1, 1, 1, 1, 20, 20, 4, 2, 1, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 462 place count 520 transition count 1182
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 472 place count 520 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 482 place count 510 transition count 1172
Applied a total of 482 rules in 277 ms. Remains 510 /752 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2024-05-28 13:50:13] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 510 cols
[2024-05-28 13:50:13] [INFO ] Computed 52 invariants in 50 ms
[2024-05-28 13:50:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:50:28] [INFO ] Deduced a trap composed of 181 places in 412 ms of which 3 ms to minimize.
[2024-05-28 13:50:30] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:50:34] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:50:35] [INFO ] Deduced a trap composed of 171 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1662 variables, and 63 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-05-28 13:50:45] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 166 places in 323 ms of which 4 ms to minimize.
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 315 places in 268 ms of which 4 ms to minimize.
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 294 places in 226 ms of which 2 ms to minimize.
[2024-05-28 13:50:51] [INFO ] Deduced a trap composed of 290 places in 270 ms of which 3 ms to minimize.
[2024-05-28 13:50:51] [INFO ] Deduced a trap composed of 288 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:50:51] [INFO ] Deduced a trap composed of 279 places in 265 ms of which 3 ms to minimize.
[2024-05-28 13:50:52] [INFO ] Deduced a trap composed of 291 places in 361 ms of which 4 ms to minimize.
[2024-05-28 13:50:53] [INFO ] Deduced a trap composed of 299 places in 382 ms of which 4 ms to minimize.
[2024-05-28 13:50:53] [INFO ] Deduced a trap composed of 183 places in 341 ms of which 4 ms to minimize.
[2024-05-28 13:50:54] [INFO ] Deduced a trap composed of 299 places in 457 ms of which 8 ms to minimize.
[2024-05-28 13:50:54] [INFO ] Deduced a trap composed of 217 places in 335 ms of which 7 ms to minimize.
[2024-05-28 13:50:55] [INFO ] Deduced a trap composed of 237 places in 414 ms of which 12 ms to minimize.
[2024-05-28 13:50:55] [INFO ] Deduced a trap composed of 306 places in 281 ms of which 3 ms to minimize.
[2024-05-28 13:50:55] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 4 ms to minimize.
[2024-05-28 13:50:55] [INFO ] Deduced a trap composed of 236 places in 288 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1662 variables, and 79 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 29/29 constraints]
After SMT, in 42963ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 43018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43319 ms. Remains : 510/752 places, 1172/1412 transitions.
[2024-05-28 13:50:56] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:50:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (312 resets) in 4436 ms. (225 steps per ms)
BEST_FIRST walk for 4000003 steps (474 resets) in 8444 ms. (473 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-05-28 13:51:09] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:51:09] [INFO ] Invariant cache hit.
[2024-05-28 13:51:09] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 13:51:09] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-28 13:51:10] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2024-05-28 13:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:51:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 13:51:10] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-28 13:51:11] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2024-05-28 13:51:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:51:12] [INFO ] [Nat]Added 120 Read/Feed constraints in 264 ms returned sat
[2024-05-28 13:51:12] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 101 ms.
[2024-05-28 13:51:12] [INFO ] Added : 35 causal constraints over 7 iterations in 674 ms. Result :sat
Minimization took 4505 ms.
[2024-05-28 13:51:17] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 13:51:17] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-28 13:51:17] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2024-05-28 13:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:51:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 13:51:17] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 18 ms returned sat
[2024-05-28 13:51:18] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2024-05-28 13:51:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 384 ms returned sat
[2024-05-28 13:51:18] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 99 ms.
[2024-05-28 13:51:19] [INFO ] Added : 36 causal constraints over 8 iterations in 810 ms. Result :sat
Minimization took 5278 ms.
[2024-05-28 13:51:24] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 13:51:24] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-28 13:51:25] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-05-28 13:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:51:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-28 13:51:25] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 58 ms returned sat
[2024-05-28 13:51:26] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-28 13:51:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 182 ms returned sat
[2024-05-28 13:51:26] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 4 ms to minimize.
[2024-05-28 13:51:27] [INFO ] Deduced a trap composed of 181 places in 349 ms of which 4 ms to minimize.
[2024-05-28 13:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 999 ms
[2024-05-28 13:51:27] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 123 ms.
[2024-05-28 13:51:28] [INFO ] Added : 28 causal constraints over 6 iterations in 753 ms. Result :sat
Minimization took 4501 ms.
[2024-05-28 13:51:32] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 13:51:32] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 16 ms returned sat
[2024-05-28 13:51:33] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-28 13:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:51:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-28 13:51:33] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 33 ms returned sat
[2024-05-28 13:51:34] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2024-05-28 13:51:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 248 ms returned sat
[2024-05-28 13:51:34] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 91 ms.
[2024-05-28 13:51:35] [INFO ] Added : 32 causal constraints over 7 iterations in 709 ms. Result :sat
Minimization took 5227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 48 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 510/510 places, 1172/1172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 28 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-05-28 13:51:40] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:51:40] [INFO ] Invariant cache hit.
[2024-05-28 13:51:44] [INFO ] Implicit Places using invariants in 3971 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 3979 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/510 places, 1172/1172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 490 transition count 1162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 490 transition count 1162
Applied a total of 20 rules in 58 ms. Remains 490 /500 variables (removed 10) and now considering 1162/1172 (removed 10) transitions.
[2024-05-28 13:51:44] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-28 13:51:44] [INFO ] Computed 42 invariants in 37 ms
[2024-05-28 13:51:45] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-28 13:51:45] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:51:45] [INFO ] Invariant cache hit.
[2024-05-28 13:51:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:51:50] [INFO ] Implicit Places using invariants and state equation in 5642 ms returned []
Implicit Place search using SMT with State Equation took 6243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 490/510 places, 1162/1172 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10308 ms. Remains : 490/510 places, 1162/1172 transitions.
[2024-05-28 13:51:50] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:51:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (318 resets) in 3621 ms. (276 steps per ms)
BEST_FIRST walk for 4000002 steps (447 resets) in 6665 ms. (600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-05-28 13:52:01] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:52:01] [INFO ] Invariant cache hit.
[2024-05-28 13:52:01] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 13:52:01] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 47 ms returned sat
[2024-05-28 13:52:01] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-28 13:52:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:52:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 13:52:02] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 13:52:02] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-28 13:52:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:52:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 412 ms returned sat
[2024-05-28 13:52:03] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 4 ms to minimize.
[2024-05-28 13:52:03] [INFO ] Deduced a trap composed of 204 places in 338 ms of which 4 ms to minimize.
[2024-05-28 13:52:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 868 ms
[2024-05-28 13:52:04] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 112 ms.
[2024-05-28 13:52:04] [INFO ] Added : 27 causal constraints over 6 iterations in 668 ms. Result :sat
Minimization took 4080 ms.
[2024-05-28 13:52:08] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-05-28 13:52:09] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 31 ms returned sat
[2024-05-28 13:52:09] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-05-28 13:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:52:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 13:52:09] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 32 ms returned sat
[2024-05-28 13:52:10] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2024-05-28 13:52:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 205 ms returned sat
[2024-05-28 13:52:10] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 143 ms.
[2024-05-28 13:52:11] [INFO ] Deduced a trap composed of 207 places in 420 ms of which 7 ms to minimize.
[2024-05-28 13:52:12] [INFO ] Deduced a trap composed of 199 places in 331 ms of which 3 ms to minimize.
[2024-05-28 13:52:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1037 ms
[2024-05-28 13:52:12] [INFO ] Added : 28 causal constraints over 6 iterations in 1765 ms. Result :sat
Minimization took 3917 ms.
[2024-05-28 13:52:16] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 13:52:16] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-28 13:52:16] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-28 13:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:52:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 13:52:16] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-28 13:52:18] [INFO ] [Nat]Absence check using state equation in 1146 ms returned sat
[2024-05-28 13:52:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 13:52:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 6340 ms returned sat
[2024-05-28 13:52:24] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
[2024-05-28 13:52:25] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 2 ms to minimize.
[2024-05-28 13:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 782 ms
[2024-05-28 13:52:25] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 110 ms.
[2024-05-28 13:52:34] [INFO ] Added : 10 causal constraints over 2 iterations in 9272 ms. Result :unknown
[2024-05-28 13:52:34] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 13:52:34] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 35 ms returned sat
[2024-05-28 13:52:35] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-05-28 13:52:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:52:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 13:52:35] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 13:52:36] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2024-05-28 13:52:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 305 ms returned sat
[2024-05-28 13:52:36] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 111 ms.
[2024-05-28 13:52:38] [INFO ] Deduced a trap composed of 172 places in 408 ms of which 5 ms to minimize.
[2024-05-28 13:52:38] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 4 ms to minimize.
[2024-05-28 13:52:38] [INFO ] Deduced a trap composed of 173 places in 286 ms of which 3 ms to minimize.
[2024-05-28 13:52:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1361 ms
[2024-05-28 13:52:39] [INFO ] Added : 40 causal constraints over 9 iterations in 2559 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 21 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 19 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-05-28 13:52:44] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:52:44] [INFO ] Invariant cache hit.
[2024-05-28 13:52:44] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-28 13:52:44] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:52:44] [INFO ] Invariant cache hit.
[2024-05-28 13:52:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:52:51] [INFO ] Implicit Places using invariants and state equation in 6567 ms returned []
Implicit Place search using SMT with State Equation took 7079 ms to find 0 implicit places.
[2024-05-28 13:52:51] [INFO ] Redundant transitions in 92 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-28 13:52:51] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:52:51] [INFO ] Invariant cache hit.
[2024-05-28 13:52:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 4 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 22 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:53:04] [INFO ] Deduced a trap composed of 179 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:53:04] [INFO ] Deduced a trap composed of 204 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 185 places in 468 ms of which 3 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 206 places in 383 ms of which 3 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 200 places in 380 ms of which 3 ms to minimize.
[2024-05-28 13:53:06] [INFO ] Deduced a trap composed of 185 places in 382 ms of which 3 ms to minimize.
[2024-05-28 13:53:06] [INFO ] Deduced a trap composed of 173 places in 350 ms of which 3 ms to minimize.
[2024-05-28 13:53:07] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:53:09] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 166 places in 313 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 155 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 60 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:53:43] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 4 ms to minimize.
[2024-05-28 13:53:48] [INFO ] Deduced a trap composed of 83 places in 307 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 63 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 23/23 constraints]
After SMT, in 63440ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 63459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70680 ms. Remains : 490/490 places, 1162/1162 transitions.
[2024-05-28 13:53:55] [INFO ] Flatten gal took : 448 ms
RANDOM walk for 40000 steps (15 resets) in 1954 ms. (20 steps per ms) remains 8/8 properties
[2024-05-28 13:53:56] [INFO ] Flatten gal took : 230 ms
[2024-05-28 13:53:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2679040004741151165.gal : 71 ms
BEST_FIRST walk for 40002 steps (13 resets) in 908 ms. (44 steps per ms) remains 8/8 properties
[2024-05-28 13:53:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1865664520814222435.prop : 2 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/ReachabilityCardinality2679040004741151165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1865664520814222435.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
Loading property file /tmp/ReachabilityCardinality1865664520814222435.prop.
BEST_FIRST walk for 40002 steps (11 resets) in 796 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 324 ms. (123 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :8 after 10
BEST_FIRST walk for 40003 steps (11 resets) in 442 ms. (90 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :10 after 50
BEST_FIRST walk for 40001 steps (10 resets) in 415 ms. (96 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :230 after 2678
BEST_FIRST walk for 40002 steps (9 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2678 after 3542
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3542 after 3875
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3875 after 5804
Interrupted probabilistic random walk after 308758 steps, run timeout after 6001 ms. (steps per millisecond=51 ) properties seen :0 out of 8
Probabilistic random walk after 308758 steps, saw 174834 distinct states, run finished after 6004 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-28 13:54:03] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:54:03] [INFO ] Invariant cache hit.
[2024-05-28 13:54:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :5804 after 9089
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 5/663 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 0/663 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1632 variables, 2/665 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1632 variables, 1/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 666 constraints, problems are : Problem set: 5 solved, 3 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 4924ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 786 ms.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 55 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-28 13:54:09] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:54:09] [INFO ] Invariant cache hit.
[2024-05-28 13:54:09] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :9089 after 11659
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 3 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 179 places in 509 ms of which 29 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 204 places in 490 ms of which 4 ms to minimize.
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 185 places in 475 ms of which 3 ms to minimize.
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 206 places in 413 ms of which 3 ms to minimize.
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 200 places in 409 ms of which 3 ms to minimize.
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 185 places in 377 ms of which 4 ms to minimize.
[2024-05-28 13:54:25] [INFO ] Deduced a trap composed of 173 places in 547 ms of which 4 ms to minimize.
[2024-05-28 13:54:26] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 67 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 58 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :11659 after 223488
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 13:54:46] [INFO ] Flatten gal took : 186 ms
[2024-05-28 13:54:46] [INFO ] Applying decomposition
[2024-05-28 13:54:46] [INFO ] Flatten gal took : 133 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/graph6112934154181802316.txt' '-o' '/tmp/graph6112934154181802316.bin' '-w' '/tmp/graph6112934154181802316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6112934154181802316.bin' '-l' '-1' '-v' '-w' '/tmp/graph6112934154181802316.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:54:47] [INFO ] Decomposing Gal with order
[2024-05-28 13:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:54:47] [INFO ] Removed a total of 873 redundant transitions.
[2024-05-28 13:54:48] [INFO ] Flatten gal took : 499 ms
[2024-05-28 13:54:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 865 labels/synchronizations in 100 ms.
[2024-05-28 13:54:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16880028942679141926.gal : 30 ms
[2024-05-28 13:54:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12151223289356806959.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/ReachabilityCardinality16880028942679141926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12151223289356806959.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12151223289356806959.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 50
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :50 after 76
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :76 after 130
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :130 after 440
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :440 after 758
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :758 after 1106
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1106 after 1632
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1632 after 3294
[2024-05-28 13:54:51] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 60 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 20/20 constraints]
After SMT, in 43470ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 43494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43556 ms. Remains : 490/490 places, 1162/1162 transitions.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3294 after 14520
RANDOM walk for 40000 steps (15 resets) in 967 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 152461 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 152461 steps, saw 88556 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-28 13:54:56] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:54:56] [INFO ] Invariant cache hit.
[2024-05-28 13:54:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 11 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 12 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 11 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 184 places in 291 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1632 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1632 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:03] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 181 places in 324 ms of which 16 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1632 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 667 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8113 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 9780ms problems are : Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :14520 after 40710
Parikh walk visited 0 properties in 6844 ms.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 33 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 18 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-05-28 13:55:12] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:55:13] [INFO ] Invariant cache hit.
[2024-05-28 13:55:13] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-28 13:55:13] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:55:13] [INFO ] Invariant cache hit.
[2024-05-28 13:55:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:55:19] [INFO ] Implicit Places using invariants and state equation in 6064 ms returned []
Implicit Place search using SMT with State Equation took 6823 ms to find 0 implicit places.
[2024-05-28 13:55:19] [INFO ] Redundant transitions in 35 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-28 13:55:19] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:55:19] [INFO ] Invariant cache hit.
[2024-05-28 13:55:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 13:55:31] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:55:31] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2024-05-28 13:55:31] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:55:31] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:55:31] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2024-05-28 13:55:32] [INFO ] Deduced a trap composed of 41 places in 336 ms of which 0 ms to minimize.
[2024-05-28 13:55:32] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:55:32] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-28 13:55:32] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:55:33] [INFO ] Deduced a trap composed of 179 places in 344 ms of which 5 ms to minimize.
[2024-05-28 13:55:33] [INFO ] Deduced a trap composed of 204 places in 331 ms of which 3 ms to minimize.
[2024-05-28 13:55:33] [INFO ] Deduced a trap composed of 185 places in 301 ms of which 3 ms to minimize.
[2024-05-28 13:55:34] [INFO ] Deduced a trap composed of 206 places in 332 ms of which 3 ms to minimize.
[2024-05-28 13:55:34] [INFO ] Deduced a trap composed of 200 places in 311 ms of which 3 ms to minimize.
[2024-05-28 13:55:34] [INFO ] Deduced a trap composed of 185 places in 329 ms of which 3 ms to minimize.
[2024-05-28 13:55:35] [INFO ] Deduced a trap composed of 173 places in 483 ms of which 6 ms to minimize.
[2024-05-28 13:55:36] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:55:38] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 13:55:44] [INFO ] Deduced a trap composed of 166 places in 361 ms of which 6 ms to minimize.
[2024-05-28 13:55:45] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 60 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 13:55:56] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:56:16] [INFO ] Deduced a trap composed of 181 places in 300 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 62 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 22/22 constraints]
After SMT, in 63049ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 63060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69958 ms. Remains : 490/490 places, 1162/1162 transitions.
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[2, 2, 2] Max Struct:[20, 20, 20]
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-28 13:56:22] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:56:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (3 resets) in 57 ms. (172 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 13:56:23] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 13:56:23] [INFO ] Invariant cache hit.
[2024-05-28 13:56:23] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 13:56:23] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 42 ms returned sat
[2024-05-28 13:56:23] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-28 13:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:56:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-28 13:56:23] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-28 13:56:24] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2024-05-28 13:56:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:56:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 306 ms returned sat
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 23 places in 537 ms of which 7 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 204 places in 508 ms of which 7 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1218 ms
[2024-05-28 13:56:25] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 76 ms.
[2024-05-28 13:56:26] [INFO ] Added : 27 causal constraints over 6 iterations in 508 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 105 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-05-28 13:56:27] [INFO ] Computed 42 invariants in 45 ms
[2024-05-28 13:56:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:56:39] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:56:39] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:56:39] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:56:39] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:56:39] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:56:46] [INFO ] Deduced a trap composed of 168 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 202 places in 296 ms of which 3 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 170 places in 278 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 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 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 54 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:56:52] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:57:00] [INFO ] Deduced a trap composed of 290 places in 301 ms of which 3 ms to minimize.
[2024-05-28 13:57:01] [INFO ] Deduced a trap composed of 154 places in 300 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 17/17 constraints]
After SMT, in 43705ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 43736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43858 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-05-28 13:57:10] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:57:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (299 resets) in 3913 ms. (255 steps per ms)
BEST_FIRST walk for 1000001 steps (133 resets) in 1712 ms. (583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 13:57:16] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:57:16] [INFO ] Invariant cache hit.
[2024-05-28 13:57:16] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 13:57:16] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 29 ms returned sat
[2024-05-28 13:57:17] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-05-28 13:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:57:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-28 13:57:17] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 13:57:17] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-28 13:57:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:57:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 616 ms returned sat
[2024-05-28 13:57:18] [INFO ] Deduced a trap composed of 204 places in 382 ms of which 4 ms to minimize.
[2024-05-28 13:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 547 ms
[2024-05-28 13:57:18] [INFO ] Computed and/alt/rep : 370/818/360 causal constraints (skipped 770 transitions) in 96 ms.
[2024-05-28 13:57:19] [INFO ] Added : 29 causal constraints over 6 iterations in 919 ms. Result :sat
Minimization took 4546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 31 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-28 13:57:24] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:57:24] [INFO ] Invariant cache hit.
[2024-05-28 13:57:25] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-28 13:57:25] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:57:25] [INFO ] Invariant cache hit.
[2024-05-28 13:57:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:57:30] [INFO ] Implicit Places using invariants and state equation in 5861 ms returned []
Implicit Place search using SMT with State Equation took 6520 ms to find 0 implicit places.
[2024-05-28 13:57:30] [INFO ] Redundant transitions in 28 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-28 13:57:30] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:57:30] [INFO ] Invariant cache hit.
[2024-05-28 13:57:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:57:43] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:57:43] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:57:44] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:57:45] [INFO ] Deduced a trap composed of 40 places in 382 ms of which 0 ms to minimize.
[2024-05-28 13:57:45] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:57:45] [INFO ] Deduced a trap composed of 210 places in 324 ms of which 3 ms to minimize.
[2024-05-28 13:57:46] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-05-28 13:57:46] [INFO ] Deduced a trap composed of 188 places in 316 ms of which 3 ms to minimize.
[2024-05-28 13:57:46] [INFO ] Deduced a trap composed of 181 places in 350 ms of which 3 ms to minimize.
[2024-05-28 13:57:47] [INFO ] Deduced a trap composed of 190 places in 305 ms of which 3 ms to minimize.
[2024-05-28 13:57:47] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 290 places in 307 ms of which 4 ms to minimize.
[2024-05-28 13:58:09] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:58:13] [INFO ] Deduced a trap composed of 244 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:58:14] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 4 ms to minimize.
[2024-05-28 13:58:14] [INFO ] Deduced a trap composed of 193 places in 287 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 62 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 22/22 constraints]
After SMT, in 62427ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69050 ms. Remains : 480/480 places, 1152/1152 transitions.
[2024-05-28 13:58:33] [INFO ] Flatten gal took : 207 ms
RANDOM walk for 40000 steps (14 resets) in 823 ms. (48 steps per ms) remains 2/2 properties
[2024-05-28 13:58:33] [INFO ] Flatten gal took : 136 ms
[2024-05-28 13:58:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7939871065826194716.gal : 14 ms
[2024-05-28 13:58:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7273764931975507305.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/ReachabilityCardinality7939871065826194716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7273764931975507305.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (11 resets) in 350 ms. (113 steps per ms) remains 2/2 properties

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 40001 steps (12 resets) in 418 ms. (95 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7273764931975507305.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 13
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14 after 51
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :51 after 88
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :88 after 172
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 996
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :996 after 6278
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6278 after 25081
Interrupted probabilistic random walk after 216230 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 216230 steps, saw 123221 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-28 13:58:36] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:58:36] [INFO ] Invariant cache hit.
[2024-05-28 13:58:36] [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
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 13:58:37] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:58:37] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1612 variables, 2/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 1/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 644 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 13:58:38] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:58:38] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:58:38] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:58:38] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/478 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1132/1610 variables, 478/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1612 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3208ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 30 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-28 13:58:40] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:58:40] [INFO ] Invariant cache hit.
[2024-05-28 13:58:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:58:50] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:58:50] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 37 places in 330 ms of which 2 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 210 places in 342 ms of which 3 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 164 places in 315 ms of which 3 ms to minimize.
[2024-05-28 13:58:53] [INFO ] Deduced a trap composed of 188 places in 238 ms of which 3 ms to minimize.
[2024-05-28 13:58:53] [INFO ] Deduced a trap composed of 181 places in 232 ms of which 3 ms to minimize.
[2024-05-28 13:58:53] [INFO ] Deduced a trap composed of 190 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:58:53] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :44820 after 52927
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:59:07] [INFO ] Deduced a trap composed of 290 places in 279 ms of which 3 ms to minimize.
[2024-05-28 13:59:08] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 244 places in 265 ms of which 3 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 3 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 193 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 62 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 22/22 constraints]
After SMT, in 42842ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42896 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40001 steps (14 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2024-05-28 13:59:23] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:59:23] [INFO ] Applying decomposition
[2024-05-28 13:59:24] [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/graph633228467632198157.txt' '-o' '/tmp/graph633228467632198157.bin' '-w' '/tmp/graph633228467632198157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph633228467632198157.bin' '-l' '-1' '-v' '-w' '/tmp/graph633228467632198157.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:59:24] [INFO ] Decomposing Gal with order
[2024-05-28 13:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:59:24] [INFO ] Removed a total of 928 redundant transitions.
[2024-05-28 13:59:24] [INFO ] Flatten gal took : 136 ms
[2024-05-28 13:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 27 ms.
[2024-05-28 13:59:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14992030579674386211.gal : 15 ms
[2024-05-28 13:59:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9505630791344021674.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/ReachabilityCardinality14992030579674386211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9505630791344021674.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/ReachabilityCardinality9505630791344021674.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 50
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50 after 130
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :130 after 699
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :699 after 816
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :816 after 1230
Interrupted probabilistic random walk after 287402 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 287402 steps, saw 162343 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-28 13:59:26] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:59:26] [INFO ] Invariant cache hit.
[2024-05-28 13:59:26] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1230 after 2980
At refinement iteration 13 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-28 13:59:28] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:59:28] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:59:28] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:59:28] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2980 after 15972
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1610 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1612 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 650 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 23 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 22 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-28 13:59:29] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:59:29] [INFO ] Invariant cache hit.
[2024-05-28 13:59:30] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-28 13:59:30] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:59:30] [INFO ] Invariant cache hit.
[2024-05-28 13:59:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:59:35] [INFO ] Implicit Places using invariants and state equation in 5503 ms returned []
Implicit Place search using SMT with State Equation took 5953 ms to find 0 implicit places.
[2024-05-28 13:59:35] [INFO ] Redundant transitions in 19 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-28 13:59:35] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 13:59:35] [INFO ] Invariant cache hit.
[2024-05-28 13:59:35] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :51840 after 51906
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 210 places in 236 ms of which 2 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 188 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 181 places in 212 ms of which 2 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 190 places in 233 ms of which 3 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 166 places in 373 ms of which 6 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :51906 after 72592
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 59 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:00:14] [INFO ] Deduced a trap composed of 306 places in 340 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 65 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 25/25 constraints]
After SMT, in 63172ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 63197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69211 ms. Remains : 480/480 places, 1152/1152 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05 in 256113 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-28 14:00:39] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-28 14:00:39] [INFO ] Computed 42 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (5 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:00:39] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 14:00:39] [INFO ] Invariant cache hit.
[2024-05-28 14:00:39] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 14:00:39] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-28 14:00:39] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-05-28 14:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:00:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 14:00:39] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:00:40] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2024-05-28 14:00:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:00:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 282 ms returned sat
[2024-05-28 14:00:40] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 109 ms.
[2024-05-28 14:00:41] [INFO ] Deduced a trap composed of 207 places in 416 ms of which 4 ms to minimize.
[2024-05-28 14:00:42] [INFO ] Deduced a trap composed of 199 places in 393 ms of which 4 ms to minimize.
[2024-05-28 14:00:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1016 ms
[2024-05-28 14:00:42] [INFO ] Added : 28 causal constraints over 6 iterations in 1845 ms. Result :sat
Minimization took 543 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 490 transition count 1152
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 90 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-28 14:00:43] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-05-28 14:00:43] [INFO ] Computed 42 invariants in 22 ms
[2024-05-28 14:00:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:00:53] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 4 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 4 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-05-28 14:00:54] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:00:55] [INFO ] Deduced a trap composed of 182 places in 406 ms of which 4 ms to minimize.
[2024-05-28 14:00:55] [INFO ] Deduced a trap composed of 219 places in 315 ms of which 3 ms to minimize.
[2024-05-28 14:00:56] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:00:56] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:00:57] [INFO ] Deduced a trap composed of 190 places in 323 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 55 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:01:10] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 5 ms to minimize.
[2024-05-28 14:01:10] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 5 ms to minimize.
[2024-05-28 14:01:22] [INFO ] Deduced a trap composed of 177 places in 312 ms of which 6 ms to minimize.
[2024-05-28 14:01:24] [INFO ] Deduced a trap composed of 96 places in 347 ms of which 4 ms to minimize.
[2024-05-28 14:01:24] [INFO ] Deduced a trap composed of 139 places in 278 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 60 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 20/20 constraints]
After SMT, in 42631ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42647ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42741 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-05-28 14:01:25] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:01:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (333 resets) in 3357 ms. (297 steps per ms)
BEST_FIRST walk for 1000001 steps (125 resets) in 1614 ms. (619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:01:30] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:01:30] [INFO ] Invariant cache hit.
[2024-05-28 14:01:30] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:01:30] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 15 ms returned sat
[2024-05-28 14:01:31] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-28 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:01:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-28 14:01:31] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 26 ms returned sat
[2024-05-28 14:01:31] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-05-28 14:01:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:01:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 459 ms returned sat
[2024-05-28 14:01:32] [INFO ] Deduced a trap composed of 186 places in 307 ms of which 3 ms to minimize.
[2024-05-28 14:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 563 ms
[2024-05-28 14:01:33] [INFO ] Computed and/alt/rep : 460/1018/450 causal constraints (skipped 680 transitions) in 76 ms.
[2024-05-28 14:01:33] [INFO ] Added : 27 causal constraints over 6 iterations in 489 ms. Result :sat
Minimization took 4733 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 57 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 41 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-28 14:01:38] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:01:38] [INFO ] Invariant cache hit.
[2024-05-28 14:01:38] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-28 14:01:38] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:01:38] [INFO ] Invariant cache hit.
[2024-05-28 14:01:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:01:45] [INFO ] Implicit Places using invariants and state equation in 6440 ms returned []
Implicit Place search using SMT with State Equation took 6993 ms to find 0 implicit places.
[2024-05-28 14:01:45] [INFO ] Redundant transitions in 19 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-28 14:01:45] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:01:45] [INFO ] Invariant cache hit.
[2024-05-28 14:01:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:01:56] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 218 places in 295 ms of which 4 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 181 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:01:59] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:01:59] [INFO ] Deduced a trap composed of 190 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:02:00] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 32765ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 32800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39906 ms. Remains : 480/480 places, 1152/1152 transitions.
[2024-05-28 14:02:18] [INFO ] Flatten gal took : 81 ms
RANDOM walk for 40000 steps (18 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
[2024-05-28 14:02:18] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:02:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12311368642893290010.gal : 10 ms
[2024-05-28 14:02:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11757256151680292059.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/ReachabilityCardinality12311368642893290010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11757256151680292059.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (11 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11757256151680292059.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :230 after 2102
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2102 after 2894
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2894 after 3227
Interrupted probabilistic random walk after 172252 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172252 steps, saw 99389 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-28 14:02:21] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:02:21] [INFO ] Invariant cache hit.
[2024-05-28 14:02:21] [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) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:02:21] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3227 after 5156
At refinement iteration 10 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1612 variables, 2/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:02:23] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:02:23] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:02:24] [INFO ] Deduced a trap composed of 181 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:02:24] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:02:24] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/478 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1132/1610 variables, 478/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1612 variables, and 651 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 3925ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 30 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-28 14:02:25] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:02:25] [INFO ] Invariant cache hit.
[2024-05-28 14:02:25] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5156 after 8416
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8416 after 10986
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 58 places in 353 ms of which 3 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 2 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:02:37] [INFO ] Deduced a trap composed of 218 places in 333 ms of which 5 ms to minimize.
[2024-05-28 14:02:37] [INFO ] Deduced a trap composed of 181 places in 298 ms of which 4 ms to minimize.
[2024-05-28 14:02:38] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:02:38] [INFO ] Deduced a trap composed of 190 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:02:39] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 56 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:02:50] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10986 after 217911
[2024-05-28 14:02:53] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 171 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 61 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 21/21 constraints]
After SMT, in 42783ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42839 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (15 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2024-05-28 14:03:08] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:03:08] [INFO ] Applying decomposition
[2024-05-28 14:03:08] [INFO ] Flatten gal took : 36 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/graph16559142043140808366.txt' '-o' '/tmp/graph16559142043140808366.bin' '-w' '/tmp/graph16559142043140808366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16559142043140808366.bin' '-l' '-1' '-v' '-w' '/tmp/graph16559142043140808366.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:03:08] [INFO ] Decomposing Gal with order
[2024-05-28 14:03:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:03:08] [INFO ] Removed a total of 862 redundant transitions.
[2024-05-28 14:03:08] [INFO ] Flatten gal took : 83 ms
[2024-05-28 14:03:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 12 ms.
[2024-05-28 14:03:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15954938731529937070.gal : 8 ms
[2024-05-28 14:03:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16829858024715606024.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/ReachabilityCardinality15954938731529937070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16829858024715606024.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16829858024715606024.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 38
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 50
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50 after 130
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :130 after 539
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :539 after 908
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :908 after 1106
Interrupted probabilistic random walk after 303602 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 303602 steps, saw 171497 distinct states, run finished after 3003 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-28 14:03:11] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:03:11] [INFO ] Invariant cache hit.
[2024-05-28 14:03:11] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1106 after 2100
At refinement iteration 9 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:03:12] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 4 ms to minimize.
[2024-05-28 14:03:12] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2100 after 8734
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1132/1610 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1610 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1612 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1612 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4100 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4915ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-28 14:03:16] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:03:16] [INFO ] Invariant cache hit.
[2024-05-28 14:03:16] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 14:03:16] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:03:16] [INFO ] Invariant cache hit.
[2024-05-28 14:03:17] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8734 after 29964
[2024-05-28 14:03:23] [INFO ] Implicit Places using invariants and state equation in 6335 ms returned []
Implicit Place search using SMT with State Equation took 6712 ms to find 0 implicit places.
[2024-05-28 14:03:23] [INFO ] Redundant transitions in 18 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-28 14:03:23] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:03:23] [INFO ] Invariant cache hit.
[2024-05-28 14:03:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:03:36] [INFO ] Deduced a trap composed of 218 places in 315 ms of which 3 ms to minimize.
[2024-05-28 14:03:36] [INFO ] Deduced a trap composed of 181 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:03:37] [INFO ] Deduced a trap composed of 198 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:03:37] [INFO ] Deduced a trap composed of 190 places in 264 ms of which 3 ms to minimize.
[2024-05-28 14:03:38] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :29964 after 52726
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 56 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-28 14:03:57] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:04:01] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-28 14:04:04] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-28 14:04:07] [INFO ] Deduced a trap composed of 166 places in 303 ms of which 3 ms to minimize.
[2024-05-28 14:04:08] [INFO ] Deduced a trap composed of 171 places in 307 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 61 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 21/21 constraints]
After SMT, in 62953ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69741 ms. Remains : 480/480 places, 1152/1152 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06 in 227121 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-28 14:04:26] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-28 14:04:26] [INFO ] Computed 42 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (4 resets) in 88 ms. (112 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:04:26] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 14:04:26] [INFO ] Invariant cache hit.
[2024-05-28 14:04:26] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 14:04:26] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 14:04:26] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-05-28 14:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:04:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 14:04:27] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-28 14:04:27] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-28 14:04:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:04:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 209 ms returned sat
[2024-05-28 14:04:28] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 97 ms.
[2024-05-28 14:04:29] [INFO ] Deduced a trap composed of 172 places in 322 ms of which 4 ms to minimize.
[2024-05-28 14:04:29] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 3 ms to minimize.
[2024-05-28 14:04:30] [INFO ] Deduced a trap composed of 173 places in 343 ms of which 4 ms to minimize.
[2024-05-28 14:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1381 ms
[2024-05-28 14:04:30] [INFO ] Added : 40 causal constraints over 9 iterations in 2443 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 480 transition count 1142
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 470 transition count 1142
Applied a total of 40 rules in 77 ms. Remains 470 /490 variables (removed 20) and now considering 1142/1162 (removed 20) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-28 14:04:31] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 470 cols
[2024-05-28 14:04:31] [INFO ] Computed 42 invariants in 30 ms
[2024-05-28 14:04:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:04:43] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:04:43] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:04:43] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:04:43] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:04:46] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2024-05-28 14:04:46] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:04:51] [INFO ] Deduced a trap composed of 280 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 52 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 4)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(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 1)
(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 1)
(s97 0)
(s98 1)
(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 9)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 1)
(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 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(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)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 3)
(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 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(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 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(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 468/1592 variables, and 56 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 16/16 constraints]
After SMT, in 43118ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 43141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43223 ms. Remains : 470/490 places, 1142/1162 transitions.
[2024-05-28 14:05:14] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:05:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (340 resets) in 3856 ms. (259 steps per ms)
BEST_FIRST walk for 1000001 steps (119 resets) in 1905 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:05:19] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:05:19] [INFO ] Invariant cache hit.
[2024-05-28 14:05:20] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 14:05:20] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-28 14:05:20] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2024-05-28 14:05:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:05:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 14:05:20] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-28 14:05:21] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2024-05-28 14:05:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:05:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 264 ms returned sat
[2024-05-28 14:05:21] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 770 transitions) in 94 ms.
[2024-05-28 14:05:22] [INFO ] Added : 22 causal constraints over 5 iterations in 400 ms. Result :sat
Minimization took 4284 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 34 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 27 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-28 14:05:27] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:05:27] [INFO ] Invariant cache hit.
[2024-05-28 14:05:27] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-28 14:05:27] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:05:27] [INFO ] Invariant cache hit.
[2024-05-28 14:05:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:05:33] [INFO ] Implicit Places using invariants and state equation in 5933 ms returned []
Implicit Place search using SMT with State Equation took 6462 ms to find 0 implicit places.
[2024-05-28 14:05:33] [INFO ] Redundant transitions in 23 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-05-28 14:05:33] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:05:33] [INFO ] Invariant cache hit.
[2024-05-28 14:05:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:05:44] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:05:45] [INFO ] Deduced a trap composed of 182 places in 292 ms of which 3 ms to minimize.
[2024-05-28 14:05:48] [INFO ] Deduced a trap composed of 280 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:05:52] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:05:53] [INFO ] Deduced a trap composed of 176 places in 463 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:06:11] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:06:11] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:06:19] [INFO ] Deduced a trap composed of 171 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:06:29] [INFO ] Deduced a trap composed of 172 places in 332 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 59 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 19/19 constraints]
After SMT, in 63055ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 63078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69607 ms. Remains : 470/470 places, 1142/1142 transitions.
[2024-05-28 14:06:36] [INFO ] Flatten gal took : 78 ms
[2024-05-28 14:06:36] [INFO ] Flatten gal took : 56 ms
[2024-05-28 14:06:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1749238488600884755.gal : 17 ms
[2024-05-28 14:06:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10249753907725414453.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/ReachabilityCardinality1749238488600884755.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10249753907725414453.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 (16 resets) in 754 ms. (52 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10249753907725414453.prop.
BEST_FIRST walk for 40001 steps (8 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
BEST_FIRST walk for 40002 steps (11 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 390
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :390 after 689
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :689 after 1080
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1080 after 1844
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1844 after 12196
Interrupted probabilistic random walk after 200386 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 200386 steps, saw 114462 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-28 14:06:40] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:06:40] [INFO ] Invariant cache hit.
[2024-05-28 14:06:40] [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
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 1 solved, 1 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:06:41] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1590/1592 variables, and 515 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 468/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2462ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 27 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-28 14:06:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:06:42] [INFO ] Invariant cache hit.
[2024-05-28 14:06:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:06:53] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:06:54] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:06:54] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:06:54] [INFO ] Deduced a trap composed of 182 places in 266 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :34560 after 36174
[2024-05-28 14:06:57] [INFO ] Deduced a trap composed of 280 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:07:00] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 176 places in 275 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :36174 after 39621
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:07:10] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:07:10] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:07:19] [INFO ] Deduced a trap composed of 171 places in 353 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 58 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 18/18 constraints]
After SMT, in 43134ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 43155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43186 ms. Remains : 470/470 places, 1142/1142 transitions.
RANDOM walk for 40000 steps (20 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2024-05-28 14:07:26] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:07:26] [INFO ] Applying decomposition
[2024-05-28 14:07:26] [INFO ] Flatten gal took : 69 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/graph11275404129439109200.txt' '-o' '/tmp/graph11275404129439109200.bin' '-w' '/tmp/graph11275404129439109200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11275404129439109200.bin' '-l' '-1' '-v' '-w' '/tmp/graph11275404129439109200.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:07:27] [INFO ] Decomposing Gal with order
[2024-05-28 14:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:07:27] [INFO ] Removed a total of 953 redundant transitions.
[2024-05-28 14:07:27] [INFO ] Flatten gal took : 223 ms
[2024-05-28 14:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 33 ms.
[2024-05-28 14:07:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3318482879661218879.gal : 71 ms
[2024-05-28 14:07:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3012031790194075071.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/ReachabilityCardinality3318482879661218879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3012031790194075071.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
Loading property file /tmp/ReachabilityCardinality3012031790194075071.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 86
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :86 after 142
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :142 after 218
Interrupted probabilistic random walk after 325101 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 325101 steps, saw 182192 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-28 14:07:29] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:07:29] [INFO ] Invariant cache hit.
[2024-05-28 14:07: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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 0 solved, 1 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :218 after 770
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :770 after 2106
At refinement iteration 14 (OVERLAPS) 1122/1590 variables, 468/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 120/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1590 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1590 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1592 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1592 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1592/1592 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 19 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 19 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-28 14:07:32] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:07:32] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2106 after 6868
[2024-05-28 14:07:33] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-28 14:07:33] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:07:33] [INFO ] Invariant cache hit.
[2024-05-28 14:07:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:07:39] [INFO ] Implicit Places using invariants and state equation in 5707 ms returned []
Implicit Place search using SMT with State Equation took 6176 ms to find 0 implicit places.
[2024-05-28 14:07:39] [INFO ] Redundant transitions in 17 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-05-28 14:07:39] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-28 14:07:39] [INFO ] Invariant cache hit.
[2024-05-28 14:07:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:07:52] [INFO ] Deduced a trap composed of 182 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:07:56] [INFO ] Deduced a trap composed of 280 places in 253 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6868 after 19064
[2024-05-28 14:08:01] [INFO ] Deduced a trap composed of 166 places in 377 ms of which 3 ms to minimize.
[2024-05-28 14:08:02] [INFO ] Deduced a trap composed of 176 places in 216 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:08:26] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 172 places in 466 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 59 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 19/19 constraints]
After SMT, in 62796ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 62814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69035 ms. Remains : 470/470 places, 1142/1142 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15 in 255734 ms.
[2024-05-28 14:08:41] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:08:41] [INFO ] Applying decomposition
[2024-05-28 14:08:42] [INFO ] Flatten gal took : 36 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/graph84999082831317744.txt' '-o' '/tmp/graph84999082831317744.bin' '-w' '/tmp/graph84999082831317744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph84999082831317744.bin' '-l' '-1' '-v' '-w' '/tmp/graph84999082831317744.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:08:42] [INFO ] Decomposing Gal with order
[2024-05-28 14:08:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:08:42] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-28 14:08:42] [INFO ] Flatten gal took : 317 ms
[2024-05-28 14:08:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 698 labels/synchronizations in 36 ms.
[2024-05-28 14:08:42] [INFO ] Time to serialize gal into /tmp/UpperBounds5289635633013475881.gal : 22 ms
[2024-05-28 14:08:42] [INFO ] Time to serialize properties into /tmp/UpperBounds4051263893057013832.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/UpperBounds5289635633013475881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4051263893057013832.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 ...304
Loading property file /tmp/UpperBounds4051263893057013832.prop.
ITS-tools command line returned an error code 137
[2024-05-28 14:22:24] [INFO ] Applying decomposition
[2024-05-28 14:22:24] [INFO ] Flatten gal took : 61 ms
[2024-05-28 14:22:24] [INFO ] Decomposing Gal with order
[2024-05-28 14:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:22:24] [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],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_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_1113_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, NotifyEventJobQueuedE_1, QueueJobE_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_1113_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, NotifyEventJobQueuedE_2, QueueJobE_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_1113_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, NotifyEventJobQueuedE_3, QueueJobE_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_1113_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, NotifyEventJobQueuedE_4, QueueJobE_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_1113_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, NotifyEventJobQueuedE_5, QueueJobE_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_1113_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, NotifyEventJobQueuedE_6, QueueJobE_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_1113_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, NotifyEventJobQueuedE_7, QueueJobE_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_1113_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, NotifyEventJobQueuedE_8, QueueJobE_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_1113_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, NotifyEventJobQueuedE_9, QueueJobE_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_1113_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],[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],[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 14:22:24] [INFO ] Flatten gal took : 106 ms
[2024-05-28 14:22:24] [INFO ] Time to serialize gal into /tmp/UpperBounds5352266125254289236.gal : 17 ms
[2024-05-28 14:22:24] [INFO ] Time to serialize properties into /tmp/UpperBounds12214015687989845576.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/UpperBounds5352266125254289236.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12214015687989845576.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/UpperBounds12214015687989845576.prop.
ITS-tools command line returned an error code 137
[2024-05-28 14:46:34] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:46:34] [INFO ] Input system was already deterministic with 1162 transitions.
[2024-05-28 14:46:34] [INFO ] Transformed 490 places.
[2024-05-28 14:46:34] [INFO ] Transformed 1162 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 14:47:04] [INFO ] Time to serialize gal into /tmp/UpperBounds449150059806784620.gal : 5 ms
[2024-05-28 14:47:04] [INFO ] Time to serialize properties into /tmp/UpperBounds8345415034064869522.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/UpperBounds449150059806784620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8345415034064869522.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 ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8345415034064869522.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S02J04T10"
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-S02J04T10, 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-171654446300093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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