fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r532-smll-171683810700061
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
534.315 61907.00 93800.00 424.80 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 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-171683810700061.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-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 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 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-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717243126898

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:58:49] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-01 11:58:49] [INFO ] Transformed 1295 places.
[2024-06-01 11:58:49] [INFO ] Transformed 749 transitions.
[2024-06-01 11:58:49] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 161 ms.
Deduced a syphon composed of 1036 places in 12 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-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 749 rows 259 cols
[2024-06-01 11:58:50] [INFO ] Computed 6 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 10000 steps (2195 resets) in 273 ms. (36 steps per ms)
BEST_FIRST walk for 30003 steps (2979 resets) in 332 ms. (90 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 11:58:50] [INFO ] Invariant cache hit.
[2024-06-01 11:58:51] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 11:58:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 21 ms returned sat
[2024-06-01 11:58:51] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-06-01 11:58:51] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-06-01 11:58:52] [INFO ] [Real]Added 587 Read/Feed constraints in 179 ms returned sat
[2024-06-01 11:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:58:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 11:58:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:58:52] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-06-01 11:58:52] [INFO ] [Nat]Added 587 Read/Feed constraints in 217 ms returned sat
[2024-06-01 11:58:53] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 32 ms to minimize.
[2024-06-01 11:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2024-06-01 11:58:53] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 190 ms.
[2024-06-01 11:58:53] [INFO ] Added : 15 causal constraints over 3 iterations in 439 ms. Result :sat
Minimization took 581 ms.
[2024-06-01 11:58:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:58:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:58:54] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-06-01 11:58:54] [INFO ] [Real]Added 587 Read/Feed constraints in 116 ms returned sat
[2024-06-01 11:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:58:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:58:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:58:55] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-06-01 11:58:55] [INFO ] [Nat]Added 587 Read/Feed constraints in 120 ms returned sat
[2024-06-01 11:58:55] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-01 11:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-06-01 11:58:55] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 93 ms.
[2024-06-01 11:58:56] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-06-01 11:58:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-06-01 11:58:56] [INFO ] Added : 19 causal constraints over 4 iterations in 735 ms. Result :sat
Minimization took 569 ms.
[2024-06-01 11:58:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:58:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:58:57] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-01 11:58:57] [INFO ] [Real]Added 587 Read/Feed constraints in 124 ms returned sat
[2024-06-01 11:58:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:58:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 11:58:57] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:58:57] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-01 11:58:57] [INFO ] [Nat]Added 587 Read/Feed constraints in 220 ms returned sat
[2024-06-01 11:58:58] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 5 ms to minimize.
[2024-06-01 11:58:58] [INFO ] Deduced a trap composed of 71 places in 369 ms of which 5 ms to minimize.
[2024-06-01 11:58:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 784 ms
[2024-06-01 11:58:58] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 110 ms.
[2024-06-01 11:58:58] [INFO ] Added : 12 causal constraints over 3 iterations in 466 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
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.6 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 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 231
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 225
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 413 place count 137 transition count 181
Iterating global reduction 2 with 44 rules applied. Total rules applied 457 place count 137 transition count 181
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 472 place count 137 transition count 166
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 498 place count 111 transition count 138
Iterating global reduction 3 with 26 rules applied. Total rules applied 524 place count 111 transition count 138
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 111 transition count 122
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 546 place count 105 transition count 114
Iterating global reduction 4 with 6 rules applied. Total rules applied 552 place count 105 transition count 114
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 558 place count 99 transition count 108
Iterating global reduction 4 with 6 rules applied. Total rules applied 564 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 567 place count 96 transition count 105
Iterating global reduction 4 with 3 rules applied. Total rules applied 570 place count 96 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 572 place count 96 transition count 103
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 575 place count 93 transition count 100
Iterating global reduction 5 with 3 rules applied. Total rules applied 578 place count 93 transition count 100
Applied a total of 578 rules in 189 ms. Remains 93 /259 variables (removed 166) and now considering 100/749 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 93/259 places, 100/749 transitions.
// Phase 1: matrix 100 rows 93 cols
[2024-06-01 11:58:59] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (224073 resets) in 1101 ms. (907 steps per ms)
BEST_FIRST walk for 3000002 steps (310264 resets) in 1591 ms. (1884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 11:59:02] [INFO ] Invariant cache hit.
[2024-06-01 11:59:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:59:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:59:02] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 11:59:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 11:59:02] [INFO ] [Real]Added 38 Read/Feed constraints in 12 ms returned sat
[2024-06-01 11:59:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:59:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 11:59:02] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-01 11:59:02] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 73 transitions) in 13 ms.
[2024-06-01 11:59:02] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 75 ms.
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Added 38 Read/Feed constraints in 14 ms returned sat
[2024-06-01 11:59:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Added 38 Read/Feed constraints in 15 ms returned sat
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-01 11:59:03] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 73 transitions) in 12 ms.
[2024-06-01 11:59:03] [INFO ] Added : 9 causal constraints over 2 iterations in 59 ms. Result :sat
Minimization took 55 ms.
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Real]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:59:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:59:03] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:59:03] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 73 transitions) in 9 ms.
[2024-06-01 11:59:03] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 93 /93 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 93/93 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 93 /93 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 11:59:03] [INFO ] Invariant cache hit.
[2024-06-01 11:59:04] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 11:59:04] [INFO ] Invariant cache hit.
[2024-06-01 11:59:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 11:59:04] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-06-01 11:59:04] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 11:59:04] [INFO ] Invariant cache hit.
[2024-06-01 11:59:04] [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, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 11:59:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 100/193 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 11:59:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/137 constraints. Problems are: Problem set: 3 solved, 96 unsolved
[2024-06-01 11:59:09] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/138 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 138 constraints, problems are : Problem set: 3 solved, 96 unsolved in 7741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 4/93 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 100/193 variables, 93/100 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 38/138 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 96/234 constraints. Problems are: Problem set: 3 solved, 96 unsolved
[2024-06-01 11:59:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/235 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 235 constraints, problems are : Problem set: 3 solved, 96 unsolved in 14427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 96/99 constraints, Known Traps: 4/4 constraints]
After SMT, in 22461ms problems are : Problem set: 3 solved, 96 unsolved
Search for dead transitions found 3 dead transitions in 22475ms
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 : 93/93 places, 97/100 transitions.
Graph (complete) has 251 edges and 93 vertex of which 90 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 12 ms. Remains 90 /93 variables (removed 3) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 90 cols
[2024-06-01 11:59:26] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 11:59:27] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 11:59:27] [INFO ] Invariant cache hit.
[2024-06-01 11:59:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 11:59:27] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/93 places, 97/100 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23458 ms. Remains : 90/93 places, 97/100 transitions.
[2024-06-01 11:59:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (224360 resets) in 1389 ms. (719 steps per ms)
BEST_FIRST walk for 2000000 steps (207568 resets) in 1406 ms. (1421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 11:59:30] [INFO ] Invariant cache hit.
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 11:59:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 11:59:30] [INFO ] [Real]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-01 11:59:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:59:30] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
[2024-06-01 11:59:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-01 11:59:30] [INFO ] Computed and/alt/rep : 25/56/25 causal constraints (skipped 71 transitions) in 8 ms.
[2024-06-01 11:59:30] [INFO ] Added : 9 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:59:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:59:30] [INFO ] [Nat]Added 37 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:59:30] [INFO ] Computed and/alt/rep : 25/56/25 causal constraints (skipped 71 transitions) in 10 ms.
[2024-06-01 11:59:30] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 97/97 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 95
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 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 85 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 83 transition count 88
Applied a total of 15 rules in 29 ms. Remains 83 /90 variables (removed 7) and now considering 88/97 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 83/90 places, 88/97 transitions.
// Phase 1: matrix 88 rows 83 cols
[2024-06-01 11:59:30] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (224409 resets) in 1074 ms. (930 steps per ms)
BEST_FIRST walk for 2000002 steps (206593 resets) in 900 ms. (2219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 11:59:32] [INFO ] Invariant cache hit.
[2024-06-01 11:59:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:59:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:32] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-01 11:59:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 11:59:32] [INFO ] [Real]Added 33 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:59:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Nat]Added 33 Read/Feed constraints in 12 ms returned sat
[2024-06-01 11:59:33] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:59:33] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2024-06-01 11:59:33] [INFO ] Computed and/alt/rep : 22/50/22 causal constraints (skipped 65 transitions) in 9 ms.
[2024-06-01 11:59:33] [INFO ] Added : 15 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 63 ms.
[2024-06-01 11:59:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Real]Added 33 Read/Feed constraints in 27 ms returned sat
[2024-06-01 11:59:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 11:59:33] [INFO ] [Nat]Added 33 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:59:33] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-01 11:59:33] [INFO ] Computed and/alt/rep : 22/50/22 causal constraints (skipped 65 transitions) in 9 ms.
[2024-06-01 11:59:33] [INFO ] Added : 11 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 11:59:33] [INFO ] Invariant cache hit.
[2024-06-01 11:59:34] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 11:59:34] [INFO ] Invariant cache hit.
[2024-06-01 11:59:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 11:59:34] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-01 11:59:34] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 11:59:34] [INFO ] Invariant cache hit.
[2024-06-01 11:59:34] [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, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 11:59:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/171 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 33/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 123 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 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, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/171 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 210 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints]
After SMT, in 13684ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 13687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14086 ms. Remains : 83/83 places, 88/88 transitions.
RANDOM walk for 40000 steps (9031 resets) in 967 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4180 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4193 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4283 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4104 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1537 steps, run visited all 4 properties in 48 ms. (steps per millisecond=32 )
Probabilistic random walk after 1537 steps, saw 752 distinct states, run finished after 55 ms. (steps per millisecond=27 ) properties seen :4
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 59395 ms.
ITS solved all properties within timeout

BK_STOP 1717243188805

--------------------
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

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-d1m06"
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-d1m06, 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-171683810700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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