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-171683810800109.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-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 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 1.1M 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-d2m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717247434488

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:10:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:10:37] [INFO ] Load time of PNML (sax parser for PT used): 465 ms
[2024-06-01 13:10:37] [INFO ] Transformed 2398 places.
[2024-06-01 13:10:37] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:10:37] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 695 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 1984 places in 32 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 13:10:37] [INFO ] Computed 6 invariants in 97 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 10000 steps (2207 resets) in 616 ms. (16 steps per ms)
BEST_FIRST walk for 30002 steps (2845 resets) in 388 ms. (77 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-06-01 13:10:38] [INFO ] Invariant cache hit.
[2024-06-01 13:10:38] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-06-01 13:10:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:10:39] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2024-06-01 13:10:40] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-06-01 13:10:41] [INFO ] [Real]Added 1674 Read/Feed constraints in 1108 ms returned sat
[2024-06-01 13:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:10:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:10:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 13:10:42] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2024-06-01 13:10:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:10:43] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1436 ms returned sat
[2024-06-01 13:10:44] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 592 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2024-06-01 13:10:46] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-06-01 13:10:46] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:10:47] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-06-01 13:10:48] [INFO ] [Real]Added 1674 Read/Feed constraints in 851 ms returned sat
[2024-06-01 13:10:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:10:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:10:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:10:49] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-06-01 13:10:49] [INFO ] [Nat]Added 1674 Read/Feed constraints in 540 ms returned sat
[2024-06-01 13:10:50] [INFO ] Deduced a trap composed of 45 places in 836 ms of which 62 ms to minimize.
[2024-06-01 13:10:51] [INFO ] Deduced a trap composed of 44 places in 752 ms of which 7 ms to minimize.
[2024-06-01 13:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2286 ms
[2024-06-01 13:10:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:10:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:10:52] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2024-06-01 13:10:53] [INFO ] [Real]Added 1674 Read/Feed constraints in 478 ms returned sat
[2024-06-01 13:10:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:10:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:10:53] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:10:54] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-06-01 13:10:54] [INFO ] [Nat]Added 1674 Read/Feed constraints in 609 ms returned sat
[2024-06-01 13:10:54] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 218 ms.
[2024-06-01 13:10:56] [INFO ] Deduced a trap composed of 24 places in 686 ms of which 8 ms to minimize.
[2024-06-01 13:10:57] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1262 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 90 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1330 place count 142 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1367 place count 142 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1389 place count 142 transition count 166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1397 place count 134 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1405 place count 134 transition count 154
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1413 place count 126 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1421 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1425 place count 122 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1429 place count 122 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1430 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1434 place count 118 transition count 136
Iterating global reduction 5 with 4 rules applied. Total rules applied 1438 place count 118 transition count 136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1441 place count 115 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 1444 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1445 place count 114 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 114 transition count 132
Applied a total of 1446 rules in 189 ms. Remains 114 /414 variables (removed 300) and now considering 132/1954 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 114/414 places, 132/1954 transitions.
// Phase 1: matrix 132 rows 114 cols
[2024-06-01 13:10:58] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224239 resets) in 1300 ms. (768 steps per ms)
BEST_FIRST walk for 3000003 steps (310164 resets) in 2033 ms. (1474 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-06-01 13:11:01] [INFO ] Invariant cache hit.
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 13:11:02] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:11:02] [INFO ] [Real]Added 49 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Nat]Added 49 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:11:02] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 12 ms.
[2024-06-01 13:11:02] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
[2024-06-01 13:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-06-01 13:11:02] [INFO ] Added : 15 causal constraints over 3 iterations in 181 ms. Result :sat
Minimization took 278 ms.
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Real]Added 49 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:11:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Nat]Added 49 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-01 13:11:03] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 18 ms.
[2024-06-01 13:11:03] [INFO ] Added : 12 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 69 ms.
[2024-06-01 13:11:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 13:11:03] [INFO ] [Nat]Added 49 Read/Feed constraints in 32 ms returned sat
[2024-06-01 13:11:03] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 19 ms.
[2024-06-01 13:11:03] [INFO ] Added : 13 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 114/114 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 13:11:03] [INFO ] Invariant cache hit.
[2024-06-01 13:11:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 13:11:04] [INFO ] Invariant cache hit.
[2024-06-01 13:11:04] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:11:04] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-01 13:11:04] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-01 13:11:04] [INFO ] Invariant cache hit.
[2024-06-01 13:11:04] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/246 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 49/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/246 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 172 constraints, problems are : Problem set: 3 solved, 128 unsolved in 16410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 132/246 variables, 114/123 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 49/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 128/300 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-06-01 13:11:25] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 301 constraints, problems are : Problem set: 3 solved, 128 unsolved in 20653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 6/6 constraints]
After SMT, in 37481ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 37495ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/114 places, 129/132 transitions.
Graph (complete) has 322 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 111 /114 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 111 cols
[2024-06-01 13:11:41] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 13:11:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 13:11:42] [INFO ] Invariant cache hit.
[2024-06-01 13:11:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 13:11:42] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/114 places, 129/132 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38665 ms. Remains : 111/114 places, 129/132 transitions.
[2024-06-01 13:11:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224545 resets) in 1627 ms. (614 steps per ms)
BEST_FIRST walk for 3000001 steps (309607 resets) in 1781 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-06-01 13:11:45] [INFO ] Invariant cache hit.
[2024-06-01 13:11:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 13:11:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 13:11:46] [INFO ] [Real]Added 48 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:11:46] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 18 ms.
[2024-06-01 13:11:46] [INFO ] Added : 12 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 77 ms.
[2024-06-01 13:11:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Real]Added 48 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:11:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 28 ms returned sat
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-06-01 13:11:46] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 15 ms.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-06-01 13:11:47] [INFO ] Added : 20 causal constraints over 4 iterations in 252 ms. Result :sat
Minimization took 91 ms.
[2024-06-01 13:11:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:47] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-01 13:11:47] [INFO ] [Real]Added 48 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:11:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:11:47] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-06-01 13:11:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 28 ms returned sat
[2024-06-01 13:11:47] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 18 ms.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-01 13:11:47] [INFO ] Added : 16 causal constraints over 4 iterations in 253 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 111/111 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 13:11:48] [INFO ] Invariant cache hit.
[2024-06-01 13:11:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 13:11:48] [INFO ] Invariant cache hit.
[2024-06-01 13:11:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 13:11:48] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-06-01 13:11:48] [INFO ] Redundant transitions in 4 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 13:11:48] [INFO ] Invariant cache hit.
[2024-06-01 13:11:48] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 13:11:50] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 5 (OVERLAPS) 129/240 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 48/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 163 constraints, problems are : Problem set: 3 solved, 125 unsolved in 7054 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 128/236 variables, 108/114 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 47/161 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 16/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 4/240 variables, 3/180 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 109/290 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 2 ms to minimize.
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 3/293 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 294 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 7/7 constraints]
After SMT, in 37297ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 37301ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 126/129 transitions.
Graph (complete) has 313 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 108 /111 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-06-01 13:12:26] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:12:26] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 13:12:26] [INFO ] Invariant cache hit.
[2024-06-01 13:12:26] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:12:26] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/111 places, 126/129 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38501 ms. Remains : 108/111 places, 126/129 transitions.
[2024-06-01 13:12:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224602 resets) in 1748 ms. (571 steps per ms)
BEST_FIRST walk for 3000002 steps (309446 resets) in 1816 ms. (1651 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-06-01 13:12:30] [INFO ] Invariant cache hit.
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 13:12:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:12:30] [INFO ] [Real]Added 47 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Nat]Added 47 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:12:30] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 17 ms.
[2024-06-01 13:12:30] [INFO ] Added : 10 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 13:12:30] [INFO ] [Real]Added 47 Read/Feed constraints in 25 ms returned sat
[2024-06-01 13:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Added 47 Read/Feed constraints in 31 ms returned sat
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:12:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 147 ms
[2024-06-01 13:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Real]Added 47 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-01 13:12:31] [INFO ] [Nat]Added 47 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:12:31] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 16 ms.
[2024-06-01 13:12:31] [INFO ] Added : 15 causal constraints over 3 iterations in 77 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 0, 42]
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 125
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 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 105 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 104 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 104 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 103 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 103 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 102 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 102 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 101 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 101 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 100 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 100 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 99 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 99 transition count 113
Applied a total of 19 rules in 39 ms. Remains 99 /108 variables (removed 9) and now considering 113/126 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 99/108 places, 113/126 transitions.
// Phase 1: matrix 113 rows 99 cols
[2024-06-01 13:12:31] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[42, 42]
RANDOM walk for 1000000 steps (224351 resets) in 1393 ms. (717 steps per ms)
BEST_FIRST walk for 2000001 steps (206615 resets) in 1083 ms. (1845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[42, 42]
[2024-06-01 13:12:34] [INFO ] Invariant cache hit.
[2024-06-01 13:12:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-01 13:12:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:12:34] [INFO ] [Real]Added 42 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:12:34] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 13:12:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:12:34] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 12 ms.
[2024-06-01 13:12:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:12:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-01 13:12:34] [INFO ] Added : 17 causal constraints over 4 iterations in 221 ms. Result :sat
Minimization took 93 ms.
[2024-06-01 13:12:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:35] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:12:35] [INFO ] [Real]Added 42 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:12:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:35] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:12:35] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2024-06-01 13:12:35] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 13 ms.
[2024-06-01 13:12:35] [INFO ] Added : 20 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[42, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/99 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 13:12:35] [INFO ] Invariant cache hit.
[2024-06-01 13:12:35] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 13:12:35] [INFO ] Invariant cache hit.
[2024-06-01 13:12:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:12:36] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-06-01 13:12:36] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 13:12:36] [INFO ] Invariant cache hit.
[2024-06-01 13:12:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 13:12:37] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 145 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7066 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 112/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 10560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 17791ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 17794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18413 ms. Remains : 99/99 places, 113/113 transitions.
RANDOM walk for 40000 steps (8952 resets) in 1033 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4159 resets) in 460 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4200 resets) in 372 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4213 resets) in 518 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4096 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
Probably explored full state space saw : 120031 states, properties seen :2
Probabilistic random walk after 302520 steps, saw 120031 distinct states, run finished after 2021 ms. (steps per millisecond=149 ) properties seen :2
Explored full state space saw : 120031 states, properties seen :0
Exhaustive walk after 302520 steps, saw 120031 distinct states, run finished after 1471 ms. (steps per millisecond=205 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[42, 42]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-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:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:12:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2239 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1006 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:12:58] [INFO ] Invariant cache hit.
[2024-06-01 13:12:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:12:58] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 13:12:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:12:58] [INFO ] [Real]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:12:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:12:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:12:58] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 13:12:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:12:58] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 11 ms.
[2024-06-01 13:12:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
[2024-06-01 13:12:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-01 13:12:58] [INFO ] Added : 17 causal constraints over 4 iterations in 193 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
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 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 97 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 95 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 95 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 94 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 94 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 93 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 93 transition count 103
Applied a total of 15 rules in 29 ms. Remains 93 /99 variables (removed 6) and now considering 103/113 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 93/99 places, 103/113 transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-06-01 13:12:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224501 resets) in 1315 ms. (759 steps per ms)
BEST_FIRST walk for 1000000 steps (103180 resets) in 514 ms. (1941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:13:00] [INFO ] Invariant cache hit.
[2024-06-01 13:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:13:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 13:13:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 13:13:00] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2024-06-01 13:13:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:13:00] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 13:13:00] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-01 13:13:00] [INFO ] Computed and/alt/rep : 24/59/24 causal constraints (skipped 78 transitions) in 9 ms.
[2024-06-01 13:13:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:13:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-06-01 13:13:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-06-01 13:13:01] [INFO ] Added : 14 causal constraints over 3 iterations in 175 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 93/93 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:13:01] [INFO ] Invariant cache hit.
[2024-06-01 13:13:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 13:13:01] [INFO ] Invariant cache hit.
[2024-06-01 13:13:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 13:13:01] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-01 13:13:01] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-01 13:13:01] [INFO ] Invariant cache hit.
[2024-06-01 13:13:01] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 13:13:02] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 13:13:06] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:13:06] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 137 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8066 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/196 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 102/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 239 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 18491ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 18494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18867 ms. Remains : 93/93 places, 103/103 transitions.
RANDOM walk for 40000 steps (8975 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4140 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4175 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Probably explored full state space saw : 95259 states, properties seen :1
Probabilistic random walk after 235248 steps, saw 95259 distinct states, run finished after 289 ms. (steps per millisecond=814 ) properties seen :1
Explored full state space saw : 95259 states, properties seen :0
Exhaustive walk after 235248 steps, saw 95259 distinct states, run finished after 229 ms. (steps per millisecond=1027 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 in 22472 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 113 rows 99 cols
[2024-06-01 13:13:20] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2205 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (986 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:13:20] [INFO ] Invariant cache hit.
[2024-06-01 13:13:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:13:20] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 13:13:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:13:20] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:13:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:13:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:13:21] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 13:13:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:13:21] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 9 ms.
[2024-06-01 13:13:21] [INFO ] Added : 20 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Applied a total of 5 rules in 10 ms. Remains 97 /99 variables (removed 2) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 97/99 places, 109/113 transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-06-01 13:13:21] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224795 resets) in 1236 ms. (808 steps per ms)
BEST_FIRST walk for 1000001 steps (103251 resets) in 551 ms. (1811 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:13:23] [INFO ] Invariant cache hit.
[2024-06-01 13:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:13:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 13:13:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:13:23] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:13:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:13:23] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 13:13:23] [INFO ] [Nat]Added 41 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:13:23] [INFO ] Computed and/alt/rep : 25/64/25 causal constraints (skipped 83 transitions) in 11 ms.
[2024-06-01 13:13:23] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 13:13:23] [INFO ] Invariant cache hit.
[2024-06-01 13:13:23] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 13:13:23] [INFO ] Invariant cache hit.
[2024-06-01 13:13:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:13:24] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-01 13:13:24] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 13:13:24] [INFO ] Invariant cache hit.
[2024-06-01 13:13:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9245 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 14431ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14961 ms. Remains : 97/97 places, 109/109 transitions.
RANDOM walk for 40000 steps (8979 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4118 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4166 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Probably explored full state space saw : 96730 states, properties seen :1
Probabilistic random walk after 239870 steps, saw 96730 distinct states, run finished after 416 ms. (steps per millisecond=576 ) properties seen :1
Explored full state space saw : 96730 states, properties seen :0
Exhaustive walk after 239870 steps, saw 96730 distinct states, run finished after 268 ms. (steps per millisecond=895 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 18501 ms.
[2024-06-01 13:13:39] [INFO ] Flatten gal took : 62 ms
[2024-06-01 13:13:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 33 ms.
[2024-06-01 13:13:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 113 transitions and 448 arcs took 7 ms.
Total runtime 183079 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-d2m06-UpperBounds-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m06-UpperBounds-14

BK_STOP 1717247619935

--------------------
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-d2m06-UpperBounds-00
ub formula formula --maxsum=/tmp/847/ub_0_
ub formula name SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
ub formula formula --maxsum=/tmp/847/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-d2m06"
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-d2m06, 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-171683810800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m06.tgz
mv SieveSingleMsgMbox-PT-d2m06 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 ;