About the Execution of 2024-gold for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15674.700 | 653532.00 | 941210.00 | 1520.00 | 1 1 10 5 0 1 2 1 2 1 1 1 1 2 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000037.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-COL-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748890955979
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:02:37] [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]
[2025-06-02 19:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:02:37] [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.
[2025-06-02 19:02:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:02:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2025-06-02 19:02:38] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:02:38] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:02:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:02:38] [INFO ] Computed 26 invariants in 21 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 10, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 10, 6, 3, 1, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:02:38] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:02:38] [INFO ] Computed 26 invariants in 15 ms
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-02 19:02:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:02:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:02:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-02 19:02:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
[2025-06-02 19:02:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-02 19:02:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:02:38] [INFO ] Added : 33 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:02:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:02:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-02 19:02:38] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:02:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2025-06-02 19:02:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:02:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-02 19:02:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:02:39] [INFO ] Added : 61 causal constraints over 13 iterations in 113 ms. Result :sat
Minimization took 105 ms.
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:02:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-02 19:02:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:02:39] [INFO ] Added : 54 causal constraints over 11 iterations in 120 ms. Result :sat
Minimization took 45 ms.
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:02:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:02:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2025-06-02 19:02:40] [INFO ] Added : 57 causal constraints over 12 iterations in 241 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:02:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-02 19:02:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:02:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:02:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:02:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 272 ms
[2025-06-02 19:02:40] [INFO ] Added : 58 causal constraints over 13 iterations in 366 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:02:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 19:02:41] [INFO ] Added : 23 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:02:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:02:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:02:41] [INFO ] Added : 61 causal constraints over 13 iterations in 87 ms. Result :sat
Minimization took 30 ms.
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:02:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-02 19:02:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:02:41] [INFO ] Added : 54 causal constraints over 11 iterations in 94 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:02:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:02:41] [INFO ] Added : 7 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:02:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:02:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:02:42] [INFO ] Added : 26 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:02:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:02:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:02:42] [INFO ] Added : 34 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 5, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:02:42] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 42 ms.
[2025-06-02 19:02:42] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
[2025-06-02 19:02:42] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2025-06-02 19:02:42] [INFO ] Computed 50 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 101 ms. (98 steps per ms)
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 129 ms. (307 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1] Max Struct:[6, 3, 6, 6]
[2025-06-02 19:02:42] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-02 19:02:42] [INFO ] Invariant cache hit.
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 11 ms returned unsat
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:02:42] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 16 ms returned sat
[2025-06-02 19:02:43] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-06-02 19:02:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-02 19:02:43] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 20 ms returned sat
[2025-06-02 19:02:43] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2025-06-02 19:02:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:02:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 301 ms returned sat
[2025-06-02 19:02:44] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 69 ms.
[2025-06-02 19:02:45] [INFO ] Added : 97 causal constraints over 20 iterations in 1577 ms. Result :sat
Minimization took 710 ms.
[2025-06-02 19:02:46] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:02:46] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2025-06-02 19:02:46] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2025-06-02 19:02:46] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1] Max Struct:[1, 3, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 480 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 326 place count 372 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 372 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 350 place count 360 transition count 794
Applied a total of 350 rules in 162 ms. Remains 360 /536 variables (removed 176) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2025-06-02 19:02:46] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 360 cols
[2025-06-02 19:02:46] [INFO ] Computed 48 invariants in 16 ms
[2025-06-02 19:02:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 3 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 3 ms to minimize.
[2025-06-02 19:03:00] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 3 ms to minimize.
[2025-06-02 19:03:00] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2025-06-02 19:03:04] [INFO ] Deduced a trap composed of 204 places in 149 ms of which 2 ms to minimize.
[2025-06-02 19:03:07] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 3 ms to minimize.
[2025-06-02 19:03:08] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1142 variables, and 59 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/359 variables, 1/60 constraints. Problems are: Problem set: 36 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1142 variables, and 60 constraints, problems are : Problem set: 36 solved, 756 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 13/13 constraints]
After SMT, in 41379ms problems are : Problem set: 36 solved, 756 unsolved
Search for dead transitions found 36 dead transitions in 41406ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/536 places, 758/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 360 /360 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41607 ms. Remains : 360/536 places, 758/968 transitions.
[2025-06-02 19:03:28] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 360 cols
[2025-06-02 19:03:28] [INFO ] Computed 48 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (603 resets) in 2913 ms. (343 steps per ms)
BEST_FIRST walk for 1000001 steps (213 resets) in 1424 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:03:32] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-02 19:03:32] [INFO ] Invariant cache hit.
[2025-06-02 19:03:32] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-02 19:03:32] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 16 ms returned sat
[2025-06-02 19:03:32] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-06-02 19:03:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-02 19:03:33] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 13 ms returned sat
[2025-06-02 19:03:33] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 19:03:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:03:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 918 ms returned sat
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-02 19:03:34] [INFO ] Computed and/alt/rep : 462/2290/456 causal constraints (skipped 288 transitions) in 62 ms.
[2025-06-02 19:03:35] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-06-02 19:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2025-06-02 19:03:35] [INFO ] Added : 54 causal constraints over 12 iterations in 1106 ms. Result :sat
Minimization took 3195 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 758/758 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 360/360 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 758/758 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2025-06-02 19:03:39] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-02 19:03:39] [INFO ] Invariant cache hit.
[2025-06-02 19:03:39] [INFO ] Implicit Places using invariants in 321 ms returned [324, 325, 326, 327, 328, 329]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 335 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/360 places, 758/758 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 348 transition count 752
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 348 transition count 752
Applied a total of 12 rules in 24 ms. Remains 348 /354 variables (removed 6) and now considering 752/758 (removed 6) transitions.
[2025-06-02 19:03:39] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
// Phase 1: matrix 740 rows 348 cols
[2025-06-02 19:03:39] [INFO ] Computed 42 invariants in 9 ms
[2025-06-02 19:03:39] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-02 19:03:39] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:03:39] [INFO ] Invariant cache hit.
[2025-06-02 19:03:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:03:43] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 3911 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/360 places, 752/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4290 ms. Remains : 348/360 places, 752/758 transitions.
[2025-06-02 19:03:43] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:03:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (547 resets) in 2554 ms. (391 steps per ms)
BEST_FIRST walk for 1000000 steps (247 resets) in 1306 ms. (765 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:03:47] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:03:47] [INFO ] Invariant cache hit.
[2025-06-02 19:03:47] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:03:47] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 11 ms returned sat
[2025-06-02 19:03:47] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 19:03:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:03:47] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 9 ms returned sat
[2025-06-02 19:03:47] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-02 19:03:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:03:52] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:03:57] [INFO ] [Nat]Added 72 Read/Feed constraints in 9014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 22 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 348/348 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 13 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2025-06-02 19:03:57] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:03:57] [INFO ] Invariant cache hit.
[2025-06-02 19:03:57] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-02 19:03:57] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:03:57] [INFO ] Invariant cache hit.
[2025-06-02 19:03:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:04:00] [INFO ] Implicit Places using invariants and state equation in 3595 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2025-06-02 19:04:00] [INFO ] Redundant transitions in 44 ms returned []
Running 750 sub problems to find dead transitions.
[2025-06-02 19:04:00] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:04:00] [INFO ] Invariant cache hit.
[2025-06-02 19:04:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 122 places in 201 ms of which 3 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:04:08] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2025-06-02 19:04:09] [INFO ] Deduced a trap composed of 204 places in 159 ms of which 3 ms to minimize.
[2025-06-02 19:04:13] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 2 ms to minimize.
[2025-06-02 19:04:13] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2025-06-02 19:04:14] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:04:14] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 3 ms to minimize.
[2025-06-02 19:04:14] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2025-06-02 19:04:15] [INFO ] Deduced a trap composed of 125 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:04:16] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:04:17] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2025-06-02 19:04:20] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 4 ms to minimize.
[2025-06-02 19:04:20] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:04:21] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:04:21] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 2 ms to minimize.
[2025-06-02 19:04:21] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:04:21] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:04:22] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 3 ms to minimize.
[2025-06-02 19:04:22] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:04:29] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
[2025-06-02 19:04:30] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:04:30] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1088 variables, and 69 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 750/750 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:04:34] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:04:40] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:04:50] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1088 variables, and 72 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/750 constraints, Known Traps: 32/32 constraints]
After SMT, in 60886ms problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64829 ms. Remains : 348/348 places, 752/752 transitions.
RANDOM walk for 40000 steps (22 resets) in 1134 ms. (35 steps per ms) remains 2/2 properties
[2025-06-02 19:05:02] [INFO ] Flatten gal took : 250 ms
BEST_FIRST walk for 40004 steps (19 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
[2025-06-02 19:05:02] [INFO ] Flatten gal took : 149 ms
BEST_FIRST walk for 40003 steps (15 resets) in 421 ms. (94 steps per ms) remains 2/2 properties
[2025-06-02 19:05:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7847113487331156617.gal : 44 ms
[2025-06-02 19:05:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality326024261170623157.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/ReachabilityCardinality7847113487331156617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality326024261170623157.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality326024261170623157.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 114
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :114 after 234
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234 after 494
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :494 after 652
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :652 after 1170
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1170 after 2538
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2538 after 11404
Interrupted probabilistic random walk after 260322 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 260322 steps, saw 128487 distinct states, run finished after 3004 ms. (steps per millisecond=86 ) properties seen :0
[2025-06-02 19:05:05] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:05] [INFO ] Invariant cache hit.
[2025-06-02 19:05:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:05] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2025-06-02 19:05:05] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2025-06-02 19:05:05] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 740/1086 variables, 346/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1088 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:06] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:05:06] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 740/1086 variables, 346/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1086 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:07] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1088 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:08] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 471 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2808ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 23 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Running 750 sub problems to find dead transitions.
[2025-06-02 19:05:08] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:08] [INFO ] Invariant cache hit.
[2025-06-02 19:05:08] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 33573
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33573 after 46316
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 2 ms to minimize.
[2025-06-02 19:05:15] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 3 ms to minimize.
[2025-06-02 19:05:15] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:05:15] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :46316 after 261520
[2025-06-02 19:05:17] [INFO ] Deduced a trap composed of 204 places in 141 ms of which 2 ms to minimize.
[2025-06-02 19:05:20] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:05:20] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:05:21] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 19:05:21] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 2 ms to minimize.
[2025-06-02 19:05:21] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:05:21] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:05:23] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:05:23] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:05:26] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:05:27] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:05:27] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:05:27] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 2 ms to minimize.
[2025-06-02 19:05:28] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 2 ms to minimize.
[2025-06-02 19:05:28] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:05:28] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:05:28] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1088 variables, and 66 constraints, problems are : Problem set: 0 solved, 750 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 750/750 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:05:31] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 3 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 3 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :261520 after 475996
[2025-06-02 19:05:39] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:05:39] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1088 variables, and 72 constraints, problems are : Problem set: 0 solved, 750 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/750 constraints, Known Traps: 32/32 constraints]
After SMT, in 40907ms problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 40915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40942 ms. Remains : 348/348 places, 752/752 transitions.
RANDOM walk for 40000 steps (24 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-02 19:05:52] [INFO ] Flatten gal took : 57 ms
[2025-06-02 19:05:52] [INFO ] Applying decomposition
[2025-06-02 19:05:52] [INFO ] Flatten gal took : 56 ms
Interrupted probabilistic random walk after 279527 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 279527 steps, saw 136993 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-06-02 19:05:52] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:52] [INFO ] Invariant cache hit.
[2025-06-02 19:05:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1159496985367854235.txt' '-o' '/tmp/graph1159496985367854235.bin' '-w' '/tmp/graph1159496985367854235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1159496985367854235.bin' '-l' '-1' '-v' '-w' '/tmp/graph1159496985367854235.weights' '-q' '0' '-e' '0.001'
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:52] [INFO ] Decomposing Gal with order
[2025-06-02 19:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:05:53] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:05:53] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2025-06-02 19:05:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:53] [INFO ] Removed a total of 558 redundant transitions.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:53] [INFO ] Flatten gal took : 236 ms
[2025-06-02 19:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 506 labels/synchronizations in 26 ms.
[2025-06-02 19:05:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9531607696685500611.gal : 12 ms
[2025-06-02 19:05:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4128969963956171347.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/ReachabilityCardinality9531607696685500611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4128969963956171347.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 12 (OVERLAPS) 740/1086 variables, 346/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality4128969963956171347.prop.
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 34
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 76
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1088 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :76 after 129
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :129 after 292
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :292 after 772
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:53] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2025-06-02 19:05:54] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :772 after 2222
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2222 after 7960
At refinement iteration 13 (OVERLAPS) 740/1086 variables, 346/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1086 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:54] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1088 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:05:55] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 471 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2789ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 201 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 10 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 348/348 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 9 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2025-06-02 19:05:55] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:55] [INFO ] Invariant cache hit.
[2025-06-02 19:05:56] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-02 19:05:56] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:56] [INFO ] Invariant cache hit.
[2025-06-02 19:05:56] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 28715
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :28715 after 37651
[2025-06-02 19:05:59] [INFO ] Implicit Places using invariants and state equation in 3567 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
[2025-06-02 19:05:59] [INFO ] Redundant transitions in 8 ms returned []
Running 750 sub problems to find dead transitions.
[2025-06-02 19:05:59] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:05:59] [INFO ] Invariant cache hit.
[2025-06-02 19:05:59] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :37651 after 263570
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 1 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2025-06-02 19:06:05] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
[2025-06-02 19:06:06] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:06:06] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 2 ms to minimize.
[2025-06-02 19:06:07] [INFO ] Deduced a trap composed of 204 places in 149 ms of which 2 ms to minimize.
[2025-06-02 19:06:11] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:06:11] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2025-06-02 19:06:12] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:06:12] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 3 ms to minimize.
[2025-06-02 19:06:12] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2025-06-02 19:06:13] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:06:14] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:06:14] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2025-06-02 19:06:18] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :371598 after 478120
[2025-06-02 19:06:18] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:06:19] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 3 ms to minimize.
[2025-06-02 19:06:19] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:06:19] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:06:19] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:06:20] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:06:20] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:06:27] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
[2025-06-02 19:06:27] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:06:27] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1088 variables, and 69 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 750/750 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:06:33] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 750 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :478120 after 2.22687e+06
Detected timeout of ITS tools.
[2025-06-02 19:06:49] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1088 variables, and 72 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/750 constraints, Known Traps: 32/32 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 60908ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64803 ms. Remains : 348/348 places, 752/752 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:07:00] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:07:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (5 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:07:00] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:07:00] [INFO ] Invariant cache hit.
[2025-06-02 19:07:00] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:07:00] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 10 ms returned sat
[2025-06-02 19:07:00] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 19:07:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:07:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:07:01] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 9 ms returned sat
[2025-06-02 19:07:01] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-06-02 19:07:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:07:01] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:07:01] [INFO ] [Nat]Added 72 Read/Feed constraints in 599 ms returned sat
[2025-06-02 19:07:02] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:07:02] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:07:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2025-06-02 19:07:02] [INFO ] Computed and/alt/rep : 456/2283/450 causal constraints (skipped 288 transitions) in 61 ms.
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 157 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:07:05] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 3 ms to minimize.
[2025-06-02 19:07:05] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 1686 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 16 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Running 750 sub problems to find dead transitions.
[2025-06-02 19:07:05] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:07:05] [INFO ] Invariant cache hit.
[2025-06-02 19:07:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:07:11] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:07:11] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:07:11] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:07:11] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:07:11] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:07:12] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 2 ms to minimize.
[2025-06-02 19:07:12] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:07:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:07:12] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 3 ms to minimize.
[2025-06-02 19:07:14] [INFO ] Deduced a trap composed of 204 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:07:17] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:07:18] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:07:18] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:07:18] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:07:19] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:07:19] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:07:20] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:07:21] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-06-02 19:07:24] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 6 ms to minimize.
[2025-06-02 19:07:25] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 4 ms to minimize.
[2025-06-02 19:07:25] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:07:25] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:07:25] [INFO ] Deduced a trap composed of 148 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:07:26] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:07:26] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:07:26] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 2 ms to minimize.
SMT process timed out in 20897ms, After SMT, problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 20905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20922 ms. Remains : 348/348 places, 752/752 transitions.
[2025-06-02 19:07:26] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:07:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (589 resets) in 2761 ms. (362 steps per ms)
BEST_FIRST walk for 1000001 steps (233 resets) in 1478 ms. (676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:07:31] [INFO ] Invariant cache hit.
[2025-06-02 19:07:31] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 19:07:31] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 10 ms returned sat
[2025-06-02 19:07:31] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-02 19:07:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:07:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:07:31] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 9 ms returned sat
[2025-06-02 19:07:31] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-02 19:07:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:07:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:07:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 8049 ms returned sat
[2025-06-02 19:07:40] [INFO ] Computed and/alt/rep : 456/2283/450 causal constraints (skipped 288 transitions) in 47 ms.
[2025-06-02 19:07:43] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2025-06-02 19:07:44] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 2 ms to minimize.
[2025-06-02 19:07:44] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:07:44] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2025-06-02 19:07:44] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2025-06-02 19:07:45] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:07:49] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 5908 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 30 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 348/348 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 13 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2025-06-02 19:08:16] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:08:16] [INFO ] Invariant cache hit.
[2025-06-02 19:08:16] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-02 19:08:16] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:08:16] [INFO ] Invariant cache hit.
[2025-06-02 19:08:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:08:20] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
[2025-06-02 19:08:20] [INFO ] Redundant transitions in 4 ms returned []
Running 750 sub problems to find dead transitions.
[2025-06-02 19:08:20] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:08:20] [INFO ] Invariant cache hit.
[2025-06-02 19:08:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:08:27] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 2 ms to minimize.
[2025-06-02 19:08:28] [INFO ] Deduced a trap composed of 204 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:08:32] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:08:32] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2025-06-02 19:08:33] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 3 ms to minimize.
[2025-06-02 19:08:33] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 2 ms to minimize.
[2025-06-02 19:08:33] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:08:34] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:08:35] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:08:36] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2025-06-02 19:08:39] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 2 ms to minimize.
[2025-06-02 19:08:39] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 3 ms to minimize.
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 3 ms to minimize.
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 147 places in 156 ms of which 2 ms to minimize.
[2025-06-02 19:08:41] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 2 ms to minimize.
[2025-06-02 19:08:41] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:08:48] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
[2025-06-02 19:08:48] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:08:49] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1088 variables, and 69 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 750/750 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:08:54] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:09:00] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:09:10] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1088 variables, and 72 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/750 constraints, Known Traps: 32/32 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64650 ms. Remains : 348/348 places, 752/752 transitions.
[2025-06-02 19:09:21] [INFO ] Flatten gal took : 47 ms
[2025-06-02 19:09:21] [INFO ] Flatten gal took : 41 ms
RANDOM walk for 40000 steps (25 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
[2025-06-02 19:09:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16998264907302869969.gal : 9 ms
[2025-06-02 19:09:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16113786092986184671.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/ReachabilityCardinality16998264907302869969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16113786092986184671.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 155 ms. (256 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16113786092986184671.prop.
BEST_FIRST walk for 40003 steps (15 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 114
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :114 after 234
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234 after 494
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :494 after 652
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :652 after 1170
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1170 after 2538
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2538 after 11404
Interrupted probabilistic random walk after 241820 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241820 steps, saw 120123 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2025-06-02 19:09:24] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:24] [INFO ] Invariant cache hit.
[2025-06-02 19:09:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 4 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 740/1086 variables, 346/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1088 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:25] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:09:25] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 740/1086 variables, 346/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1086 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:26] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1088 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:26] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 471 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2708ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 190 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 10 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Running 750 sub problems to find dead transitions.
[2025-06-02 19:09:27] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:27] [INFO ] Invariant cache hit.
[2025-06-02 19:09:27] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 33573
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33573 after 46316
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:09:34] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:09:34] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :46316 after 261520
[2025-06-02 19:09:35] [INFO ] Deduced a trap composed of 204 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:09:39] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:09:39] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:09:40] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:09:40] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:09:40] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:09:41] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:09:42] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:09:42] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 2 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 147 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:09:47] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:09:47] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:09:47] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:09:48] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:09:48] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 20900ms, After SMT, problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 20909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20921 ms. Remains : 348/348 places, 752/752 transitions.
RANDOM walk for 40000 steps (26 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 257988 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 257988 steps, saw 127469 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2025-06-02 19:09:51] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:51] [INFO ] Invariant cache hit.
[2025-06-02 19:09:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:51] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-02 19:09:51] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:09:51] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 740/1086 variables, 346/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1088 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/277 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/293 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/345 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:52] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:09:52] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 740/1086 variables, 346/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1086 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:53] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1088 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1088 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 471 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2661ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 348/348 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 752/752 transitions.
Applied a total of 0 rules in 9 ms. Remains 348 /348 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2025-06-02 19:09:54] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:54] [INFO ] Invariant cache hit.
[2025-06-02 19:09:54] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-06-02 19:09:54] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:54] [INFO ] Invariant cache hit.
[2025-06-02 19:09:55] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :261520 after 475996
[2025-06-02 19:09:58] [INFO ] Implicit Places using invariants and state equation in 3548 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2025-06-02 19:09:58] [INFO ] Redundant transitions in 4 ms returned []
Running 750 sub problems to find dead transitions.
[2025-06-02 19:09:58] [INFO ] Flow matrix only has 740 transitions (discarded 12 similar events)
[2025-06-02 19:09:58] [INFO ] Invariant cache hit.
[2025-06-02 19:09:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 2 ms to minimize.
[2025-06-02 19:10:04] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:10:05] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 3 ms to minimize.
[2025-06-02 19:10:06] [INFO ] Deduced a trap composed of 204 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:10:10] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 3 ms to minimize.
[2025-06-02 19:10:10] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:10:11] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:10:11] [INFO ] Flatten gal took : 32 ms
[2025-06-02 19:10:11] [INFO ] Applying decomposition
[2025-06-02 19:10:11] [INFO ] Flatten gal took : 32 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/graph300294710095290476.txt' '-o' '/tmp/graph300294710095290476.bin' '-w' '/tmp/graph300294710095290476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph300294710095290476.bin' '-l' '-1' '-v' '-w' '/tmp/graph300294710095290476.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:10:11] [INFO ] Decomposing Gal with order
[2025-06-02 19:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:10:11] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 2 ms to minimize.
[2025-06-02 19:10:11] [INFO ] Removed a total of 494 redundant transitions.
[2025-06-02 19:10:11] [INFO ] Flatten gal took : 114 ms
[2025-06-02 19:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 430 labels/synchronizations in 38 ms.
[2025-06-02 19:10:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9487031826679642981.gal : 6 ms
[2025-06-02 19:10:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality524612222864340328.prop : 37 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/ReachabilityCardinality9487031826679642981.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality524612222864340328.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality524612222864340328.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 58
[2025-06-02 19:10:12] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :90 after 130
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :130 after 178
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :178 after 327
SDD proceeding with computation,2 properties remain. new max is 1024
[2025-06-02 19:10:12] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 2 ms to minimize.
SDD size :327 after 974
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :974 after 1868
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1868 after 5998
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:10:13] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:10:14] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 28259
[2025-06-02 19:10:17] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:10:17] [INFO ] Deduced a trap composed of 147 places in 179 ms of which 2 ms to minimize.
[2025-06-02 19:10:18] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 2 ms to minimize.
[2025-06-02 19:10:18] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :28259 after 53761
[2025-06-02 19:10:18] [INFO ] Deduced a trap composed of 148 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:10:19] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 2 ms to minimize.
[2025-06-02 19:10:19] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:10:19] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :53761 after 88908
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:10:26] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1088 variables, and 69 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 750/750 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:10:32] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :371598 after 492311
[2025-06-02 19:10:38] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2025-06-02 19:10:48] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 750 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :492311 after 1.72502e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1088 variables, and 72 constraints, problems are : Problem set: 0 solved, 750 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/750 constraints, Known Traps: 32/32 constraints]
After SMT, in 60884ms problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64752 ms. Remains : 348/348 places, 752/752 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 348 transition count 740
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 24 place count 342 transition count 764
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 342 transition count 740
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 342 transition count 734
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 336 transition count 734
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 336 transition count 727
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 74 place count 329 transition count 727
Applied a total of 74 rules in 117 ms. Remains 329 /348 variables (removed 19) and now considering 727/752 (removed 25) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 727 rows 329 cols
[2025-06-02 19:10:59] [INFO ] Computed 42 invariants in 8 ms
[2025-06-02 19:10:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 19:10:59] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2025-06-02 19:10:59] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 19:10:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 19:10:59] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2025-06-02 19:11:00] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 19:11:00] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:11:00] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
TRAPS : Iteration 1
[2025-06-02 19:11:01] [INFO ] After 1935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Detected timeout of ITS tools.
[2025-06-02 19:11:02] [INFO ] After 2497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 19:11:02] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:11:02] [INFO ] Flatten gal took : 28 ms
[2025-06-02 19:11:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17775295203197127505.gal : 5 ms
[2025-06-02 19:11:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11933474339062294282.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/ReachabilityCardinality17775295203197127505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11933474339062294282.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/ReachabilityCardinality11933474339062294282.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 129
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :129 after 450
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :450 after 476
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :476 after 503
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :503 after 753
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :753 after 1555
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1555 after 4757
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4757 after 21929
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :53541 after 89739
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :89739 after 141078
Detected timeout of ITS tools.
[2025-06-02 19:11:17] [INFO ] Flatten gal took : 26 ms
[2025-06-02 19:11:17] [INFO ] Applying decomposition
[2025-06-02 19:11:17] [INFO ] Flatten gal took : 26 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/graph4178660445946231191.txt' '-o' '/tmp/graph4178660445946231191.bin' '-w' '/tmp/graph4178660445946231191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4178660445946231191.bin' '-l' '-1' '-v' '-w' '/tmp/graph4178660445946231191.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:11:17] [INFO ] Decomposing Gal with order
[2025-06-02 19:11:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:11:17] [INFO ] Removed a total of 612 redundant transitions.
[2025-06-02 19:11:17] [INFO ] Flatten gal took : 72 ms
[2025-06-02 19:11:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 291 labels/synchronizations in 13 ms.
[2025-06-02 19:11:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7697576956415276605.gal : 5 ms
[2025-06-02 19:11:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13951909720438137058.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/ReachabilityCardinality7697576956415276605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13951909720438137058.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/ReachabilityCardinality13951909720438137058.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 85
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :85 after 229
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :229 after 329
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :329 after 815
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :815 after 1410
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1410 after 3343
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3343 after 7151
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7151 after 14096
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33640 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-04 in 272338 ms.
[2025-06-02 19:11:32] [INFO ] Flatten gal took : 27 ms
[2025-06-02 19:11:32] [INFO ] Applying decomposition
[2025-06-02 19:11:32] [INFO ] Flatten gal took : 26 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/graph2545361656400768388.txt' '-o' '/tmp/graph2545361656400768388.bin' '-w' '/tmp/graph2545361656400768388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2545361656400768388.bin' '-l' '-1' '-v' '-w' '/tmp/graph2545361656400768388.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:11:33] [INFO ] Decomposing Gal with order
[2025-06-02 19:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:11:33] [INFO ] Removed a total of 631 redundant transitions.
[2025-06-02 19:11:33] [INFO ] Flatten gal took : 85 ms
[2025-06-02 19:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 22 ms.
[2025-06-02 19:11:33] [INFO ] Time to serialize gal into /tmp/UpperBounds17331924227196778869.gal : 6 ms
[2025-06-02 19:11:33] [INFO ] Time to serialize properties into /tmp/UpperBounds14961979737245601922.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/UpperBounds17331924227196778869.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14961979737245601922.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 ...306
Loading property file /tmp/UpperBounds14961979737245601922.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,5.04205e+06,115.863,2678040,2,197906,5,5.66061e+06,6,0,2295,5.99145e+06,0
Total reachable state count : 5042052
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T06-UpperBounds-04 :0 <= gi5.gu13.P_1159_0+gi5.gu13.P_1159_1+gi5.gu13.P_1159_2+gi5.gu13.P_1159_3+gi5.gu13.P_1159_4+gi5....173
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T06-UpperBounds-04,0,115.994,2678040,1,0,6,5.66061e+06,9,1,3077,5.99145e+06,4
Total runtime 652176 ms.
BK_STOP 1748891609511
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-COL-S02J06T06, 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 r167-tall-174881266000037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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.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 '
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 ;