About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d2m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15684.240 | 3574903.00 | 3753346.00 | 11515.80 | 0 0 ? 0 ? 0 0 ? 0 0 0 0 0 0 0 0 | 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.r223-tall-174902009200061.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 SieveSingleMsgMbox-PT-d2m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749107100174
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:05:01] [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-05 07:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:05:01] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-06-05 07:05:01] [INFO ] Transformed 2398 places.
[2025-06-05 07:05:01] [INFO ] Transformed 1954 transitions.
[2025-06-05 07:05:01] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 07:05:01] [INFO ] Computed 6 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[115, 42, 12]
RANDOM walk for 10000 steps (2226 resets) in 282 ms. (35 steps per ms)
BEST_FIRST walk for 30003 steps (2768 resets) in 175 ms. (170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[115, 42, 12]
[2025-06-05 07:05:02] [INFO ] Invariant cache hit.
[2025-06-05 07:05:02] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-05 07:05:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 12 ms returned sat
[2025-06-05 07:05:03] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-05 07:05:03] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 07:05:03] [INFO ] [Real]Added 1674 Read/Feed constraints in 428 ms returned sat
[2025-06-05 07:05:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:05:04] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:05:04] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-05 07:05:04] [INFO ] [Nat]Added 1674 Read/Feed constraints in 326 ms returned sat
[2025-06-05 07:05:05] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 295 ms.
[2025-06-05 07:05:05] [INFO ] Added : 23 causal constraints over 5 iterations in 1077 ms. Result :sat
Minimization took 543 ms.
[2025-06-05 07:05:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:06] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:05:06] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2025-06-05 07:05:07] [INFO ] [Real]Added 1674 Read/Feed constraints in 297 ms returned sat
[2025-06-05 07:05:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:05:07] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-06-05 07:05:08] [INFO ] [Nat]Added 1674 Read/Feed constraints in 470 ms returned sat
[2025-06-05 07:05:08] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 191 ms.
[2025-06-05 07:05:08] [INFO ] Added : 27 causal constraints over 6 iterations in 860 ms. Result :sat
Minimization took 541 ms.
[2025-06-05 07:05:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:05:09] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2025-06-05 07:05:10] [INFO ] [Real]Added 1674 Read/Feed constraints in 298 ms returned sat
[2025-06-05 07:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:05:10] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-06-05 07:05:11] [INFO ] [Nat]Added 1674 Read/Feed constraints in 584 ms returned sat
[2025-06-05 07:05:11] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 28 ms to minimize.
[2025-06-05 07:05:11] [INFO ] Deduced a trap composed of 98 places in 240 ms of which 4 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 3 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 155 places in 179 ms of which 3 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 247 places in 203 ms of which 3 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 241 places in 189 ms of which 3 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2148 ms
[2025-06-05 07:05:13] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 185 ms.
[2025-06-05 07:05:14] [INFO ] Added : 41 causal constraints over 9 iterations in 1346 ms. Result :sat
Minimization took 539 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[115, 42, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[115, 42, 12]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 389
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 389
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 379
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1168 place count 179 transition count 288
Iterating global reduction 2 with 91 rules applied. Total rules applied 1259 place count 179 transition count 288
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1294 place count 179 transition count 253
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1330 place count 143 transition count 205
Iterating global reduction 3 with 36 rules applied. Total rules applied 1366 place count 143 transition count 205
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1391 place count 143 transition count 180
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1399 place count 135 transition count 167
Iterating global reduction 4 with 8 rules applied. Total rules applied 1407 place count 135 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1415 place count 127 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 1423 place count 127 transition count 159
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1427 place count 123 transition count 154
Iterating global reduction 4 with 4 rules applied. Total rules applied 1431 place count 123 transition count 154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1435 place count 119 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 1439 place count 119 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1443 place count 115 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 1447 place count 115 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1449 place count 113 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 1451 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1452 place count 112 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 1453 place count 112 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1454 place count 111 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 1455 place count 111 transition count 140
Applied a total of 1455 rules in 118 ms. Remains 111 /414 variables (removed 303) and now considering 140/1954 (removed 1814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 111/414 places, 140/1954 transitions.
// Phase 1: matrix 140 rows 111 cols
[2025-06-05 07:05:15] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[64, 42, 12]
RANDOM walk for 1000000 steps (224158 resets) in 1082 ms. (923 steps per ms)
BEST_FIRST walk for 3000001 steps (310428 resets) in 1611 ms. (1861 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[64, 42, 12]
[2025-06-05 07:05:18] [INFO ] Invariant cache hit.
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:05:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:05:18] [INFO ] [Real]Added 61 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:05:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Added 61 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:05:18] [INFO ] Computed and/alt/rep : 29/84/29 causal constraints (skipped 110 transitions) in 10 ms.
[2025-06-05 07:05:18] [INFO ] Added : 14 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 99 ms.
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Added 61 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:05:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:05:18] [INFO ] Computed and/alt/rep : 29/84/29 causal constraints (skipped 110 transitions) in 10 ms.
[2025-06-05 07:05:18] [INFO ] Added : 17 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 59 ms.
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2025-06-05 07:05:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:05:18] [INFO ] [Nat]Added 61 Read/Feed constraints in 18 ms returned sat
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-05 07:05:18] [INFO ] Computed and/alt/rep : 29/84/29 causal constraints (skipped 110 transitions) in 12 ms.
[2025-06-05 07:05:18] [INFO ] Added : 23 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[64, 42, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 140/140 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 111/111 places, 140/140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 140/140 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-05 07:05:19] [INFO ] Invariant cache hit.
[2025-06-05 07:05:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 07:05:19] [INFO ] Invariant cache hit.
[2025-06-05 07:05:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:05:19] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2025-06-05 07:05:19] [INFO ] Redundant transitions in 4 ms returned []
Running 139 sub problems to find dead transitions.
[2025-06-05 07:05:19] [INFO ] Invariant cache hit.
[2025-06-05 07:05:19] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/251 variables, 111/115 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 61/176 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2025-06-05 07:05:22] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/251 variables, 1/177 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 177 constraints, problems are : Problem set: 3 solved, 136 unsolved in 5565 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/111 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 140/251 variables, 111/116 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 61/177 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 136/313 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/313 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/313 constraints. Problems are: Problem set: 3 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 313 constraints, problems are : Problem set: 3 solved, 136 unsolved in 8657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 136/139 constraints, Known Traps: 1/1 constraints]
After SMT, in 14441ms problems are : Problem set: 3 solved, 136 unsolved
Search for dead transitions found 3 dead transitions in 14454ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 137/140 transitions.
Graph (complete) has 322 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 108 /111 variables (removed 3) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 108 cols
[2025-06-05 07:05:33] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 07:05:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 07:05:34] [INFO ] Invariant cache hit.
[2025-06-05 07:05:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:05:34] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/111 places, 137/140 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15089 ms. Remains : 108/111 places, 137/140 transitions.
[2025-06-05 07:05:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
RANDOM walk for 1000000 steps (224502 resets) in 1051 ms. (950 steps per ms)
BEST_FIRST walk for 3000001 steps (309655 resets) in 1606 ms. (1866 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
[2025-06-05 07:05:36] [INFO ] Invariant cache hit.
[2025-06-05 07:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:05:36] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:05:36] [INFO ] [Real]Added 60 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:05:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Added 60 Read/Feed constraints in 16 ms returned sat
[2025-06-05 07:05:37] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 108 transitions) in 11 ms.
[2025-06-05 07:05:37] [INFO ] Added : 12 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 175 ms.
[2025-06-05 07:05:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:05:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:05:37] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 108 transitions) in 7 ms.
[2025-06-05 07:05:37] [INFO ] Added : 16 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 66 ms.
[2025-06-05 07:05:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Real]Added 60 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:05:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:05:37] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:05:37] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-05 07:05:37] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 108 transitions) in 11 ms.
[2025-06-05 07:05:37] [INFO ] Added : 21 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 108/108 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2025-06-05 07:05:38] [INFO ] Invariant cache hit.
[2025-06-05 07:05:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 07:05:38] [INFO ] Invariant cache hit.
[2025-06-05 07:05:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:05:38] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2025-06-05 07:05:38] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-05 07:05:38] [INFO ] Invariant cache hit.
[2025-06-05 07:05:38] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 4 (OVERLAPS) 137/245 variables, 108/111 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 60/171 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 171 constraints, problems are : Problem set: 3 solved, 133 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 136/241 variables, 105/108 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 59/167 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 15/182 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 4/245 variables, 3/185 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/186 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 118/304 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 304 constraints, problems are : Problem set: 3 solved, 133 unsolved in 8496 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 133/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 11848ms problems are : Problem set: 3 solved, 133 unsolved
Search for dead transitions found 3 dead transitions in 11852ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/108 places, 134/137 transitions.
Graph (complete) has 313 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 105 /108 variables (removed 3) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 105 cols
[2025-06-05 07:05:50] [INFO ] Computed 3 invariants in 3 ms
[2025-06-05 07:05:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 07:05:50] [INFO ] Invariant cache hit.
[2025-06-05 07:05:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:05:50] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/108 places, 134/137 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12388 ms. Remains : 105/108 places, 134/137 transitions.
[2025-06-05 07:05:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
RANDOM walk for 1000000 steps (224249 resets) in 1041 ms. (959 steps per ms)
BEST_FIRST walk for 3000001 steps (309821 resets) in 1561 ms. (1920 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
[2025-06-05 07:05:53] [INFO ] Invariant cache hit.
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:05:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:05:53] [INFO ] [Real]Added 59 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:05:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Added 59 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:05:53] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 6 ms.
[2025-06-05 07:05:53] [INFO ] Added : 12 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 79 ms.
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Real]Added 59 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:05:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Added 59 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:05:53] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 9 ms.
[2025-06-05 07:05:53] [INFO ] Added : 15 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 60 ms.
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Real]Added 59 Read/Feed constraints in 17 ms returned sat
[2025-06-05 07:05:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:05:53] [INFO ] [Nat]Added 59 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:05:53] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 10 ms.
[2025-06-05 07:05:53] [INFO ] Added : 21 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-06-05 07:05:54] [INFO ] Invariant cache hit.
[2025-06-05 07:05:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 07:05:54] [INFO ] Invariant cache hit.
[2025-06-05 07:05:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:05:54] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2025-06-05 07:05:54] [INFO ] Redundant transitions in 5 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-05 07:05:54] [INFO ] Invariant cache hit.
[2025-06-05 07:05:54] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/239 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 167 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3503 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/239 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 133/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 300 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 9923ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 9927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10181 ms. Remains : 105/105 places, 134/134 transitions.
[2025-06-05 07:06:04] [INFO ] Flatten gal took : 97 ms
[2025-06-05 07:06:04] [INFO ] Flatten gal took : 19 ms
RANDOM walk for 40000 steps (8983 resets) in 1260 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4114 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
[2025-06-05 07:06:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12546013873338463984.gal : 18 ms
[2025-06-05 07:06:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14672640115017190923.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/ReachabilityCardinality12546013873338463984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14672640115017190923.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (4063 resets) in 356 ms. (112 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality14672640115017190923.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :41 after 207
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :207 after 262
BEST_FIRST walk for 40003 steps (4125 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 64
BEST_FIRST walk for 40003 steps (4143 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
SDD size :262 after 2228
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2228 after 3402
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3402 after 5362
BEST_FIRST walk for 40002 steps (4088 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (4124 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5362 after 46540
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :46540 after 73444
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :73444 after 92630
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :92630 after 757961
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :757961 after 5.61958e+06
Interrupted probabilistic random walk after 427781 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :1 out of 6
Probabilistic random walk after 427781 steps, saw 194780 distinct states, run finished after 3015 ms. (steps per millisecond=141 ) properties seen :1
[2025-06-05 07:06:08] [INFO ] Invariant cache hit.
[2025-06-05 07:06:08] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-05 07:06:08] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 92/152 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
At refinement iteration 8 (OVERLAPS) 75/227 variables, 35/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 57/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MAX2 is UNSAT
At refinement iteration 11 (OVERLAPS) 12/239 variables, 10/166 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 2/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-05 07:06:08] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 169 constraints, problems are : Problem set: 3 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/120 variables, 15/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 29/45 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/46 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/233 variables, 83/129 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/130 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 30/160 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/161 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/239 variables, 2/163 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 6/169 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/239 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 170 constraints, problems are : Problem set: 3 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 384ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 103 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 102 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 102 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 102 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 101 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 100 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 99 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 98 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 121
Applied a total of 18 rules in 13 ms. Remains 98 /105 variables (removed 7) and now considering 121/134 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/105 places, 121/134 transitions.
RANDOM walk for 40000 steps (8946 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4189 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5.61958e+06 after 7.84682e+07
Interrupted probabilistic random walk after 2624869 steps, run timeout after 3001 ms. (steps per millisecond=874 ) properties seen :0 out of 1
Probabilistic random walk after 2624869 steps, saw 1100651 distinct states, run finished after 3001 ms. (steps per millisecond=874 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-05 07:06:11] [INFO ] Computed 3 invariants in 4 ms
[2025-06-05 07:06:11] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-05 07:06:11] [INFO ] Invariant cache hit.
[2025-06-05 07:06:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 07:06:11] [INFO ] Invariant cache hit.
[2025-06-05 07:06:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 07:06:11] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2025-06-05 07:06:11] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-05 07:06:11] [INFO ] Invariant cache hit.
[2025-06-05 07:06:11] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2587 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :7.84682e+07 after 1.60624e+09
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5616 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8329ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8537 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 92 transition count 98
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 101
Applied a total of 58 rules in 17 ms. Remains 70 /98 variables (removed 28) and now considering 101/121 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2025-06-05 07:06:20] [INFO ] Computed 4 invariants in 1 ms
[2025-06-05 07:06:20] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-05 07:06:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:06:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:06:20] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 07:06:20] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
[2025-06-05 07:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2025-06-05 07:06:20] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 07:06:20] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 07:06:20] [INFO ] Flatten gal took : 10 ms
[2025-06-05 07:06:20] [INFO ] Flatten gal took : 12 ms
[2025-06-05 07:06:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4646345634913851096.gal : 3 ms
[2025-06-05 07:06:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10511483884468499368.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4646345634913851096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10511483884468499368.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10511483884468499368.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 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 101
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :101 after 175
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :175 after 301
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :301 after 1335
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1335 after 3213
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3213 after 55129
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :55129 after 859167
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :859167 after 2.68528e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.68528e+07 after 1.11417e+09
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.60624e+09 after 4.87872e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.11417e+09 after 2.22448e+10
Detected timeout of ITS tools.
[2025-06-05 07:06:35] [INFO ] Flatten gal took : 20 ms
[2025-06-05 07:06:35] [INFO ] Applying decomposition
[2025-06-05 07:06:35] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1894828953229059169.txt' '-o' '/tmp/graph1894828953229059169.bin' '-w' '/tmp/graph1894828953229059169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1894828953229059169.bin' '-l' '-1' '-v' '-w' '/tmp/graph1894828953229059169.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:06:35] [INFO ] Decomposing Gal with order
[2025-06-05 07:06:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:06:35] [INFO ] Removed a total of 72 redundant transitions.
[2025-06-05 07:06:35] [INFO ] Flatten gal took : 45 ms
[2025-06-05 07:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2025-06-05 07:06:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17860342640094457823.gal : 3 ms
[2025-06-05 07:06:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11141837292735031183.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/ReachabilityCardinality17860342640094457823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11141837292735031183.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11141837292735031183.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :163 after 259
Invariant property MIN2 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,41969,11.0665,310504,1427,2973,238663,133697,303,1.2384e+06,145,2.9599e+06,0
Total reachable state count : 41969
Verifying 1 reachability properties.
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,91,11.0859,310504,87,136,238663,133697,307,1.2384e+06,149,2.9599e+06,0
Over-approximation ignoring read arcs solved 0 properties in 26723 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 07:06:47] [INFO ] Flatten gal took : 10 ms
[2025-06-05 07:06:47] [INFO ] Applying decomposition
[2025-06-05 07:06:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11088212025929358.txt' '-o' '/tmp/graph11088212025929358.bin' '-w' '/tmp/graph11088212025929358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11088212025929358.bin' '-l' '-1' '-v' '-w' '/tmp/graph11088212025929358.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:06:47] [INFO ] Decomposing Gal with order
[2025-06-05 07:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:06:47] [INFO ] Removed a total of 126 redundant transitions.
[2025-06-05 07:06:47] [INFO ] Flatten gal took : 16 ms
[2025-06-05 07:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 5 ms.
[2025-06-05 07:06:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6980775236333296253.gal : 5 ms
[2025-06-05 07:06:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2801754278209536011.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/ReachabilityCardinality6980775236333296253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2801754278209536011.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2801754278209536011.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :34 after 65
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :65 after 88
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :88 after 3510
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8178 after 79007
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :867735 after 870283
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.92787e+06 after 5.44915e+06
Invariant property MIN2 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.80909e+07,4.78805,128516,2751,1802,99870,31961,344,925692,152,410618,0
Total reachable state count : 28090907
Verifying 1 reachability properties.
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,3136,4.79364,128516,136,156,99870,31961,350,925692,156,410618,0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0, 0] Max Struct:[64, 42, 12]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
// Phase 1: matrix 134 rows 105 cols
[2025-06-05 07:06:51] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2282 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (1017 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2025-06-05 07:06:52] [INFO ] Invariant cache hit.
[2025-06-05 07:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:06:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:06:52] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:06:52] [INFO ] [Real]Added 59 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:06:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:06:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:06:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-05 07:06:52] [INFO ] [Nat]Added 59 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:06:52] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 8 ms.
[2025-06-05 07:06:52] [INFO ] Added : 18 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 101 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 101 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 101 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 99 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 99 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 99 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 97 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 97 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 95 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 95 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 95 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 93 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 93 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 93 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 92 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 92 transition count 102
Applied a total of 31 rules in 13 ms. Remains 92 /105 variables (removed 13) and now considering 102/134 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 92/105 places, 102/134 transitions.
// Phase 1: matrix 102 rows 92 cols
[2025-06-05 07:06:52] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (224439 resets) in 875 ms. (1141 steps per ms)
BEST_FIRST walk for 1000001 steps (103640 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2025-06-05 07:06:53] [INFO ] Invariant cache hit.
[2025-06-05 07:06:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:06:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:06:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 07:06:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:06:53] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2025-06-05 07:06:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:06:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:06:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:06:53] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:06:53] [INFO ] [Nat]Added 38 Read/Feed constraints in 5 ms returned sat
[2025-06-05 07:06:53] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 5 ms.
[2025-06-05 07:06:53] [INFO ] Added : 14 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 92/92 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-06-05 07:06:54] [INFO ] Invariant cache hit.
[2025-06-05 07:06:54] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 07:06:54] [INFO ] Invariant cache hit.
[2025-06-05 07:06:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:06:54] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2025-06-05 07:06:54] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 07:06:54] [INFO ] Invariant cache hit.
[2025-06-05 07:06:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 133 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 101/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 234 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 5885ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6096 ms. Remains : 92/92 places, 102/102 transitions.
[2025-06-05 07:07:00] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40000 steps (9009 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2025-06-05 07:07:00] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:07:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16407363588598613759.gal : 2 ms
[2025-06-05 07:07:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11494351329903902861.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/ReachabilityCardinality16407363588598613759.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11494351329903902861.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11494351329903902861.prop.
BEST_FIRST walk for 40002 steps (4222 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 174
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :174 after 214
BEST_FIRST walk for 40003 steps (4106 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 610
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :610 after 2722
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2722 after 3402
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3402 after 5474
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5474 after 43620
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :43620 after 74835
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :74835 after 550499
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :550499 after 9.83241e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.83241e+06 after 1.41137e+08
Interrupted probabilistic random walk after 2770676 steps, run timeout after 3001 ms. (steps per millisecond=923 ) properties seen :1 out of 2
Probabilistic random walk after 2770676 steps, saw 1292222 distinct states, run finished after 3001 ms. (steps per millisecond=923 ) properties seen :1
[2025-06-05 07:07:03] [INFO ] Invariant cache hit.
[2025-06-05 07:07:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/120 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/158 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 07:07:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-05 07:07:03] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/194 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/92 constraints, ReadFeed: 23/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 139ms 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[64]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02 in 11408 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 134 rows 105 cols
[2025-06-05 07:07:03] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2269 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (1040 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:07:03] [INFO ] Invariant cache hit.
[2025-06-05 07:07:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:07:03] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:07:03] [INFO ] [Real]Added 59 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:07:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:07:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:07:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:07:03] [INFO ] [Nat]Added 59 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:07:03] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 8 ms.
[2025-06-05 07:07:03] [INFO ] Added : 15 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 102 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 102 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 102 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 101 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 101 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 100 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 100 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 99 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 98 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 98 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 97 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 97 transition count 108
Applied a total of 20 rules in 12 ms. Remains 97 /105 variables (removed 8) and now considering 108/134 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 97/105 places, 108/134 transitions.
// Phase 1: matrix 108 rows 97 cols
[2025-06-05 07:07:03] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224417 resets) in 807 ms. (1237 steps per ms)
BEST_FIRST walk for 1000001 steps (103472 resets) in 422 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:07:04] [INFO ] Invariant cache hit.
[2025-06-05 07:07:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:07:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:07:05] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:07:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:07:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:07:05] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2025-06-05 07:07:05] [INFO ] Computed and/alt/rep : 25/62/25 causal constraints (skipped 82 transitions) in 6 ms.
[2025-06-05 07:07:05] [INFO ] Added : 16 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-05 07:07:05] [INFO ] Invariant cache hit.
[2025-06-05 07:07:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 07:07:05] [INFO ] Invariant cache hit.
[2025-06-05 07:07:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:07:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2025-06-05 07:07:05] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
[2025-06-05 07:07:05] [INFO ] Invariant cache hit.
[2025-06-05 07:07:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/205 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 141 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/205 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 107/248 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 248 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4082 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6662ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6881 ms. Remains : 97/97 places, 108/108 transitions.
[2025-06-05 07:07:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 07:07:12] [INFO ] Flatten gal took : 5 ms
[2025-06-05 07:07:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6358276605249662867.gal : 1 ms
[2025-06-05 07:07:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality717450467552868397.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6358276605249662867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality717450467552868397.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8929 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality717450467552868397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40003 steps (4099 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 218
BEST_FIRST walk for 40003 steps (4094 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :218 after 950
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :950 after 2620
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2620 after 4112
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4112 after 24852
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :24852 after 41462
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :41462 after 307854
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :307854 after 2.07291e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.07291e+06 after 1.98438e+07
Interrupted probabilistic random walk after 2800334 steps, run timeout after 3001 ms. (steps per millisecond=933 ) properties seen :1 out of 2
Probabilistic random walk after 2800334 steps, saw 1371138 distinct states, run finished after 3001 ms. (steps per millisecond=933 ) properties seen :1
[2025-06-05 07:07:15] [INFO ] Invariant cache hit.
[2025-06-05 07:07:15] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/131 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/139 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 07:07:15] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 205/205 variables, and 114 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 13/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 111ms 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-04 in 11896 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
// Phase 1: matrix 134 rows 105 cols
[2025-06-05 07:07:15] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2215 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (1026 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:07:15] [INFO ] Invariant cache hit.
[2025-06-05 07:07:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:15] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:07:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:07:15] [INFO ] [Real]Added 59 Read/Feed constraints in 18 ms returned sat
[2025-06-05 07:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:07:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:15] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:07:15] [INFO ] [Nat]Added 59 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:07:15] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 106 transitions) in 10 ms.
[2025-06-05 07:07:15] [INFO ] Added : 21 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 103 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 102 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 102 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 102 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 101 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 100 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 99 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 98 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 121
Applied a total of 18 rules in 23 ms. Remains 98 /105 variables (removed 7) and now considering 121/134 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 98/105 places, 121/134 transitions.
// Phase 1: matrix 121 rows 98 cols
[2025-06-05 07:07:15] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224690 resets) in 932 ms. (1071 steps per ms)
BEST_FIRST walk for 1000000 steps (103282 resets) in 479 ms. (2083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:07:17] [INFO ] Invariant cache hit.
[2025-06-05 07:07:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:07:17] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 07:07:17] [INFO ] [Real]Added 53 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:07:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:17] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:07:17] [INFO ] [Nat]Added 53 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:07:17] [INFO ] Computed and/alt/rep : 25/65/25 causal constraints (skipped 95 transitions) in 7 ms.
[2025-06-05 07:07:17] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-05 07:07:17] [INFO ] Invariant cache hit.
[2025-06-05 07:07:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 07:07:17] [INFO ] Invariant cache hit.
[2025-06-05 07:07:17] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 07:07:17] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2025-06-05 07:07:17] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-05 07:07:17] [INFO ] Invariant cache hit.
[2025-06-05 07:07:17] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2578 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5597 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8274ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8509 ms. Remains : 98/98 places, 121/121 transitions.
[2025-06-05 07:07:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 07:07:25] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:07:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1302927171272308094.gal : 2 ms
RANDOM walk for 40000 steps (8966 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2025-06-05 07:07:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9275485658658973273.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/ReachabilityCardinality1302927171272308094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9275485658658973273.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9275485658658973273.prop.
BEST_FIRST walk for 40002 steps (4117 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 262
BEST_FIRST walk for 40002 steps (4105 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :262 after 816
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :816 after 2424
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2424 after 3824
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3824 after 29744
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :29744 after 46947
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :46947 after 394414
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :394414 after 2.39069e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.39069e+06 after 3.51527e+07
Interrupted probabilistic random walk after 1007247 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 2
Probabilistic random walk after 1007247 steps, saw 429046 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2025-06-05 07:07:28] [INFO ] Invariant cache hit.
[2025-06-05 07:07:28] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 40000 steps (8985 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4253 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.51527e+07 after 3.11412e+08
Interrupted probabilistic random walk after 2481103 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :0 out of 1
Probabilistic random walk after 2481103 steps, saw 1040320 distinct states, run finished after 3001 ms. (steps per millisecond=826 ) properties seen :0
[2025-06-05 07:07:32] [INFO ] Invariant cache hit.
[2025-06-05 07:07:32] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-05 07:07:32] [INFO ] Invariant cache hit.
[2025-06-05 07:07:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 07:07:32] [INFO ] Invariant cache hit.
[2025-06-05 07:07:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 07:07:32] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2025-06-05 07:07:32] [INFO ] Redundant transitions in 15 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-05 07:07:32] [INFO ] Invariant cache hit.
[2025-06-05 07:07:32] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2605 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.11412e+08 after 6.27947e+09
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5583 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8306ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8541 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 101
Applied a total of 58 rules in 12 ms. Remains 70 /98 variables (removed 28) and now considering 101/121 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2025-06-05 07:07:41] [INFO ] Computed 4 invariants in 1 ms
[2025-06-05 07:07:41] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-05 07:07:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:07:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:07:41] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 07:07:41] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2025-06-05 07:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2025-06-05 07:07:41] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 07:07:41] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 07:07:41] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:07:41] [INFO ] Flatten gal took : 8 ms
[2025-06-05 07:07:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9842170989897325558.gal : 1 ms
[2025-06-05 07:07:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2795022068972019304.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/ReachabilityCardinality9842170989897325558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2795022068972019304.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2795022068972019304.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 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 101
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :101 after 175
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :175 after 301
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :301 after 1335
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1335 after 3213
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3213 after 55129
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :55129 after 859167
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :859167 after 2.68528e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.68528e+07 after 1.11417e+09
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :6.27947e+09 after 9.79349e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.11417e+09 after 2.22448e+10
Detected timeout of ITS tools.
[2025-06-05 07:07:56] [INFO ] Flatten gal took : 8 ms
[2025-06-05 07:07:56] [INFO ] Applying decomposition
[2025-06-05 07:07:56] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15250858659847707404.txt' '-o' '/tmp/graph15250858659847707404.bin' '-w' '/tmp/graph15250858659847707404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15250858659847707404.bin' '-l' '-1' '-v' '-w' '/tmp/graph15250858659847707404.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:07:56] [INFO ] Decomposing Gal with order
[2025-06-05 07:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:07:56] [INFO ] Removed a total of 62 redundant transitions.
[2025-06-05 07:07:56] [INFO ] Flatten gal took : 53 ms
[2025-06-05 07:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2025-06-05 07:07:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2101232819918922164.gal : 11 ms
[2025-06-05 07:07:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5148811268653468616.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2101232819918922164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5148811268653468616.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5148811268653468616.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11 after 28
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :28 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :161 after 189
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1899 after 1927
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6323 after 8640
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,32218,2.42891,65800,1856,1738,43363,17947,257,447668,169,205256,0
Total reachable state count : 32218
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,77,2.43104,65800,69,103,43363,17947,261,447668,173,205256,0
Over-approximation ignoring read arcs solved 0 properties in 17773 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 07:07:58] [INFO ] Flatten gal took : 9 ms
[2025-06-05 07:07:58] [INFO ] Applying decomposition
[2025-06-05 07:07:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1469723714216280215.txt' '-o' '/tmp/graph1469723714216280215.bin' '-w' '/tmp/graph1469723714216280215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1469723714216280215.bin' '-l' '-1' '-v' '-w' '/tmp/graph1469723714216280215.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:07:58] [INFO ] Decomposing Gal with order
[2025-06-05 07:07:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:07:58] [INFO ] Removed a total of 105 redundant transitions.
[2025-06-05 07:07:58] [INFO ] Flatten gal took : 10 ms
[2025-06-05 07:07:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2025-06-05 07:07:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3282532201723745455.gal : 2 ms
[2025-06-05 07:07:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6584927010167930193.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3282532201723745455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6584927010167930193.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6584927010167930193.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 154
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :154 after 342
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :342 after 1100
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4640 after 7588
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7588 after 55824
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :96979 after 409631
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :608959 after 972081
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.05506e+06,3.67004,104440,2748,5102,67337,123814,320,348393,159,842951,0
Total reachable state count : 4055059
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,432,3.67448,104704,63,143,67337,123814,324,348393,163,842951,0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-07 in 47311 ms.
[2025-06-05 07:08:02] [INFO ] Flatten gal took : 9 ms
[2025-06-05 07:08:02] [INFO ] Applying decomposition
[2025-06-05 07:08:02] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5339126018491765361.txt' '-o' '/tmp/graph5339126018491765361.bin' '-w' '/tmp/graph5339126018491765361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5339126018491765361.bin' '-l' '-1' '-v' '-w' '/tmp/graph5339126018491765361.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:08:02] [INFO ] Decomposing Gal with order
[2025-06-05 07:08:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:08:02] [INFO ] Removed a total of 133 redundant transitions.
[2025-06-05 07:08:02] [INFO ] Flatten gal took : 12 ms
[2025-06-05 07:08:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 5 ms.
[2025-06-05 07:08:02] [INFO ] Time to serialize gal into /tmp/UpperBounds12220071175985497702.gal : 1 ms
[2025-06-05 07:08:02] [INFO ] Time to serialize properties into /tmp/UpperBounds8430700858518138763.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12220071175985497702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8430700858518138763.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8430700858518138763.prop.
Detected timeout of ITS tools.
[2025-06-05 07:29:03] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:29:03] [INFO ] Time to serialize gal into /tmp/UpperBounds4388478989497692130.gal : 16 ms
[2025-06-05 07:29:03] [INFO ] Time to serialize properties into /tmp/UpperBounds9171235854316287378.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4388478989497692130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9171235854316287378.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9171235854316287378.prop.
ITS-tools command line returned an error code 137
[2025-06-05 07:43:34] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:43:34] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-05 07:43:34] [INFO ] Transformed 105 places.
[2025-06-05 07:43:34] [INFO ] Transformed 134 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 07:43:34] [INFO ] Time to serialize gal into /tmp/UpperBounds17716290790717303353.gal : 2 ms
[2025-06-05 07:43:34] [INFO ] Time to serialize properties into /tmp/UpperBounds5357567465744571308.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17716290790717303353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5357567465744571308.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5357567465744571308.prop.
Detected timeout of ITS tools.
Total runtime 3573546 ms.
BK_STOP 1749110675077
--------------------
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="SieveSingleMsgMbox-PT-d2m64"
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 SieveSingleMsgMbox-PT-d2m64, 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 r223-tall-174902009200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 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 ;