MCC'2024- Execution of r532-smll-171683810700085

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m64

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
589.344	92936.00	143992.00	501.80	? 0 0 ? 0 1 0 0 1 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/mcc2024-input.r532-smll-171683810700085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717245121077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 12:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:32:03] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-06-01 12:32:03] [INFO ] Transformed 1295 places.
[2024-06-01 12:32:03] [INFO ] Transformed 749 transitions.
[2024-06-01 12:32:03] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:32:03] [INFO ] Computed 6 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 91, 1, 10]
RANDOM walk for 10000 steps (2194 resets) in 205 ms. (48 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (2836 resets) in 207 ms. (144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 91, 10]
[2024-06-01 12:32:03] [INFO ] Invariant cache hit.
[2024-06-01 12:32:04] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 12:32:04] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 19 ms returned sat
[2024-06-01 12:32:04] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-06-01 12:32:04] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-06-01 12:32:05] [INFO ] [Real]Added 587 Read/Feed constraints in 260 ms returned sat
[2024-06-01 12:32:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:32:05] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:32:05] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2024-06-01 12:32:05] [INFO ] [Nat]Added 587 Read/Feed constraints in 215 ms returned sat
[2024-06-01 12:32:06] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 35 ms to minimize.
[2024-06-01 12:32:06] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 3 ms to minimize.
[2024-06-01 12:32:06] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:32:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 738 ms
[2024-06-01 12:32:06] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 181 ms.
[2024-06-01 12:32:07] [INFO ] Added : 17 causal constraints over 4 iterations in 525 ms. Result :sat
Minimization took 593 ms.
[2024-06-01 12:32:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 12:32:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:32:08] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-01 12:32:08] [INFO ] [Real]Added 587 Read/Feed constraints in 153 ms returned sat
[2024-06-01 12:32:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:32:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:32:08] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-06-01 12:32:08] [INFO ] [Nat]Added 587 Read/Feed constraints in 186 ms returned sat
[2024-06-01 12:32:08] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 91 ms.
[2024-06-01 12:32:09] [INFO ] Added : 10 causal constraints over 2 iterations in 259 ms. Result :sat
Minimization took 579 ms.
[2024-06-01 12:32:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 12:32:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 12:32:10] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-06-01 12:32:10] [INFO ] [Real]Added 587 Read/Feed constraints in 111 ms returned sat
[2024-06-01 12:32:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:32:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:32:10] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-06-01 12:32:10] [INFO ] [Nat]Added 587 Read/Feed constraints in 122 ms returned sat
[2024-06-01 12:32:10] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
[2024-06-01 12:32:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2024-06-01 12:32:11] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 77 ms.
[2024-06-01 12:32:11] [INFO ] Added : 13 causal constraints over 3 iterations in 395 ms. Result :sat
Minimization took 625 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 91, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 91, 10]
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 236
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 366 place count 182 transition count 231
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 410 place count 138 transition count 187
Iterating global reduction 2 with 44 rules applied. Total rules applied 454 place count 138 transition count 187
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 472 place count 138 transition count 169
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 498 place count 112 transition count 141
Iterating global reduction 3 with 26 rules applied. Total rules applied 524 place count 112 transition count 141
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 540 place count 112 transition count 125
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 548 place count 104 transition count 114
Iterating global reduction 4 with 8 rules applied. Total rules applied 556 place count 104 transition count 114
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 564 place count 96 transition count 106
Iterating global reduction 4 with 8 rules applied. Total rules applied 572 place count 96 transition count 106
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 577 place count 91 transition count 100
Iterating global reduction 4 with 5 rules applied. Total rules applied 582 place count 91 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 584 place count 91 transition count 98
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 588 place count 87 transition count 94
Iterating global reduction 5 with 4 rules applied. Total rules applied 592 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 594 place count 85 transition count 92
Iterating global reduction 5 with 2 rules applied. Total rules applied 596 place count 85 transition count 92
Applied a total of 596 rules in 164 ms. Remains 85 /259 variables (removed 174) and now considering 92/749 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 85/259 places, 92/749 transitions.
// Phase 1: matrix 92 rows 85 cols
[2024-06-01 12:32:12] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 64, 10]
RANDOM walk for 1000000 steps (224815 resets) in 1063 ms. (939 steps per ms)
BEST_FIRST walk for 3000000 steps (311560 resets) in 1601 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1, 64, 10]
[2024-06-01 12:32:14] [INFO ] Invariant cache hit.
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 12:32:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 12:32:15] [INFO ] [Real]Added 37 Read/Feed constraints in 12 ms returned sat
[2024-06-01 12:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Added 37 Read/Feed constraints in 17 ms returned sat
[2024-06-01 12:32:15] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 15 ms.
[2024-06-01 12:32:15] [INFO ] Added : 18 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 74 ms.
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-01 12:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:32:15] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 9 ms.
[2024-06-01 12:32:15] [INFO ] Added : 10 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 117 ms.
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-01 12:32:15] [INFO ] [Real]Absence check using state equation in 58 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1, 64, 1]
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 64]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/85 places, 92/92 transitions.
[2024-06-01 12:32:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 64]
RANDOM walk for 1000000 steps (224247 resets) in 1176 ms. (849 steps per ms)
BEST_FIRST walk for 2000001 steps (207004 resets) in 951 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 64]
[2024-06-01 12:32:18] [INFO ] Invariant cache hit.
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 12:32:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 12:32:18] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:32:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-01 12:32:18] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 6 ms.
[2024-06-01 12:32:18] [INFO ] Added : 18 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 50 ms.
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:32:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 12:32:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:32:18] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 8 ms.
[2024-06-01 12:32:18] [INFO ] Added : 10 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 64]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/85 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 12:32:18] [INFO ] Invariant cache hit.
[2024-06-01 12:32:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 12:32:18] [INFO ] Invariant cache hit.
[2024-06-01 12:32:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 12:32:19] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-01 12:32:19] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-01 12:32:19] [INFO ] Invariant cache hit.
[2024-06-01 12:32:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/177 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 12:32:21] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/177 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 91/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
After SMT, in 8823ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 8921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9244 ms. Remains : 85/85 places, 92/92 transitions.
RANDOM walk for 40000 steps (8914 resets) in 1311 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4219 resets) in 654 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4113 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4144 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4186 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 685210 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :1 out of 4
Probabilistic random walk after 685210 steps, saw 323946 distinct states, run finished after 3007 ms. (steps per millisecond=227 ) properties seen :1
[2024-06-01 12:32:32] [INFO ] Invariant cache hit.
[2024-06-01 12:32:32] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 71/132 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:32:32] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 26/158 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 28/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 19/177 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:32:33] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:32:33] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
[2024-06-01 12:32:33] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 11 ms to minimize.
[2024-06-01 12:32:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 4/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/177 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 131 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/61 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 71/132 variables, 61/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/158 variables, 14/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 28/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/177 variables, 10/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 9/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 3/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/177 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 133 constraints, problems are : Problem set: 1 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1784ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 90
Applied a total of 3 rules in 11 ms. Remains 84 /85 variables (removed 1) and now considering 90/92 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 84/85 places, 90/92 transitions.
RANDOM walk for 40000 steps (8981 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4203 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4191 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 793989 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 2
Probabilistic random walk after 793989 steps, saw 372945 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
// Phase 1: matrix 90 rows 84 cols
[2024-06-01 12:32:37] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:32:37] [INFO ] State equation strengthened by 35 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) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/129 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/155 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/174 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/129 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:32:37] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/155 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/174 variables, 10/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/84 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-01 12:32:37] [INFO ] Invariant cache hit.
[2024-06-01 12:32:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 12:32:37] [INFO ] Invariant cache hit.
[2024-06-01 12:32:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:32:37] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-01 12:32:37] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:32:37] [INFO ] Invariant cache hit.
[2024-06-01 12:32:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/174 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 123 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/174 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 89/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:32:41] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 213 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 9229ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 9231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9577 ms. Remains : 84/84 places, 90/90 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 83
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 79 transition count 83
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 79 transition count 69
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 65 transition count 69
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 52 place count 59 transition count 63
Applied a total of 52 rules in 18 ms. Remains 59 /84 variables (removed 25) and now considering 63/90 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 59 cols
[2024-06-01 12:32:47] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 12:32:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:32:47] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:32:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-01 12:32:47] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:32:47] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:32:47] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 226 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 64]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-00
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 92 rows 85 cols
[2024-06-01 12:32:47] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2222 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (973 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 12:32:47] [INFO ] Invariant cache hit.
[2024-06-01 12:32:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 12:32:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 12:32:47] [INFO ] [Real]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-01 12:32:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 12:32:47] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:32:47] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 8 ms.
[2024-06-01 12:32:47] [INFO ] Added : 18 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place l159) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 90/90 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 88
Applied a total of 3 rules in 24 ms. Remains 84 /85 variables (removed 1) and now considering 88/90 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 84/85 places, 88/90 transitions.
// Phase 1: matrix 88 rows 84 cols
[2024-06-01 12:32:47] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224439 resets) in 859 ms. (1162 steps per ms)
BEST_FIRST walk for 1000001 steps (103634 resets) in 450 ms. (2217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 12:32:49] [INFO ] Invariant cache hit.
[2024-06-01 12:32:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:32:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:32:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 12:32:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:32:49] [INFO ] [Real]Added 33 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:32:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:32:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 12:32:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:32:49] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 64 transitions) in 11 ms.
[2024-06-01 12:32:49] [INFO ] Added : 17 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 12:32:49] [INFO ] Invariant cache hit.
[2024-06-01 12:32:49] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 12:32:49] [INFO ] Invariant cache hit.
[2024-06-01 12:32:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:32:49] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-06-01 12:32:49] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 12:32:49] [INFO ] Invariant cache hit.
[2024-06-01 12:32:49] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 2/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/172 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 2/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/172 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 87/208 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 12:32:55] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 209 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 11305ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 11309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11798 ms. Remains : 84/84 places, 88/88 transitions.
RANDOM walk for 40000 steps (8900 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4229 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4185 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 687696 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 2
Probabilistic random walk after 687696 steps, saw 325111 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
[2024-06-01 12:33:04] [INFO ] Invariant cache hit.
[2024-06-01 12:33:04] [INFO ] State equation strengthened by 33 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) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/127 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/153 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/172 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/127 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/153 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/172 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/172 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 88/88 transitions.
RANDOM walk for 40000 steps (8908 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4098 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4034 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 648414 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 2
Probabilistic random walk after 648414 steps, saw 305354 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2024-06-01 12:33:07] [INFO ] Invariant cache hit.
[2024-06-01 12:33:07] [INFO ] State equation strengthened by 33 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) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/127 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/153 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/172 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/60 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/127 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/153 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/172 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/172 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
[2024-06-01 12:33:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-01 12:33:08] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
[2024-06-01 12:33:08] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 2/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/172 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 2/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/172 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 87/208 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 12:33:13] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 209 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 10818ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11169 ms. Remains : 84/84 places, 88/88 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 79 transition count 81
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 79 transition count 67
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 65 transition count 67
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 52 place count 59 transition count 61
Applied a total of 52 rules in 10 ms. Remains 59 /84 variables (removed 25) and now considering 61/88 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 12:33:19] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 12:33:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:33:19] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:33:19] [INFO ] After 47ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-01 12:33:19] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 in 32195 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
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 92 rows 85 cols
[2024-06-01 12:33:19] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2245 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (1033 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 12:33:19] [INFO ] Invariant cache hit.
[2024-06-01 12:33:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 12:33:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 12:33:19] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:33:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 12:33:19] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-01 12:33:19] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 68 transitions) in 6 ms.
[2024-06-01 12:33:19] [INFO ] Added : 10 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 81 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 82 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 82 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 80 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 79 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 78 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 77 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 81
Applied a total of 17 rules in 20 ms. Remains 77 /85 variables (removed 8) and now considering 81/92 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 77/85 places, 81/92 transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-06-01 12:33:19] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (224367 resets) in 800 ms. (1248 steps per ms)
BEST_FIRST walk for 1000000 steps (103425 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 12:33:21] [INFO ] Invariant cache hit.
[2024-06-01 12:33:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:33:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:33:21] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:33:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:33:21] [INFO ] [Real]Added 32 Read/Feed constraints in 14 ms returned sat
[2024-06-01 12:33:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:33:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:33:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:33:21] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:33:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:33:21] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 10 ms.
[2024-06-01 12:33:21] [INFO ] Added : 10 causal constraints over 2 iterations in 51 ms. Result :sat
Minimization took 101 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 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 12:33:21] [INFO ] Invariant cache hit.
[2024-06-01 12:33:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 12:33:21] [INFO ] Invariant cache hit.
[2024-06-01 12:33:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:33:22] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-06-01 12:33:22] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:33:22] [INFO ] Invariant cache hit.
[2024-06-01 12:33:22] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 193 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 7712ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8172 ms. Remains : 77/77 places, 81/81 transitions.
RANDOM walk for 40000 steps (8991 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4202 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4191 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2638720 steps, run timeout after 3009 ms. (steps per millisecond=876 ) properties seen :1 out of 2
Probabilistic random walk after 2638720 steps, saw 1223068 distinct states, run finished after 3009 ms. (steps per millisecond=876 ) properties seen :1
[2024-06-01 12:33:32] [INFO ] Invariant cache hit.
[2024-06-01 12:33:32] [INFO ] State equation strengthened by 32 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) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/113 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/139 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/158 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/158 variables, and 114 constraints, problems are : Problem set: 1 solved, 0 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 244ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[64]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 in 13606 ms.
[2024-06-01 12:33:33] [INFO ] Flatten gal took : 72 ms
[2024-06-01 12:33:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 12:33:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 92 transitions and 366 arcs took 8 ms.
Total runtime 90710 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-03

BK_STOP 1717245214013

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SieveSingleMsgMbox-PT-d1m64-UpperBounds-00
ub formula formula --maxsum=/tmp/829/ub_0_
ub formula name SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
ub formula formula --maxsum=/tmp/829/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d1m64"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r532-smll-171683810700085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;