About the Execution of LTSMin+red for JoinFreeModules-PT-5000
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.r504-tall-171649612000093.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 JoinFreeModules-PT-5000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612000093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 JoinFreeModules-PT-5000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717223091961
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:24:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:24:54] [INFO ] Load time of PNML (sax parser for PT used): 895 ms
[2024-06-01 06:24:54] [INFO ] Transformed 25001 places.
[2024-06-01 06:24:54] [INFO ] Transformed 40001 transitions.
[2024-06-01 06:24:54] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1111 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 40001 rows 25000 cols
[2024-06-01 06:24:54] [INFO ] Computed 5000 invariants in 234 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 10003 steps (1 resets) in 2099 ms. (4 steps per ms)
BEST_FIRST walk for 160016 steps (0 resets) in 38125 ms. (4 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:25:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 80 are kept as prefixes of interest. Removing 24920 places using SCC suffix rule.33 ms
Discarding 24920 places :
Also discarding 39872 output transitions
Drop transitions (Output transitions of discarded places.) removed 39872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 164 ms. Remains 80 /25000 variables (removed 24920) and now considering 128/40001 (removed 39873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-06-01 06:26:25] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 06:26:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3210 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 5160ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5372 ms. Remains : 80/25000 places, 128/40001 transitions.
[2024-06-01 06:26:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1002480 steps (2 resets) in 882 ms. (1135 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 18767 ms. (852 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3628, 3752, 4500, 3125, 3750, 5001, 5000, 4878, 4249, 4013, 4864, 4366, 5000, 5000, 5001, 3750] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:26:50] [INFO ] Invariant cache hit.
[2024-06-01 06:26:50] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 06:26:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:26:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:50] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:26:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 06:26:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:26:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 7 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2024-06-01 06:26:51] [INFO ] Added : 76 causal constraints over 17 iterations in 463 ms. Result :sat
Minimization took 235 ms.
[2024-06-01 06:26:51] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-06-01 06:26:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-06-01 06:26:52] [INFO ] Added : 76 causal constraints over 18 iterations in 327 ms. Result :sat
Minimization took 270 ms.
[2024-06-01 06:26:52] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:52] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:26:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:26:52] [INFO ] Added : 59 causal constraints over 13 iterations in 122 ms. Result :sat
Minimization took 181 ms.
[2024-06-01 06:26:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:26:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-06-01 06:26:53] [INFO ] Added : 57 causal constraints over 12 iterations in 228 ms. Result :sat
Minimization took 232 ms.
[2024-06-01 06:26:53] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 06:26:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 06:26:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-06-01 06:26:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-01 06:26:53] [INFO ] Added : 64 causal constraints over 15 iterations in 190 ms. Result :sat
Minimization took 214 ms.
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-06-01 06:26:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 06:26:54] [INFO ] Added : 39 causal constraints over 8 iterations in 135 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 66 ms returned sat
[2024-06-01 06:26:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 06:26:54] [INFO ] Added : 62 causal constraints over 14 iterations in 138 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:26:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-01 06:26:55] [INFO ] Added : 67 causal constraints over 14 iterations in 174 ms. Result :sat
Minimization took 111 ms.
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:26:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:26:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:26:55] [INFO ] Added : 74 causal constraints over 16 iterations in 212 ms. Result :sat
Minimization took 193 ms.
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:26:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:26:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 06:26:56] [INFO ] Added : 64 causal constraints over 14 iterations in 138 ms. Result :sat
Minimization took 199 ms.
[2024-06-01 06:26:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-06-01 06:26:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:26:56] [INFO ] Added : 57 causal constraints over 12 iterations in 163 ms. Result :sat
Minimization took 110 ms.
[2024-06-01 06:26:56] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 06:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-06-01 06:26:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:26:57] [INFO ] Added : 53 causal constraints over 12 iterations in 158 ms. Result :sat
Minimization took 50 ms.
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:26:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:26:57] [INFO ] Added : 48 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 06:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:26:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:26:57] [INFO ] Added : 57 causal constraints over 12 iterations in 141 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:26:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:26:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:26:58] [INFO ] Added : 70 causal constraints over 16 iterations in 241 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 06:26:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:58] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 06:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:26:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:26:58] [INFO ] Added : 72 causal constraints over 16 iterations in 179 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3628, 3752, 4500, 3125, 3750, 5001, 5000, 4878, 4249, 4013, 4864, 4366, 5000, 5000, 5001, 3750] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 06:31:22] [INFO ] Invariant cache hit.
[2024-06-01 06:31:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 06:31:22] [INFO ] Invariant cache hit.
[2024-06-01 06:31:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 06:31:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-01 06:31:22] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 06:31:22] [INFO ] Invariant cache hit.
[2024-06-01 06:31:22] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2407 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4156ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4298 ms. Remains : 80/80 places, 128/128 transitions.
[2024-06-01 06:31:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001110 steps (2 resets) in 826 ms. (1210 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 18053 ms. (886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:31:45] [INFO ] Invariant cache hit.
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 06:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:31:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 06:31:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:31:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:31:45] [INFO ] Added : 67 causal constraints over 14 iterations in 120 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 06:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:31:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:31:45] [INFO ] Added : 69 causal constraints over 15 iterations in 209 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-06-01 06:31:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:31:46] [INFO ] Added : 71 causal constraints over 16 iterations in 158 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 06:31:46] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-06-01 06:31:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:31:46] [INFO ] Added : 51 causal constraints over 13 iterations in 157 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 06:31:46] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 06:31:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:31:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:31:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-06-01 06:31:47] [INFO ] Added : 74 causal constraints over 16 iterations in 240 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-06-01 06:31:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 06:31:47] [INFO ] Added : 39 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 06:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-06-01 06:31:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:31:47] [INFO ] Added : 62 causal constraints over 14 iterations in 124 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:31:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2024-06-01 06:31:48] [INFO ] Added : 68 causal constraints over 15 iterations in 237 ms. Result :sat
Minimization took 41 ms.
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2024-06-01 06:31:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:31:48] [INFO ] Added : 73 causal constraints over 17 iterations in 148 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:31:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:31:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
Minimization took 15 ms.
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 06:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-06-01 06:31:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 06:31:49] [INFO ] Added : 73 causal constraints over 15 iterations in 139 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:31:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:31:49] [INFO ] Added : 74 causal constraints over 15 iterations in 128 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 06:31:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-06-01 06:31:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 06:31:50] [INFO ] Added : 57 causal constraints over 12 iterations in 135 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 06:31:50] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-06-01 06:31:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:31:50] [INFO ] Added : 70 causal constraints over 16 iterations in 228 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 06:31:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:31:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:31:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:31:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:31:50] [INFO ] Added : 61 causal constraints over 14 iterations in 152 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5002, 5002, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-10 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-09 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2024-06-01 06:35:39] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000142 steps (2 resets) in 723 ms. (1381 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 13976 ms. (1001 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:35:54] [INFO ] Invariant cache hit.
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 06:35:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 06:35:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:35:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:35:54] [INFO ] Added : 26 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:35:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:35:54] [INFO ] Added : 35 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 38 ms returned sat
[2024-06-01 06:35:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 80 ms
[2024-06-01 06:35:55] [INFO ] Added : 51 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Added 14 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:35:55] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 06:35:55] [INFO ] Added : 24 causal constraints over 6 iterations in 86 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:35:55] [INFO ] Added : 42 causal constraints over 10 iterations in 71 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:35:55] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:35:55] [INFO ] Added : 39 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:35:56] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:35:56] [INFO ] Added : 49 causal constraints over 10 iterations in 109 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-06-01 06:35:56] [INFO ] Added : 36 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:35:56] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:35:57] [INFO ] Added : 37 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Added 14 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:35:57] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:35:57] [INFO ] Added : 25 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:35:57] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:35:57] [INFO ] Added : 41 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 06:35:57] [INFO ] [Nat]Added 14 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:35:57] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:35:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:35:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5002, 5002, 5003, 5003, 5003, 5002]
FORMULA JoinFreeModules-PT-5000-UpperBounds-15 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-11 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-08 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 55 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 55 /70 variables (removed 15) and now considering 88/112 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 55/70 places, 88/112 transitions.
// Phase 1: matrix 88 rows 55 cols
[2024-06-01 06:38:07] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001497 steps (2 resets) in 567 ms. (1763 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 8863 ms. (1240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:38:16] [INFO ] Invariant cache hit.
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 06:38:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 06:38:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:38:16] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:38:16] [INFO ] Added : 35 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:38:16] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:38:16] [INFO ] Added : 51 causal constraints over 11 iterations in 139 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 06:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 214 ms returned sat
[2024-06-01 06:38:17] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:38:17] [INFO ] Added : 53 causal constraints over 11 iterations in 101 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:38:17] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:38:17] [INFO ] Added : 31 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:38:17] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:38:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:38:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
Minimization took 11 ms.
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:17] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:38:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:38:18] [INFO ] Added : 28 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 145 ms returned sat
[2024-06-01 06:38:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 06:38:18] [INFO ] Added : 37 causal constraints over 9 iterations in 68 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:38:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:38:18] [INFO ] Added : 35 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:38:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 189 ms returned sat
[2024-06-01 06:38:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:38:18] [INFO ] Added : 32 causal constraints over 9 iterations in 64 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 06:38:19] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:38:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 77 ms returned sat
[2024-06-01 06:38:19] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:38:19] [INFO ] Added : 39 causal constraints over 10 iterations in 63 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 06:38:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:38:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:38:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:38:19] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:38:19] [INFO ] Added : 57 causal constraints over 12 iterations in 75 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5002, 5003, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-04 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 50 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 6 ms. Remains 50 /55 variables (removed 5) and now considering 80/88 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 50/55 places, 80/88 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-06-01 06:39:39] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000046 steps (2 resets) in 507 ms. (1968 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 7313 ms. (1367 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:39:47] [INFO ] Invariant cache hit.
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 06:39:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 38 ms returned sat
[2024-06-01 06:39:47] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:39:47] [INFO ] Added : 29 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:39:47] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:39:47] [INFO ] Added : 39 causal constraints over 9 iterations in 50 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:39:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:39:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:39:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:39:48] [INFO ] Added : 17 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:39:48] [INFO ] Added : 21 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 87 ms returned sat
[2024-06-01 06:39:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:39:48] [INFO ] Added : 34 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:39:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:39:48] [INFO ] Added : 46 causal constraints over 10 iterations in 115 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 111 ms returned sat
[2024-06-01 06:39:49] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:39:49] [INFO ] Added : 42 causal constraints over 10 iterations in 85 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 06:39:49] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 67 ms returned sat
[2024-06-01 06:39:49] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:39:49] [INFO ] Added : 28 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 06:39:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:39:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2024-06-01 06:39:49] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:39:49] [INFO ] Added : 29 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5002, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-02 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 45 /50 variables (removed 5) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 45/50 places, 72/80 transitions.
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:40:48] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000180 steps (2 resets) in 485 ms. (2057 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 5794 ms. (1553 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-06-01 06:40:54] [INFO ] Invariant cache hit.
[2024-06-01 06:40:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:40:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:40:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:40:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:40:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:40:55] [INFO ] Added : 36 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:40:55] [INFO ] Added : 41 causal constraints over 10 iterations in 50 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-06-01 06:40:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:40:55] [INFO ] Added : 37 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 53 ms returned sat
[2024-06-01 06:40:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:40:55] [INFO ] Added : 23 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:40:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 71 ms returned sat
[2024-06-01 06:40:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 06:40:55] [INFO ] Added : 33 causal constraints over 9 iterations in 128 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:40:56] [INFO ] Added : 39 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:40:56] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 06:40:56] [INFO ] Added : 40 causal constraints over 10 iterations in 84 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 106 ms returned sat
[2024-06-01 06:40:56] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:40:56] [INFO ] Added : 38 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:40:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:40:56] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:40:56] [INFO ] Added : 37 causal constraints over 9 iterations in 46 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 9 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 45/45 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-01 06:41:49] [INFO ] Invariant cache hit.
[2024-06-01 06:41:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 06:41:49] [INFO ] Invariant cache hit.
[2024-06-01 06:41:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:41:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 06:41:49] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 06:41:49] [INFO ] Invariant cache hit.
[2024-06-01 06:41:49] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 9/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 72/117 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 63 constraints, problems are : Problem set: 0 solved, 54 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 9/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 72/117 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 117 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1652ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1652ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1728 ms. Remains : 45/45 places, 72/72 transitions.
RANDOM walk for 40016 steps (6 resets) in 32 ms. (1212 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 173294 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 18
Probabilistic random walk after 173294 steps, saw 160653 distinct states, run finished after 3006 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 06:41:54] [INFO ] Invariant cache hit.
[2024-06-01 06:41:54] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 36/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 8/17 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/62 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 9/71 constraints. Problems are: Problem set: 8 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/71 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/71 constraints. Problems are: Problem set: 8 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 71 constraints, problems are : Problem set: 8 solved, 10 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 8 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 36/45 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 8/17 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/62 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 9/71 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/81 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/81 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/81 constraints. Problems are: Problem set: 8 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 81 constraints, problems are : Problem set: 8 solved, 10 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 10/18 constraints, Known Traps: 8/8 constraints]
After SMT, in 927ms problems are : Problem set: 8 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 30000 ms.
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 35 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /45 variables (removed 10) and now considering 56/72 (removed 16) transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 06:42:25] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 06:42:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1067ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1069ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 35/45 places, 56/72 transitions.
RANDOM walk for 40016 steps (5 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 221643 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 8
Probabilistic random walk after 221643 steps, saw 199435 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 06:42:29] [INFO ] Invariant cache hit.
[2024-06-01 06:42:29] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:42:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:42:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:42:30] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:42:30] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 61 constraints, problems are : Problem set: 0 solved, 8 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 455ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 30000 ms.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 25 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 25 /35 variables (removed 10) and now considering 40/56 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/35 places, 40/56 transitions.
RANDOM walk for 47519 steps (7 resets) in 19 ms. (2375 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 400020 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 5
Probabilistic random walk after 400020 steps, saw 341729 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 06:43:03] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 06:43:03] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 43 constraints, problems are : Problem set: 0 solved, 5 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18044 ms.
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 06:43:22] [INFO ] Invariant cache hit.
[2024-06-01 06:43:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:43:22] [INFO ] Invariant cache hit.
[2024-06-01 06:43:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:43:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 06:43:22] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 06:43:22] [INFO ] Invariant cache hit.
[2024-06-01 06:43:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 25/25 places, 40/40 transitions.
FORMULA JoinFreeModules-PT-5000-UpperBounds-12 5003 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:43:22] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[5003]
[2024-06-01 06:43:22] [INFO ] Invariant cache hit.
[2024-06-01 06:43:22] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:43:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:43:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:43:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:43:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:43:22] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:43:22] [INFO ] Added : 34 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:43:29] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 06:43:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:43:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000255 steps (2 resets) in 102 ms. (9711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 136 ms. (7299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:43:29] [INFO ] Invariant cache hit.
[2024-06-01 06:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:43:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:43:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:43:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:43:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:43:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 06:43:29] [INFO ] Added : 5 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:43:30] [INFO ] Invariant cache hit.
[2024-06-01 06:43:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 06:43:30] [INFO ] Invariant cache hit.
[2024-06-01 06:43:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 06:43:30] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:30] [INFO ] Invariant cache hit.
[2024-06-01 06:43:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 45481 steps (7 resets) in 17 ms. (2526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 880114 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 880114 steps, saw 393390 distinct states, run finished after 3002 ms. (steps per millisecond=293 ) properties seen :0
[2024-06-01 06:43:33] [INFO ] Invariant cache hit.
[2024-06-01 06:43:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 266 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:34] [INFO ] Invariant cache hit.
[2024-06-01 06:43:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 44272 steps (7 resets) in 12 ms. (3405 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3992905 steps, run timeout after 3001 ms. (steps per millisecond=1330 ) properties seen :0 out of 1
Probabilistic random walk after 3992905 steps, saw 1509497 distinct states, run finished after 3001 ms. (steps per millisecond=1330 ) properties seen :0
[2024-06-01 06:43:37] [INFO ] Invariant cache hit.
[2024-06-01 06:43:37] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:43:37] [INFO ] Invariant cache hit.
[2024-06-01 06:43:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 06:43:37] [INFO ] Invariant cache hit.
[2024-06-01 06:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 06:43:37] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:37] [INFO ] Invariant cache hit.
[2024-06-01 06:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-00 in 14988 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01
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:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:43:37] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[5003]
[2024-06-01 06:43:37] [INFO ] Invariant cache hit.
[2024-06-01 06:43:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:43:37] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:43:37] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:43:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:43:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:43:37] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:43:37] [INFO ] Added : 40 causal constraints over 10 iterations in 57 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:43:44] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 06:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:43:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000413 steps (2 resets) in 100 ms. (9905 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 131 ms. (7575 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:43:44] [INFO ] Invariant cache hit.
[2024-06-01 06:43:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:43:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:43:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:43:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-06-01 06:43:44] [INFO ] Added : 5 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:43:45] [INFO ] Invariant cache hit.
[2024-06-01 06:43:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 06:43:45] [INFO ] Invariant cache hit.
[2024-06-01 06:43:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 06:43:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:45] [INFO ] Invariant cache hit.
[2024-06-01 06:43:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 43815 steps (6 resets) in 9 ms. (4381 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 881603 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 881603 steps, saw 394011 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2024-06-01 06:43:48] [INFO ] Invariant cache hit.
[2024-06-01 06:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 79ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 269 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:48] [INFO ] Invariant cache hit.
[2024-06-01 06:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 44354 steps (7 resets) in 12 ms. (3411 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3294417 steps, run timeout after 3001 ms. (steps per millisecond=1097 ) properties seen :0 out of 1
Probabilistic random walk after 3294417 steps, saw 1265418 distinct states, run finished after 3001 ms. (steps per millisecond=1097 ) properties seen :0
[2024-06-01 06:43:51] [INFO ] Invariant cache hit.
[2024-06-01 06:43:51] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 264 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:43:52] [INFO ] Invariant cache hit.
[2024-06-01 06:43:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 06:43:52] [INFO ] Invariant cache hit.
[2024-06-01 06:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 06:43:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:43:52] [INFO ] Invariant cache hit.
[2024-06-01 06:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01 in 14628 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:43:52] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[5003]
[2024-06-01 06:43:52] [INFO ] Invariant cache hit.
[2024-06-01 06:43:52] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:43:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:43:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:43:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:43:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:43:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:43:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:43:52] [INFO ] Added : 34 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:43:58] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:43:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1001371 steps (2 resets) in 96 ms. (10323 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 130 ms. (7633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:43:59] [INFO ] Invariant cache hit.
[2024-06-01 06:43:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:43:59] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:43:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:43:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:43:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-06-01 06:43:59] [INFO ] Added : 5 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:00] [INFO ] Invariant cache hit.
[2024-06-01 06:44:00] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 06:44:00] [INFO ] Invariant cache hit.
[2024-06-01 06:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 06:44:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:00] [INFO ] Invariant cache hit.
[2024-06-01 06:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 48945 steps (8 resets) in 13 ms. (3496 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1194888 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 2
Probabilistic random walk after 1194888 steps, saw 513400 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
[2024-06-01 06:44:03] [INFO ] Invariant cache hit.
[2024-06-01 06:44:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 273 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:03] [INFO ] Invariant cache hit.
[2024-06-01 06:44:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46684 steps (6 resets) in 11 ms. (3890 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3981122 steps, run timeout after 3016 ms. (steps per millisecond=1320 ) properties seen :0 out of 1
Probabilistic random walk after 3981122 steps, saw 1505718 distinct states, run finished after 3016 ms. (steps per millisecond=1320 ) properties seen :0
[2024-06-01 06:44:06] [INFO ] Invariant cache hit.
[2024-06-01 06:44:06] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:06] [INFO ] Invariant cache hit.
[2024-06-01 06:44:07] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 06:44:07] [INFO ] Invariant cache hit.
[2024-06-01 06:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 06:44:07] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:07] [INFO ] Invariant cache hit.
[2024-06-01 06:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-03 in 14770 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:44:07] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[168] Max Struct:[5003]
[2024-06-01 06:44:07] [INFO ] Invariant cache hit.
[2024-06-01 06:44:07] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:44:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 06:44:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:44:07] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:44:07] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:44:07] [INFO ] Added : 36 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[168] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:44:12] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 06:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:44:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000035 steps (2 resets) in 100 ms. (9901 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 216 ms. (4608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:44:12] [INFO ] Invariant cache hit.
[2024-06-01 06:44:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:44:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:44:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:12] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:44:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 06:44:12] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:12] [INFO ] Invariant cache hit.
[2024-06-01 06:44:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 06:44:12] [INFO ] Invariant cache hit.
[2024-06-01 06:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 06:44:12] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:12] [INFO ] Invariant cache hit.
[2024-06-01 06:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41518 steps (6 resets) in 30 ms. (1339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1249173 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 2
Probabilistic random walk after 1249173 steps, saw 533444 distinct states, run finished after 3002 ms. (steps per millisecond=416 ) properties seen :0
[2024-06-01 06:44:15] [INFO ] Invariant cache hit.
[2024-06-01 06:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 209 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:16] [INFO ] Invariant cache hit.
[2024-06-01 06:44:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 44018 steps (5 resets) in 33 ms. (1294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4340835 steps, run timeout after 3001 ms. (steps per millisecond=1446 ) properties seen :0 out of 1
Probabilistic random walk after 4340835 steps, saw 1629712 distinct states, run finished after 3001 ms. (steps per millisecond=1446 ) properties seen :0
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 06:44:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05 in 12682 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:44:19] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:44:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:44:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:44:19] [INFO ] [Nat]Added 9 Read/Feed constraints in 69 ms returned sat
[2024-06-01 06:44:19] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:44:20] [INFO ] Added : 33 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:44:24] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:44:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1001084 steps (2 resets) in 123 ms. (8073 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-06-01 06:44:24] [INFO ] Invariant cache hit.
[2024-06-01 06:44:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 06:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:44:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:44:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:44:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 06:44:24] [INFO ] Added : 5 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:24] [INFO ] Invariant cache hit.
[2024-06-01 06:44:24] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 06:44:24] [INFO ] Invariant cache hit.
[2024-06-01 06:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 06:44:24] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:24] [INFO ] Invariant cache hit.
[2024-06-01 06:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 43066 steps (7 resets) in 11 ms. (3588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1392576 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 2
Probabilistic random walk after 1392576 steps, saw 587133 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2024-06-01 06:44:28] [INFO ] Invariant cache hit.
[2024-06-01 06:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:28] [INFO ] Invariant cache hit.
[2024-06-01 06:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40393 steps (5 resets) in 12 ms. (3107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4493668 steps, run timeout after 3001 ms. (steps per millisecond=1497 ) properties seen :0 out of 1
Probabilistic random walk after 4493668 steps, saw 1683076 distinct states, run finished after 3001 ms. (steps per millisecond=1497 ) properties seen :0
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-06-01 06:44:31] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06 in 11727 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:44:31] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10006 steps (2 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[5003]
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:44:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 06:44:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:44:31] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:44:31] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 06:44:32] [INFO ] Added : 40 causal constraints over 10 iterations in 370 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:44:38] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:44:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000684 steps (2 resets) in 100 ms. (9907 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 138 ms. (7194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:44:38] [INFO ] Invariant cache hit.
[2024-06-01 06:44:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:44:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:44:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 06:44:38] [INFO ] Added : 5 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 06:44:39] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 49979 steps (7 resets) in 12 ms. (3844 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1393689 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 2
Probabilistic random walk after 1393689 steps, saw 587517 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2024-06-01 06:44:42] [INFO ] Invariant cache hit.
[2024-06-01 06:44:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:42] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 263 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:43] [INFO ] Invariant cache hit.
[2024-06-01 06:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 47354 steps (7 resets) in 11 ms. (3946 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4022777 steps, run timeout after 3001 ms. (steps per millisecond=1340 ) properties seen :0 out of 1
Probabilistic random walk after 4022777 steps, saw 1519830 distinct states, run finished after 3005 ms. (steps per millisecond=1338 ) properties seen :0
[2024-06-01 06:44:46] [INFO ] Invariant cache hit.
[2024-06-01 06:44:46] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 331 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:46] [INFO ] Invariant cache hit.
[2024-06-01 06:44:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:44:46] [INFO ] Invariant cache hit.
[2024-06-01 06:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 06:44:46] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:46] [INFO ] Invariant cache hit.
[2024-06-01 06:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-07 in 15204 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:44:46] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 10004 steps (1 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-06-01 06:44:46] [INFO ] Invariant cache hit.
[2024-06-01 06:44:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:44:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:44:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:44:46] [INFO ] [Nat]Added 9 Read/Feed constraints in 107 ms returned sat
[2024-06-01 06:44:46] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:44:47] [INFO ] Added : 38 causal constraints over 9 iterations in 57 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:44:51] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 06:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:44:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1000739 steps (2 resets) in 103 ms. (9622 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 159 ms. (6250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-06-01 06:44:51] [INFO ] Invariant cache hit.
[2024-06-01 06:44:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:44:51] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:51] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:44:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:51] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 06:44:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:44:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:44:51] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:51] [INFO ] Invariant cache hit.
[2024-06-01 06:44:51] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 06:44:51] [INFO ] Invariant cache hit.
[2024-06-01 06:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 06:44:51] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:51] [INFO ] Invariant cache hit.
[2024-06-01 06:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 45818 steps (7 resets) in 9 ms. (4581 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1176025 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :0 out of 2
Probabilistic random walk after 1176025 steps, saw 507299 distinct states, run finished after 3002 ms. (steps per millisecond=391 ) properties seen :0
[2024-06-01 06:44:54] [INFO ] Invariant cache hit.
[2024-06-01 06:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:54] [INFO ] Invariant cache hit.
[2024-06-01 06:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 45852 steps (7 resets) in 10 ms. (4168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4214163 steps, run timeout after 3001 ms. (steps per millisecond=1404 ) properties seen :0 out of 1
Probabilistic random walk after 4214163 steps, saw 1585402 distinct states, run finished after 3001 ms. (steps per millisecond=1404 ) properties seen :0
[2024-06-01 06:44:58] [INFO ] Invariant cache hit.
[2024-06-01 06:44:58] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:44:58] [INFO ] Invariant cache hit.
[2024-06-01 06:44:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 06:44:58] [INFO ] Invariant cache hit.
[2024-06-01 06:44:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:44:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 06:44:58] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:44:58] [INFO ] Invariant cache hit.
[2024-06-01 06:44:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13 in 11524 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 06:44:58] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[168] Max Struct:[5003]
[2024-06-01 06:44:58] [INFO ] Invariant cache hit.
[2024-06-01 06:44:58] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:44:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:44:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:44:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 06:44:58] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:44:58] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:44:58] [INFO ] Added : 34 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[168] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4999] Max Struct:[5003]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 06:45:03] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:45:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 5/45 places, 8/72 transitions.
[2024-06-01 06:45:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4999] Max Struct:[5003]
RANDOM walk for 1002418 steps (2 resets) in 103 ms. (9638 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 151 ms. (6578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:45:03] [INFO ] Invariant cache hit.
[2024-06-01 06:45:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:45:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:45:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:45:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:45:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:45:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:45:03] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:45:03] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 06:45:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/5 places, 8/8 transitions.
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000263 steps (2 resets) in 96 ms. (10311 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 151 ms. (6578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 06:45:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 06:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 06:45:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:45:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:45:04] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 06:45:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46028 steps (8 resets) in 10 ms. (4184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1417743 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 2
Probabilistic random walk after 1417743 steps, saw 596105 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2024-06-01 06:45:07] [INFO ] Invariant cache hit.
[2024-06-01 06:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 72ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 06:45:08] [INFO ] Invariant cache hit.
[2024-06-01 06:45:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 47481 steps (8 resets) in 9 ms. (4748 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4616371 steps, run timeout after 3001 ms. (steps per millisecond=1538 ) properties seen :0 out of 1
Probabilistic random walk after 4616371 steps, saw 1728215 distinct states, run finished after 3001 ms. (steps per millisecond=1538 ) properties seen :0
[2024-06-01 06:45:11] [INFO ] Invariant cache hit.
[2024-06-01 06:45:11] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 06:45:11] [INFO ] Invariant cache hit.
[2024-06-01 06:45:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 06:45:11] [INFO ] Invariant cache hit.
[2024-06-01 06:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-06-01 06:45:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 06:45:11] [INFO ] Invariant cache hit.
[2024-06-01 06:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14 in 13311 ms.
[2024-06-01 06:45:11] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:45:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 06:45:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 45 places, 72 transitions and 189 arcs took 4 ms.
Total runtime 1218652 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-00
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-01
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-03
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-05
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-06
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-07
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-13
Could not compute solution for formula : JoinFreeModules-PT-5000-UpperBounds-14
BK_STOP 1717224312047
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name JoinFreeModules-PT-5000-UpperBounds-00
ub formula formula --maxsum=/tmp/2000/ub_0_
ub formula name JoinFreeModules-PT-5000-UpperBounds-01
ub formula formula --maxsum=/tmp/2000/ub_1_
ub formula name JoinFreeModules-PT-5000-UpperBounds-03
ub formula formula --maxsum=/tmp/2000/ub_2_
ub formula name JoinFreeModules-PT-5000-UpperBounds-05
ub formula formula --maxsum=/tmp/2000/ub_3_
ub formula name JoinFreeModules-PT-5000-UpperBounds-06
ub formula formula --maxsum=/tmp/2000/ub_4_
ub formula name JoinFreeModules-PT-5000-UpperBounds-07
ub formula formula --maxsum=/tmp/2000/ub_5_
ub formula name JoinFreeModules-PT-5000-UpperBounds-13
ub formula formula --maxsum=/tmp/2000/ub_6_
ub formula name JoinFreeModules-PT-5000-UpperBounds-14
ub formula formula --maxsum=/tmp/2000/ub_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-5000"
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 JoinFreeModules-PT-5000, 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 r504-tall-171649612000093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 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 '
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 ;