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.r333-tall-171679077600053.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 greatspnxred
Input is RingSingleMessageInMbox-PT-d0m160, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m160-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716792769213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:52:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 06:52:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:52:50] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-27 06:52:50] [INFO ] Transformed 385 places.
[2024-05-27 06:52:50] [INFO ] Transformed 59 transitions.
[2024-05-27 06:52:50] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 59 rows 56 cols
[2024-05-27 06:52:50] [INFO ] Computed 5 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[1, 1, 12, 1, 223]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2107 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 40002 steps (3618 resets) in 58 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 2] Max Struct:[1, 12, 1, 223]
[2024-05-27 06:52:50] [INFO ] Invariant cache hit.
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned unsat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:52:50] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2024-05-27 06:52:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:52:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 06:52:51] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:52:51] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-27 06:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:52:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 06:52:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 06:52:51] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-27 06:52:51] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 10 ms.
[2024-05-27 06:52:51] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 2] Max Struct:[0, 1, 0, 223]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[223]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 59/59 transitions.
Graph (complete) has 148 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 46 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 45 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 45 transition count 46
Applied a total of 20 rules in 33 ms. Remains 45 /56 variables (removed 11) and now considering 46/59 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 45/56 places, 46/59 transitions.
// Phase 1: matrix 46 rows 45 cols
[2024-05-27 06:52:51] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[223]
RANDOM walk for 1000000 steps (217036 resets) in 705 ms. (1416 steps per ms)
BEST_FIRST walk for 1000000 steps (92900 resets) in 318 ms. (3134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[223]
[2024-05-27 06:52:52] [INFO ] Invariant cache hit.
[2024-05-27 06:52:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:52] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:52:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 06:52:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 06:52:52] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2024-05-27 06:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:52:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:52] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 06:52:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-27 06:52:52] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:52:52] [INFO ] Computed and/alt/rep : 11/26/11 causal constraints (skipped 34 transitions) in 4 ms.
[2024-05-27 06:52:52] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[223]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-27 06:52:52] [INFO ] Invariant cache hit.
[2024-05-27 06:52:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-27 06:52:52] [INFO ] Invariant cache hit.
[2024-05-27 06:52:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 06:52:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-27 06:52:52] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-27 06:52:52] [INFO ] Invariant cache hit.
[2024-05-27 06:52:52] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 46/91 variables, 45/49 constraints. Problems are: Problem set: 5 solved, 40 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 18/67 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 40 unsolved
[2024-05-27 06:52:53] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/91 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 68 constraints, problems are : Problem set: 5 solved, 40 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 46/91 variables, 45/50 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 18/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 40/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 108 constraints, problems are : Problem set: 5 solved, 40 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 40/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 1941ms problems are : Problem set: 5 solved, 40 unsolved
Search for dead transitions found 5 dead transitions in 1951ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/45 places, 41/46 transitions.
Graph (complete) has 110 edges and 45 vertex of which 41 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 41 /45 variables (removed 4) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-27 06:52:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:52:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 06:52:54] [INFO ] Invariant cache hit.
[2024-05-27 06:52:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:52:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/45 places, 41/46 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2255 ms. Remains : 41/45 places, 41/46 transitions.
[2024-05-27 06:52:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[223]
RANDOM walk for 1000000 steps (216691 resets) in 467 ms. (2136 steps per ms)
BEST_FIRST walk for 1000001 steps (93696 resets) in 259 ms. (3846 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:52:55] [INFO ] Invariant cache hit.
[2024-05-27 06:52:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 06:52:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:52:55] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:52:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:52:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:52:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:52:55] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2024-05-27 06:52:55] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:52:55] [INFO ] Invariant cache hit.
[2024-05-27 06:52:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 06:52:55] [INFO ] Invariant cache hit.
[2024-05-27 06:52:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:52:55] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-27 06:52:55] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:52:55] [INFO ] Invariant cache hit.
[2024-05-27 06:52:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1425ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1526 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:52:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[223]
RANDOM walk for 1000000 steps (216568 resets) in 463 ms. (2155 steps per ms)
BEST_FIRST walk for 1000000 steps (93457 resets) in 247 ms. (4032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:52:57] [INFO ] Invariant cache hit.
[2024-05-27 06:52:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 06:52:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:52:57] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:52:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:52:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 06:52:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-27 06:52:57] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 4 ms.
[2024-05-27 06:52:57] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:52:57] [INFO ] Invariant cache hit.
[2024-05-27 06:52:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 06:52:57] [INFO ] Invariant cache hit.
[2024-05-27 06:52:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:52:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-27 06:52:58] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:52:58] [INFO ] Invariant cache hit.
[2024-05-27 06:52:58] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1183ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1301 ms. Remains : 41/41 places, 41/41 transitions.
RANDOM walk for 40000 steps (8630 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3651 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3695 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3912079 steps, run timeout after 3001 ms. (steps per millisecond=1303 ) properties seen :1 out of 2
Probabilistic random walk after 3912079 steps, saw 1490409 distinct states, run finished after 3005 ms. (steps per millisecond=1301 ) properties seen :1
[2024-05-27 06:53:02] [INFO ] Invariant cache hit.
[2024-05-27 06:53:02] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 81/82 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 40/41 constraints, ReadFeed: 2/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[223]
Starting property specific reduction for RingSingleMessageInMbox-PT-d0m160-UpperBounds-15
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:[223]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[223]
[2024-05-27 06:53:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[223]
RANDOM walk for 10000 steps (2176 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10000 steps (993 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[223]
[2024-05-27 06:53:02] [INFO ] Invariant cache hit.
[2024-05-27 06:53:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:53:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:53:02] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:53:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 06:53:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:53:02] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2024-05-27 06:53:02] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:53:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[223]
RANDOM walk for 1000000 steps (217214 resets) in 462 ms. (2159 steps per ms)
BEST_FIRST walk for 1000001 steps (93363 resets) in 240 ms. (4149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:53:03] [INFO ] Invariant cache hit.
[2024-05-27 06:53:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:53:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:53:03] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-27 06:53:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:53:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-27 06:53:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:53:03] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2024-05-27 06:53:03] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:53:03] [INFO ] Invariant cache hit.
[2024-05-27 06:53:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 06:53:03] [INFO ] Invariant cache hit.
[2024-05-27 06:53:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:53:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-27 06:53:03] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:53:03] [INFO ] Invariant cache hit.
[2024-05-27 06:53:03] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:53:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[223]
RANDOM walk for 1000000 steps (216898 resets) in 455 ms. (2192 steps per ms)
BEST_FIRST walk for 1000000 steps (93132 resets) in 240 ms. (4149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:53:05] [INFO ] Invariant cache hit.
[2024-05-27 06:53:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:53:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:53:05] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:53:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:53:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:53:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:53:05] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2024-05-27 06:53:05] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:53:05] [INFO ] Invariant cache hit.
[2024-05-27 06:53:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 06:53:05] [INFO ] Invariant cache hit.
[2024-05-27 06:53:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:53:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-27 06:53:05] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:53:05] [INFO ] Invariant cache hit.
[2024-05-27 06:53:05] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1153ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 41/41 places, 41/41 transitions.
RANDOM walk for 40000 steps (8640 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3784 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3810 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 4357033 steps, run timeout after 3001 ms. (steps per millisecond=1451 ) properties seen :1 out of 2
Probabilistic random walk after 4357033 steps, saw 1658319 distinct states, run finished after 3001 ms. (steps per millisecond=1451 ) properties seen :1
[2024-05-27 06:53:09] [INFO ] Invariant cache hit.
[2024-05-27 06:53:09] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 81/82 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 40/41 constraints, ReadFeed: 2/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[223]
Ending property specific reduction for RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 in 7265 ms.
[2024-05-27 06:53:10] [INFO ] Flatten gal took : 23 ms
[2024-05-27 06:53:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-27 06:53:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 41 transitions and 161 arcs took 3 ms.
Total runtime 19794 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d0m160

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 41
TRANSITIONS: 41
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 702
MODEL NAME: /home/mcc/execution/412/model
41 places, 41 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 158 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716792793682

--------------------
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="RingSingleMessageInMbox-PT-d0m160"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d0m160, 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 r333-tall-171679077600053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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