About the Execution of 2024-gold for PolyORBLF-COL-S06J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15692.860 | 283112.00 | 414012.00 | 740.50 | 1 1 1 4 3 4 6 1 5 1 4 2 1 1 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-174881266100050.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-S06J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100050
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-S06J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748892365154
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-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:26:06] [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:26:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:26:06] [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:26:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:26:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2025-06-02 19:26:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:26:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:26:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:26:07] [INFO ] Computed 26 invariants in 17 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 6, 1, 5, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 4, 3, 46, 6, 1, 6, 1, 6, 2, 6, 1, 6, 6]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:26:07] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:26:07] [INFO ] Computed 26 invariants in 4 ms
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-02 19:26:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:26:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:26:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:26:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-02 19:26:07] [INFO ] Added : 28 causal constraints over 6 iterations in 61 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:26:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-02 19:26:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2025-06-02 19:26:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:08] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 23 ms to minimize.
[2025-06-02 19:26:08] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:26:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2025-06-02 19:26:08] [INFO ] Added : 56 causal constraints over 12 iterations in 229 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:26:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:26:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:08] [INFO ] Added : 54 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:26:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:26:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:08] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:26:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:26:08] [INFO ] Added : 54 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 34 ms.
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:26:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:26:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:26:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:26:08] [INFO ] Added : 28 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 39 ms.
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:26:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:26:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:26:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 19:26:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:26:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-02 19:26:09] [INFO ] Added : 33 causal constraints over 7 iterations in 125 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:26:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:26:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-02 19:26:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:26:09] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2025-06-02 19:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-02 19:26:09] [INFO ] Added : 28 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-02 19:26:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:26:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 19:26:10] [INFO ] Added : 54 causal constraints over 11 iterations in 89 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-02 19:26:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:10] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:26:10] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:26:10] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:26:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2025-06-02 19:26:10] [INFO ] Added : 58 causal constraints over 12 iterations in 215 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:26:10] [INFO ] Added : 54 causal constraints over 11 iterations in 68 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:26:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 19:26:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 19:26:11] [INFO ] Added : 62 causal constraints over 15 iterations in 115 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:26:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:26:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:26:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:26:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:26:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:26:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:26:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 19:26:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:26:11] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-02 19:26:11] [INFO ] Added : 56 causal constraints over 12 iterations in 135 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 4, 3, 46, 5, 1, 6, 2, 6, 1, 6, 6]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-08 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:26:11] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 169 ms.
[2025-06-02 19:26:11] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 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:[1, 6, 1, 4, 3, 46, 1, 6, 2, 6, 1, 6, 6]
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:[1, 6, 1, 4, 3, 46, 1, 6, 2, 6, 1, 6, 6]
[2025-06-02 19:26:11] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2025-06-02 19:26:11] [INFO ] Computed 58 invariants in 167 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:[1, 6, 1, 4, 3, 46, 1, 6, 2, 6, 1, 6, 6]
RANDOM walk for 10000 steps (71 resets) in 119 ms. (83 steps per ms)
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60002 steps (142 resets) in 298 ms. (200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 1, 1, 1] Max Struct:[6, 46, 6, 6, 6, 6]
[2025-06-02 19:26:12] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2025-06-02 19:26:12] [INFO ] Invariant cache hit.
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive place invariants in 14 ms returned sat
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 31 ms returned unsat
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 32 ms returned unsat
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive place invariants in 14 ms returned sat
[2025-06-02 19:26:12] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 28 ms returned sat
[2025-06-02 19:26:14] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2025-06-02 19:26:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:14] [INFO ] [Nat]Absence check using 24 positive place invariants in 16 ms returned sat
[2025-06-02 19:26:14] [INFO ] [Nat]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned sat
[2025-06-02 19:26:15] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2025-06-02 19:26:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-02 19:26:15] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:26:16] [INFO ] [Nat]Added 168 Read/Feed constraints in 1022 ms returned unknown
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 32 ms returned unsat
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 36 ms returned unsat
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2025-06-02 19:26:16] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 1, 1, 1] Max Struct:[1, 4, 6, 1, 1, 1]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 36 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 60 rules applied. Total rules applied 60 place count 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 114 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 282 place count 556 transition count 2532
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 484 transition count 2460
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 438 place count 484 transition count 2448
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 450 place count 472 transition count 2448
Applied a total of 450 rules in 408 ms. Remains 472 /700 variables (removed 228) and now considering 2448/2670 (removed 222) transitions.
Running 2442 sub problems to find dead transitions.
[2025-06-02 19:26:17] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
// Phase 1: matrix 2412 rows 472 cols
[2025-06-02 19:26:17] [INFO ] Computed 52 invariants in 77 ms
[2025-06-02 19:26:17] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2442 unsolved
SMT process timed out in 40169ms, After SMT, problems are : Problem set: 0 solved, 2442 unsolved
Search for dead transitions found 0 dead transitions in 40215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40665 ms. Remains : 472/700 places, 2448/2670 transitions.
[2025-06-02 19:26:57] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
[2025-06-02 19:26:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[6]
RANDOM walk for 1000000 steps (10887 resets) in 9882 ms. (101 steps per ms)
BEST_FIRST walk for 1000000 steps (1883 resets) in 3775 ms. (264 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2025-06-02 19:27:10] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
[2025-06-02 19:27:10] [INFO ] Invariant cache hit.
[2025-06-02 19:27:11] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-06-02 19:27:11] [INFO ] [Real]Absence check using 21 positive and 31 generalized place invariants in 16 ms returned sat
[2025-06-02 19:27:11] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2025-06-02 19:27:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:27:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-06-02 19:27:12] [INFO ] [Nat]Absence check using 21 positive and 31 generalized place invariants in 16 ms returned sat
[2025-06-02 19:27:13] [INFO ] [Nat]Absence check using state equation in 1739 ms returned sat
[2025-06-02 19:27:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-02 19:27:17] [INFO ] [Nat]Added 168 Read/Feed constraints in 3557 ms returned sat
[2025-06-02 19:27:17] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 8 ms to minimize.
[2025-06-02 19:27:18] [INFO ] Deduced a trap composed of 56 places in 514 ms of which 3 ms to minimize.
[2025-06-02 19:27:19] [INFO ] Deduced a trap composed of 151 places in 521 ms of which 3 ms to minimize.
[2025-06-02 19:27:19] [INFO ] Deduced a trap composed of 48 places in 508 ms of which 3 ms to minimize.
[2025-06-02 19:27:20] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 3 ms to minimize.
[2025-06-02 19:27:20] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:27:21] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:27:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3902 ms
[2025-06-02 19:27:21] [INFO ] Computed and/alt/rep : 1782/7932/1777 causal constraints (skipped 629 transitions) in 219 ms.
[2025-06-02 19:27:24] [INFO ] Added : 70 causal constraints over 14 iterations in 2961 ms. Result :sat
Minimization took 6550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 36 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2448/2448 transitions.
Applied a total of 0 rules in 58 ms. Remains 472 /472 variables (removed 0) and now considering 2448/2448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 472/472 places, 2448/2448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2448/2448 transitions.
Applied a total of 0 rules in 51 ms. Remains 472 /472 variables (removed 0) and now considering 2448/2448 (removed 0) transitions.
[2025-06-02 19:27:30] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
[2025-06-02 19:27:30] [INFO ] Invariant cache hit.
[2025-06-02 19:27:31] [INFO ] Implicit Places using invariants in 680 ms returned [408, 409, 410, 411, 412, 413]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 691 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 466/472 places, 2448/2448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 460 transition count 2442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 460 transition count 2442
Applied a total of 12 rules in 72 ms. Remains 460 /466 variables (removed 6) and now considering 2442/2448 (removed 6) transitions.
[2025-06-02 19:27:31] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
// Phase 1: matrix 2406 rows 460 cols
[2025-06-02 19:27:31] [INFO ] Computed 46 invariants in 120 ms
[2025-06-02 19:27:33] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2025-06-02 19:27:33] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:27:33] [INFO ] Invariant cache hit.
[2025-06-02 19:27:34] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-02 19:27:45] [INFO ] Implicit Places using invariants and state equation in 11802 ms returned []
Implicit Place search using SMT with State Equation took 13562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/472 places, 2442/2448 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14378 ms. Remains : 460/472 places, 2442/2448 transitions.
[2025-06-02 19:27:45] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:27:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[6]
RANDOM walk for 1000000 steps (10924 resets) in 9403 ms. (106 steps per ms)
BEST_FIRST walk for 1000000 steps (1775 resets) in 3635 ms. (275 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2025-06-02 19:27:58] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:27:58] [INFO ] Invariant cache hit.
[2025-06-02 19:27:58] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 19:27:58] [INFO ] [Real]Absence check using 19 positive and 27 generalized place invariants in 19 ms returned sat
[2025-06-02 19:27:59] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2025-06-02 19:27:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:27:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:27:59] [INFO ] [Nat]Absence check using 19 positive and 27 generalized place invariants in 20 ms returned sat
[2025-06-02 19:28:00] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2025-06-02 19:28:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-02 19:28:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:28:09] [INFO ] [Nat]Added 168 Read/Feed constraints in 9015 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 36 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 2442/2442 transitions.
Applied a total of 0 rules in 49 ms. Remains 460 /460 variables (removed 0) and now considering 2442/2442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 460/460 places, 2442/2442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 2442/2442 transitions.
Applied a total of 0 rules in 38 ms. Remains 460 /460 variables (removed 0) and now considering 2442/2442 (removed 0) transitions.
[2025-06-02 19:28:10] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:28:10] [INFO ] Invariant cache hit.
[2025-06-02 19:28:10] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-02 19:28:10] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:28:10] [INFO ] Invariant cache hit.
[2025-06-02 19:28:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-02 19:28:22] [INFO ] Implicit Places using invariants and state equation in 11786 ms returned []
Implicit Place search using SMT with State Equation took 12564 ms to find 0 implicit places.
[2025-06-02 19:28:22] [INFO ] Redundant transitions in 110 ms returned []
Running 2436 sub problems to find dead transitions.
[2025-06-02 19:28:22] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:28:22] [INFO ] Invariant cache hit.
[2025-06-02 19:28:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
[2025-06-02 19:29:04] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:29:04] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 1 ms to minimize.
[2025-06-02 19:29:04] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2025-06-02 19:29:04] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:29:04] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
[2025-06-02 19:29:05] [INFO ] Deduced a trap composed of 209 places in 543 ms of which 3 ms to minimize.
[2025-06-02 19:29:06] [INFO ] Deduced a trap composed of 56 places in 510 ms of which 3 ms to minimize.
[2025-06-02 19:29:06] [INFO ] Deduced a trap composed of 215 places in 576 ms of which 3 ms to minimize.
[2025-06-02 19:29:07] [INFO ] Deduced a trap composed of 205 places in 534 ms of which 3 ms to minimize.
[2025-06-02 19:29:07] [INFO ] Deduced a trap composed of 210 places in 532 ms of which 3 ms to minimize.
[2025-06-02 19:29:08] [INFO ] Deduced a trap composed of 196 places in 537 ms of which 4 ms to minimize.
[2025-06-02 19:29:09] [INFO ] Deduced a trap composed of 204 places in 540 ms of which 3 ms to minimize.
[2025-06-02 19:29:09] [INFO ] Deduced a trap composed of 209 places in 568 ms of which 3 ms to minimize.
[2025-06-02 19:29:11] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 1 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 454/2866 variables, and 54 constraints, problems are : Problem set: 0 solved, 2436 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2436/1098 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
[2025-06-02 19:29:27] [INFO ] Deduced a trap composed of 204 places in 405 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2866 variables, and 55 constraints, problems are : Problem set: 0 solved, 2436 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1338/1098 constraints, Known Traps: 15/15 constraints]
After SMT, in 82893ms problems are : Problem set: 0 solved, 2436 unsolved
Search for dead transitions found 0 dead transitions in 82925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95671 ms. Remains : 460/460 places, 2442/2442 transitions.
[2025-06-02 19:29:46] [INFO ] Flatten gal took : 465 ms
RANDOM walk for 40000 steps (452 resets) in 1662 ms. (24 steps per ms) remains 2/2 properties
[2025-06-02 19:29:46] [INFO ] Flatten gal took : 312 ms
BEST_FIRST walk for 40002 steps (60 resets) in 759 ms. (52 steps per ms) remains 2/2 properties
[2025-06-02 19:29:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11000002674618916220.gal : 172 ms
[2025-06-02 19:29:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2456941861771204099.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/ReachabilityCardinality11000002674618916220.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2456941861771204099.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (62 resets) in 689 ms. (57 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2456941861771204099.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 56
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :56 after 69
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 380
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :380 after 2745
Interrupted probabilistic random walk after 129218 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129218 steps, saw 86766 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-02 19:29:50] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:29:50] [INFO ] Invariant cache hit.
[2025-06-02 19:29:50] [INFO ] State equation strengthened by 168 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2745 after 5972
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/162 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 240/444 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:29:50] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/447 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 12 (OVERLAPS) 11/458 variables, 8/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:29:51] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 3 ms to minimize.
[2025-06-02 19:29:53] [INFO ] Deduced a trap composed of 56 places in 2215 ms of which 6 ms to minimize.
[2025-06-02 19:29:54] [INFO ] Deduced a trap composed of 56 places in 791 ms of which 7 ms to minimize.
[2025-06-02 19:29:54] [INFO ] Deduced a trap composed of 116 places in 390 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2864/2866 variables, and 508 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 458/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/146 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/162 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 240/444 variables, 19/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/447 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/458 variables, 8/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5972 after 67192
After SMT solving in domain Int declared 2864/2866 variables, and 508 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 458/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 6647ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 2442/2442 transitions.
Applied a total of 0 rules in 58 ms. Remains 460 /460 variables (removed 0) and now considering 2442/2442 (removed 0) transitions.
Running 2436 sub problems to find dead transitions.
[2025-06-02 19:29:56] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:29:56] [INFO ] Invariant cache hit.
[2025-06-02 19:29:56] [INFO ] State equation strengthened by 168 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :67192 after 186840
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :186840 after 1.03218e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:30:37] [INFO ] Flatten gal took : 158 ms
[2025-06-02 19:30:37] [INFO ] Applying decomposition
[2025-06-02 19:30:37] [INFO ] Flatten gal took : 130 ms
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2436 unsolved
[2025-06-02 19:30:37] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 2 ms to minimize.
[2025-06-02 19:30:37] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 1 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1359362193706023684.txt' '-o' '/tmp/graph1359362193706023684.bin' '-w' '/tmp/graph1359362193706023684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1359362193706023684.bin' '-l' '-1' '-v' '-w' '/tmp/graph1359362193706023684.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:30:37] [INFO ] Decomposing Gal with order
[2025-06-02 19:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:30:37] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 1 ms to minimize.
[2025-06-02 19:30:37] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 0 ms to minimize.
[2025-06-02 19:30:38] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2025-06-02 19:30:38] [INFO ] Removed a total of 1100 redundant transitions.
[2025-06-02 19:30:38] [INFO ] Flatten gal took : 493 ms
[2025-06-02 19:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 32 ms.
[2025-06-02 19:30:38] [INFO ] Deduced a trap composed of 209 places in 666 ms of which 3 ms to minimize.
SMT process timed out in 42183ms, After SMT, problems are : Problem set: 0 solved, 2436 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42277 ms. Remains : 460/460 places, 2442/2442 transitions.
[2025-06-02 19:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11921506648659843034.gal : 32 ms
[2025-06-02 19:30:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12134918130889957558.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/ReachabilityCardinality11921506648659843034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12134918130889957558.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (401 resets) in 771 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (90 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality12134918130889957558.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28 after 45
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45 after 125
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :125 after 251
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :251 after 520
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :520 after 1437
Interrupted probabilistic random walk after 176929 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176929 steps, saw 119695 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-02 19:30:42] [INFO ] Flow matrix only has 2406 transitions (discarded 36 similar events)
[2025-06-02 19:30:42] [INFO ] Invariant cache hit.
[2025-06-02 19:30:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/162 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 240/444 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/447 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/458 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2406/2864 variables, 458/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 4673
At refinement iteration 14 (INCLUDED_ONLY) 0/2864 variables, 168/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2864 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2866 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2866 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2866 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2866 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 674 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2185 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 460/460 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/162 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 240/444 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:30:45] [INFO ] Deduced a trap composed of 41 places in 458 ms of which 4 ms to minimize.
[2025-06-02 19:30:45] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/447 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/458 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2406/2864 variables, 458/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2864 variables, 168/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 2864/2866 variables, and 674 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3644 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 458/460 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5849ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-10 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 281801 ms.
BK_STOP 1748892648266
--------------------
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-S06J06T06"
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-S06J06T06, 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-174881266100050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T06.tgz
mv PolyORBLF-COL-S06J06T06 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 ;